mlsanityData to 14 Oct 2026

Beyond the Aggregation Dilemma: Prior-Retaining Decoupled Learning for Multimodal Graphs

arXiv 2605.24684 ↗First posted 23 May 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Multimodal Attributed Graph Learning (MAGL) integrates intrinsic node attributes with structural topology via graph aggregation. However, as pretrained encoders evolve into Large Foundation Models (LFMs), the landscape of MAGL fundamentally shifts: under high-confidence LFM priors, mandatory aggregation introduces topological noise that overwhelms discriminative signals, triggering a counter-intuitive performance inversion where sophisticated MAGL architectures underperform simple topology-agnostic MLPs. Through systematic empirical and theoretical analysis, we identify that this inversion stems from a fundamental aggregation dilemma characterized by two concurrent pathologies: (1) Representational Pathology (SNR Degradation) - mandatory aggregation dilutes robust intrinsic features with topological noise, causing the noise penalty to outweigh its collaborative benefit; and (2) Optimization Pathology (Gradient Starvation) - topological aggregation attenuates gradient flow, while a shared task loss causes dominant modalities to prematurely suppress weaker ones. To resolve this dilemma, we propose SUPRA (Shared-Unique Prior-Retaining Architecture), a decoupled dual-pathway paradigm. SUPRA processes modality-specific features through topology-agnostic MLPs while capturing structural synergy via a lightweight shared GNN, with auxiliary deep supervision counteracting gradient starvation. Extensive evaluations demonstrate that SUPRA achieves state-of-the-art performance while requiring 3.5x lower peak GPU memory and up to 4.4x faster training time than Multimodal Graph Transformers.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 27 references that are in the map. First posted on arXiv 23 May 2026.

Builds on

19 of 27 references.

References · 19

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  4. 2017Graph Attention Networkscited by 8,923
  5. 2017Inductive Representation Learning on Large Graphscited by 6,320
  6. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  7. 2019Simplifying Graph Convolutional Networkscited by 1,477
  8. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
  9. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
  10. 2023Exploring the Potential of Large Language Models (LLMs) in Learning on Graphscited by 274
  11. 2020Gradient Starvation: A Learning Proclivity in Neural Networkscited by 267
  12. 2022Balanced Multimodal Learning via On-the-fly Gradient Modulationcited by 264
7 more
  1. 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 261
  2. 2021Improving Multi-Modal Learning with Uni-Modal Teacherscited by 41
  3. 2024Learning on Multimodal Graphs: A Surveycited by 22
  4. 2024When Graph meets Multimodal: Benchmarking and Meditating on Multimodal Attributed Graphs Learningcited by 22
  5. 2025DGP: A Dual-Granularity Prompting Framework for Fraud Detection with Graph-Enhanced LLMscited by 12
  6. 2024Unleash LLMs Potential for Sequential Recommendation by Coordinating Dual Dynamic Index Mechanismcited by 8
  7. 2025Deep Semantic Graph Learning via LLM based Node Enhancementcited by 8

Built on by

Not cited yet.