mlsanityData to 14 Oct 2026

DIB-OD: Preserving the Invariant Core for Robust Heterogeneous Graph Adaptation via Decoupled Information Bottleneck and Online Distillation

arXiv 2604.10882 ↗First posted 13 Apr 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph pre-training can facilitate knowledge transfer across graph datasets, but severe structural and feature shifts may cause negative transfer and adaptation-induced overwriting of reusable knowledge. We propose DIB-OD, a heterogeneous graph adaptation framework that combines a Decoupled Information Bottleneck with Online Distillation. A multiview teacher first learns a compressed, task-relevant representation, which is distilled into a transferable core branch and a complementary residual branch. Mutual-information objectives and HSIC-based dependence regularization discourage information overlap between the branches, while a confidence-aware semantic regularizer and a frozen teacher anchor reliable pretrained information during target-domain adaptation. Experiments on seven graph-classification datasets spanning chemical, biological, and social-network domains show consistent improvements over representative baselines, particularly under challenging cross-type transfer.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 34 references that are in the map. First posted on arXiv 13 Apr 2026.

Builds on

21 of 34 references.

References · 21

  1. 2017Graph Attention Networkscited by 8,923
  2. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  3. 2019Strategies for Pre-training Graph Neural Networkscited by 971
  4. 2019Relational Knowledge Distillationcited by 889
  5. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
  6. 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 448
  7. 2020CLUB: A Contrastive Log-ratio Upper Bound of Mutual Informationcited by 235
  8. 2020Graph Information Bottleneckcited by 168
  9. 2020Cross-Layer Distillation with Semantic Calibrationcited by 143
  10. 2022GOOD: A Graph Out-of-Distribution Benchmarkcited by 141
  11. 2022Disentangled Representation Learningcited by 112
  12. 2021Generalizing Graph Neural Networks on Out-Of-Distribution Graphscited by 71
9 more
  1. 2024UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphscited by 66
  2. 2019DANE: Domain Adaptive Network Embeddingcited by 43
  3. 2022Non-IID Transfer Learning on Graphscited by 43
  4. 2023Does Invariant Graph Learning via Environment Augmentation Learn Invariance?cited by 42
  5. 2024Fully-inductive Node Classification on Arbitrary Graphscited by 39
  6. 2021On Representation Knowledge Distillation for Graph Neural Networkscited by 38
  7. 2024Pairwise Alignment Improves Graph Domain Adaptationcited by 25
  8. 2025Homophily Enhanced Graph Domain Adaptationcited by 9
  9. 2023Cross-View Graph Consistency Learning for Invariant Graph Representationscited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Data-Efficient Agentic Graph Domain Adaptation via Reliability-Aware Prototype Learning
  2. 2026Scalable Heterogeneous Graph Learning via Heterogeneous-aware Orthogonal Prototype Experts
  3. 2022Boosting Graph Neural Networks via Adaptive Knowledge Distillation
  4. 2025A Scalable Pretraining Framework for Link Prediction with Efficient Adaptation
  5. 2025Adaptive Graph Mixture of Residual Experts: Unsupervised Learning on Diverse Graphs with Heterogeneous Specialization
  6. 2021ROD: Reception-aware Online Distillation for Sparse Graphs
  7. 2022Alignahead: Online Cross-Layer Knowledge Extraction on Graph Neural Networks
  8. 2025SA2GFM: Enhancing Robust Graph Foundation Models with Structure-Aware Semantic Augmentation