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 unreliable cross-domain relationships.
Abstract
Graph transfer learning (GTL) provides a promising paradigm for adapting knowledge from source graphs with sufficient labels to label-scarce target graphs. However, existing approaches often assume that transferred knowledge is uniformly reliable, ignoring the different transferability of samples caused by structural and distribution shifts across graphs. This limitation leads to negative transfer and unnecessary computational overhead. In this work, we propose SUCRe, a selective uncertainty-aware contrastive representation method for GTL. The key idea is to selectively adapt and transfer graph knowledge according to its estimated reliability. Specifically, we introduce structure-aware entropy-based matching discrepancy, which jointly models feature uncertainty and structural coherence to ensure accurate feature adaptation between graphs. Moreover, we develop a domain-aware semi-hard negative sampling strategy that constructs informative contrastive sets by filtering unreliable cross-domain relationships, reducing computational redundancy while enhancing representation discrimination. Extensive experiments on graph transfer benchmarks demonstrate that SUCRe achieves competitive performance with improved efficiency.
Graph domain adaptation (GDA) transfers knowledge from a labeled source graph to an unlabeled target graph under shifts in both node attributes and graph structure. Existing methods primarily adapt graph representations through propagation redesign, distribution alignment, or source-to-target transition modeling, but s...
Zi-Qian Liu, Yong-Xue Xu, En-Ze Zhang et al.· 0 citations
GATTA (Graph Active Learning with Test-Time Augmentation) is introduced, a framework for enhancing active learning by aggregating predictions across multiple augmented views to produce more reliable uncertainty estimates, and generalizes across architectures, and outperforms model-side ensemble methods such as MC Dropo...
Zsombor Bánfi, András Gézsi, András Formanek· 0 citations
Few-shot node classification is a fundamental challenge for Graph Neural Networks (GNNs), where models must generalize from a limited number of labeled nodes. Under such label scarcity, conventional studies have employed Graph Contrastive Learning with graph view augmentation to improve representation learning. However...
FlowNeg is introduced, a context-conditioned hierarchical generative flow network that amortizes reward-proportional sampling without normalizing a composite reward over the entity set: given a positive triple and corruption side, it selects a type, then an entity.
Graph data distillation frameworks have shown great potential in compressing graph representations and improving learning efficiency. Nevertheless, their robustness and generalization remain limited when applied to different graph neural network architectures. To address these limitations, we propose Adaptive Universal...
Jun-Qi Liu, Yu Xie, Tian-Jun Ma et al.· Journal of networking and ne...· 0 citations
This work proposes a transferable graph purification scheme, named ProGAP, to bridge adversarial defense knowledge via vulnerability-aware graph prompt learning, and achieves 1%-9% improvement, and reduces the time consumption by up to 2.2x.
Shuo-Min Xue, Jing-Yuan Li, Ju Jia 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.