mlsanityData to 7 Oct 2026

Training-Free Cross-Architecture Merging for Graph Neural Networks

arXiv 2602.19332 ↗First posted 22 Feb 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Model merging has emerged as a powerful paradigm for combining the capabilities of distinct expert models without the high computational cost of retraining, yet current methods are fundamentally constrained to homogeneous architectures. For GNNs, however, message passing is topology-dependent and sensitive to misalignment, making direct parameter-space merging unreliable. To bridge this gap, we introduce H-GRAMA (Heterogeneous Graph Routing and Message Alignment), a training-free framework that lifts merging from parameter space to operator space. We formalize Universal Message Passing Mixture (UMPM), a shared operator family that expresses heterogeneous GNN layers in a common functional language. H-GRAMA enables cross-architecture GNN merging (e.g., GCN to GAT) without retraining, retaining high specialist accuracy in most cases in compatible depth settings and achieving inference speedups of 1.2x to 1.9x over ensembles.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 46 references that are in the map. First posted on arXiv 22 Feb 2026.

Builds on

33 of 46 references.

References · 33

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2018How Powerful are Graph Neural Networks?cited by 4,355
  5. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  6. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  7. 2019Similarity of Neural Network Representations Revisitedcited by 1,695
  8. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  9. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  10. 2022Editing Models with Task Arithmeticcited by 1,076
  11. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
  12. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
21 more
  1. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
  2. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
  3. 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
  4. 2021Merging Models with Fisher-Weighted Averagingcited by 613
  5. 2020Federated Learning with Matched Averagingcited by 564
  6. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
  7. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
  8. 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
  9. 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
  10. 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 248
  11. 2014Understanding image representations by measuring their equivariance and equivalencecited by 240
  12. 2019Model Fusion via Optimal Transportcited by 217
  13. 2021Revisiting Model Stitching to Compare Neural Representationscited by 203
  14. 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 178
  15. 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 119
  16. 2024Parameter Competition Balancing for Model Mergingcited by 71
  17. 2024Training-Free Pretrained Model Mergingcited by 32
  18. 2022Stochastic Weight Averaging Revisitedcited by 26
  19. 2024PLeaS -- Merging Models with Permutations and Least Squarescited by 16
  20. 2024Training-free Heterogeneous Model Mergingcited by 5
  21. 2025GNNMerge: Merging of GNN Models Without Accessing Training Datacited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Generalizing GNNs with Tokenized Mixture of Experts
  2. 2025Out-of-Distribution Graph Models Merging
  3. 2024Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification
  4. 2025GMoPE:A Prompt-Expert Mixture Framework for Graph Foundation Models
  5. 2024GL-Fusion: Rethinking the Combination of Graph Neural Network and Large Language model
  6. 2026A Unified Graph Language Model for Multi-Domain Multi-Task Graph Alignment Instruction Tuning
  7. 2026Scalable Heterogeneous Graph Learning via Heterogeneous-aware Orthogonal Prototype Experts
  8. 2026COMBA: Cross Batch Aggregation for Learning Large Graphs with Context Gating State Space Models