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

πŸ“… 2026-05-23
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF
πŸ€– AI Summary
In the context of large foundation models providing strong priors, conventional multimodal graph learning underperforms even simple MLPs due to topological noise induced by forced aggregation and resultant gradient starvation. This work is the first to identify and systematically analyze this β€œaggregation dilemma,” proposing SUPRA, a decoupled dual-path architecture: one path preserves modality-specific priors via a topology-agnostic MLP, while the other captures structural synergy through a lightweight shared GNN, complemented by deep supervision to alleviate gradient starvation. The method achieves state-of-the-art performance across multiple benchmarks, reducing peak GPU memory consumption by 3.5Γ— and accelerating training by up to 4.4Γ— compared to multimodal graph Transformers.
πŸ“ Abstract
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.
Problem

Research questions and friction points this paper is trying to address.

Multimodal Graph Learning
Aggregation Dilemma
Topological Noise
Gradient Starvation
Large Foundation Models
Innovation

Methods, ideas, or system contributions that make the work stand out.

Decoupled Learning
Prior-Retaining
Multimodal Graph Learning
Aggregation Dilemma
Gradient Starvation
πŸ”Ž Similar Papers
No similar papers found.
Hao Yan
Hao Yan
Central South University
Graph Neural Networks
X
Xuanru Wang
School of Computer Science and Engineering, Central South University, Changsha, China
J
Jun Yin
Department of Data Science and Artificial Intelligence, The Hong Kong Polytechnic University, Hong Kong SAR, China
Shirui Pan
Shirui Pan
Professor, ARC Future Fellow, FQA, Director of TrustAGI Lab, Griffith University
Data MiningMachine LearningGraph Neural NetworksTrustworthy AITime Series
S
Senzhang Wang
School of Computer Science and Engineering, Central South University, Changsha, China
Chengqi Zhang
Chengqi Zhang
Chair Professor of Artificial Intelligence
Data Mining