Skip to content

Cross-Resolution Semantic Learning for Graph Domain Adaptation

Jul 2026 · arXiv.org · Vol abs/2607.29365 · 1 citation · 53 references
Computer Science

TL;DR

Cross-Resolution Semantic Learning (CReSL), a GDA method that learns soft sourceto-target resolution correspondence from cross-domain class structure, and introduces Cross-Resolution Prototype Transport, which constructs class-resolution prototypes from source labels and soft target posteriors and converts cross-domain prototype discrepancies into expert-specific routing over target resolutions.

Abstract

Graph Domain Adaptation (GDA) transfers predictive knowledge from labeled source graphs to unlabeled target graphs under distribution shift. Existing methods align representations or regularize graph structures, but do not explicitly model how class-discriminative knowledge learned at different source neighborhood ranges should be routed across target ranges. We call the neighborhood range encoded by a graph representation its propagation resolution and define semantic resolution shift as a cross-domain change in the propagation resolutions at which class-discriminative evidence is strongest. Such shifts can make fixed same-resolution pairing suboptimal and increase the risk of negative transfer. To address this issue, we propose Cross-Resolution Semantic Learning (CReSL), a GDA method that learns soft sourceto-target resolution correspondence from cross-domain class structure. First, CReSL constructs a multi-resolution representation bank using a shared Graph Neural Network and learnable resolution embeddings, with a resolution-indexed expert for each source resolution. Second, CReSL introduces Cross-Resolution Prototype Transport, which constructs class-resolution prototypes from source labels and soft target posteriors and converts cross-domain prototype discrepancies into expert-specific routing over target resolutions. Third, CReSL introduces Cross-Resolution Target Grafting, which constructs posterior-weighted target-to-source prototype displacements and enforces correspondence-weighted prediction consistency for instance-level adaptation under class uncertainty. Extensive experiments on graph benchmarks under diverse domain shifts show that CReSL outperforms strong representative baselines across most settings.

View source

Similar papers

#machine learning Preprint Sep 2026

Graph Domain Adaptation Does Not End with Representation Learning

EviGDA is proposed, an Evidence-Augmented Graph Domain Adaptation framework that complements graph representation adaptation with a graph-free local expert, and shows that EviGDA outperforms state-of-the-art baselines.

Zi-Qian Liu, Yong-Xue Xu, En-Ze Zhang et al. · 0 citations
Preprint Sep 2026

SUCRe: Selective Uncertainty-Aware Contrastive Representation for Graph Transfer Learning

This work introduces structure-aware entropy-based matching discrepancy, which jointly models feature uncertainty and structural coherence to ensure accurate feature adaptation between graphs and develops a domain-aware semi-hard negative sampling strategy that constructs informative contrastive sets by filtering unrel...

Ming-Can Wang, Jun-Chang Xin, Zhong-Ming Yao et al. · 0 citations
Preprint Aug 2026

SelfGraphRAG: Bridging the Supervision Gap in Graph-Based RAG with Synthetic QA Generation

SelfGraphRAG, a framework that generates question-answer pairs directly from knowledge graph structure and uses them to train a query-conditioned graph retriever, suggests that knowledge graph structure can provide useful supervision for training graph retrievers when labeled data are unavailable.

Ben Lagnese, Manas Gaur · 0 citations
#machine learning Preprint Sep 2026

HyperLabel: Multi-Label Classification via Hypergraph-Based Label Correlation Modeling

This work proposes HyperLabel, an encoder-decoder framework that explicitly models label dependencies through hypergraph neural networks, and proposes a unified cross-modal learning approach where HGNN+ performs bidirectional message passing to integrate feature information with label structure, and a shared cross-atte...

Pei-Yu Zhang, Heng Ping, Nikos Kanakaris et al. · 0 citations
Conference Open access Sep 2026

LLMs as Parametric Knowledge Sources for Knowledge Graph Completion

This framework performs LLM knowledge elicitation to extract factual knowledge from the model’s internal representations and transforms sentence-level representations into entity-level representations and aligns them within a unified space.

Deyu Chen, Qi-Yuan Li, Jinguang Gu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.