mlsanityData to 7 Oct 2026

Multimodal Graph Representation Learning with Dynamic Information Pathways

arXiv 2603.09258 ↗First posted 10 Mar 2026cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Multimodal graphs, where nodes contain heterogeneous features such as images and text, are increasingly common in real-world applications. Effectively learning on such graphs requires both adaptive intra-modal message passing and efficient inter-modal aggregation. However, most existing approaches to multimodal graph learning are typically extended from conventional graph neural networks and rely on static structures or dense attention, which limit flexibility and expressive node embedding learning. In this paper, we propose a novel multimodal graph representation learning framework with Dynamic information Pathways (DiP). By introducing modality-specific pseudo nodes, DiP enables dynamic message routing within each modality via proximity-guided pseudo-node interactions and captures inter-modality dependence through efficient information pathways in a shared state space. This design achieves adaptive, expressive, and sparse message propagation across modalities with linear complexity. We conduct the link prediction and node classification tasks to evaluate performance and carry out full experimental analyses. Extensive experiments across multiple benchmarks demonstrate that DiP consistently outperforms baselines.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 50 references that are in the map. First posted on arXiv 10 Mar 2026.

Builds on

28 of 50 references.

References · 28

  1. 2017Attention Is All You Needcited by 59,932
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  5. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  6. 2017Graph Attention Networkscited by 8,854
  7. 2017Inductive Representation Learning on Large Graphscited by 6,284
  8. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  9. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  10. 2023ImageBind: One Embedding Space To Bind Them Allcited by 1,162
  11. 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
  12. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
16 more
  1. 2019Graph U-Netscited by 489
  2. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
  3. 2019Diffusion Improves Graph Learningcited by 414
  4. 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 163
  5. 2019ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representationscited by 156
  6. 2018Learning Multimodal Graph-to-Graph Translation for Molecular Optimizationcited by 87
  7. 2019Fine-Grained Spoiler Detection from Large-Scale Review Corporacited by 76
  8. 2023Evaluating Graph Neural Networks for Link Prediction: Current Pitfalls and New Benchmarkingcited by 69
  9. 2022A Survey of Graph Neural Networks for Social Recommender Systemscited by 65
  10. 2023How does over-squashing affect the power of GNNs?cited by 53
  11. 2025UniGraph2: Learning a Unified Embedding Space to Bind Multimodal Graphscited by 47
  12. 2024Mosaic of Modalities: A Comprehensive Benchmark for Multimodal Graph Learningcited by 28
  13. 2023Multimodal Graph Learning for Generative Taskscited by 27
  14. 2022Boosting Graph Structure Learning with Dummy Nodescited by 13
  15. 2023TouchUp-G: Improving Feature Representation through Graph-Centric Finetuningcited by 12
  16. 2020Graph Wasserstein Correlation Analysis for Movie Retrievalcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.