SMGFM: Spectral Multimodal Graph Pretraining for Multimodal-Attributed Graphs
Not on the map. Why?
Abstract (arXiv)
Multimodal-attributed graphs (MAGs) couple graph topology with node semantics from text, images, and other modalities. Traditional graph learning contextualizes node semantics by coupling topology with node features. However, this coupling design becomes troublesome in MAGs, where structure-induced and modality-intrinsic semantics may contribute differently to downstream tasks. Structure-induced semantics promote relational consistency through smooth topological variation, whereas modality-intrinsic semantics often encode local, fine-grained distinctions that should not be uniformly smoothed or aligned. Therefore, the key challenge is to identify semantic roles before cross-modal fusion. To this end, we leverage graph-frequency variation as a prior, where low-frequency components capture topology-consistent semantics and high-frequency components preserve modality-specific semantics. Based on this intuition, we propose SMGFM, a spectral multimodal graph pretraining framework that decomposes each modality-specific node signal into graph-frequency bands and assigns band-level semantic roles before cross-modal interaction. Concretely, SMGFM constructs frequency-resolved modality tokens with scalable Chebyshev filters, estimates their coupling reliability through topology-conditioned routing, and performs band-modality interaction before fusion. Its frequency-routed objectives align smooth consensus routes while preserving modality-specific routes, mitigating spatial-domain entanglement and uniform cross-modal alignment. Extensive experiments conducted on the MAG datasets demonstrate that SMGFM achieves state-of-the-art performance across graph-level and modality-level tasks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 41 of its 56 references that are in the map. First posted on arXiv 11 Jun 2026.
Builds on
41 of 56 references.
References · 41
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2017Graph Attention Networkscited by 8,923
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2023ImageBind: One Embedding Space To Bind Them Allcited by 1,175
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
29 more
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 463
- 2021SMIL: Multimodal Learning with Severely Missing Modalitycited by 245
- 2021BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximationcited by 195
- 2022Are Multimodal Transformers Robust to Missing Modality?cited by 186
- 2022How Powerful are Spectral Graph Neural Networkscited by 169
- 2023Multi-modal Learning with Missing Modality via Shared-Specific Feature Modellingcited by 163
- 2023GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learnercited by 132
- 2023Specformer: Spectral Graph Neural Networks Meet Transformerscited by 102
- 2020Graph Structured Network for Image-Text Matchingcited by 93
- 2024GFT: Graph Foundation Model with Transferable Tree Vocabularycited by 85
- 2021GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophilycited by 84
- 2023Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothingcited by 67
- 2024UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphscited by 66
- 2024GraphCLIP: Enhancing Transferability in Graph Foundation Models for Text-Attributed Graphscited by 58
- 2025UniGraph2: Learning a Unified Embedding Space to Bind Multimodal Graphscited by 49
- 2021AdaGNN: Graph Neural Networks with Adaptive Frequency Response Filtercited by 43
- 2022Revisiting Graph Contrastive Learning from the Perspective of Graph Spectrumcited by 43
- 2023LGMRec: Local and Global Graph Learning for Multimodal Recommendationcited by 38
- 2023Graph Neural Networks with Learnable and Optimal Polynomial Basescited by 36
- 2024Mosaic of Modalities: A Comprehensive Benchmark for Multimodal Graph Learningcited by 29
- 2024When Graph meets Multimodal: Benchmarking and Meditating on Multimodal Attributed Graphs Learningcited by 22
- 2022Node-oriented Spectral Filtering for Graph Neural Networkscited by 17
- 2025GRAPHGPT-O: Synergistic Multimodal Comprehension and Generation on Graphscited by 17
- 2025Graph4MM: Weaving Multimodal Learning with Structural Informationcited by 17
- 2026OpenMAG: A Comprehensive Benchmark for Multimodal-Attributed Graphcited by 13
- 2022NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation Learningcited by 11
- 2024Async Learned User Embeddings for Ads Delivery Optimizationcited by 7
- 2026Toward Effective Multimodal Graph Foundation Model: A Divide-and-Conquer Based Approachcited by 7
Built on by
Not cited yet.