ReCoG: Reciprocal Co-Evolution for Multimodal Graph Learning

• URL: http://arxiv.org/abs/2608.22786v1
• Date: Mon, 24 Aug 2026 04:16:13 GMT
• Title: ReCoG: Reciprocal Co-Evolution for Multimodal Graph Learning
• Abstract summary: Multimodal graph learning requires jointly training over graph structure and heterogeneous node attributes.<n>We propose ReCoG, a new learning paradigm that tightly couples graph structure learning and multimodal representation learning.<n>Our results demonstrate that reciprocal co-evolution of structure and semantics is important for effective multimodal graph learning.
• Score: 9.030717765733398
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multimodal graph learning requires jointly training over graph structure and heterogeneous node attributes, yet existing methods largely decouple these processes: prior multimodal graph neural networks (GNNs) focus on aligning modalities in a shared embedding space while operating on fixed or weakly adapted graph structures, and graph structure learning approaches infer topology from unimodal node representations without accounting for multimodal interactions. This separation fundamentally limits the ability of GNNs to capture semantically meaningful relationships in multimodal settings, where observed edges are often noisy, incomplete, or misaligned with underlying semantics. We propose ReCoG (Reciprocal Co-Evolution for Multimodal Graph Learning), a new learning paradigm that tightly couples graph structure learning and multimodal representation learning through end-to-end reciprocal interaction. Concretely, ReCoG integrates (i) a multimodal graph refiner that infers and corrects edges using cross-modal semantic evidence, and (ii) a coupled cross-modal message passing mechanism that performs joint intra- and inter-modality propagation over the refined graph. This unified design yields greater expressiveness than decoupled or two-stage formulations and allows dynamic interaction between topology and representation learning. Across diverse benchmarks for node classification and link prediction, ReCoG consistently outperforms strong multimodal graph structure learning baselines, including graph foundation models. Our results demonstrate that reciprocal co-evolution of structure and semantics is important for effective multimodal graph learning, challenging the prevailing separation between topology and representation learning.

Related papers

• Toward Federated Multimodal Graph Foundation Models: A Topology-Aware Multimodal Alignment Framework [35.35423006939282]
  FedGAMMA casts federated multimodal graph foundation learning as a two-stage semantic-structural alignment problem.<n>During pre-training, a shared-private semantic enhancer disentangles cross-modal commonality from modality-specific information.<n>During fine-tuning, FedGAMMA adapts the pretrained encoder through lightweight graph-aware prompts.
  arXiv  Detail & Related papers  (2026-07-17T06:57:41Z)
• TMTE: Effective Multimodal Graph Learning with Task-aware Modality and Topology Co-evolution [12.027339810975079]
  Task-aware Modality and Topology co-Evolution (TMTE) is a novel MGL framework that jointly and iteratively optimize graph topology and multimodal representations toward the target task.<n>TMTE consistently achieves state-of-the-art performance across 6 graph-centric and modality-centric tasks.
  arXiv  Detail & Related papers  (2026-03-29T14:54:59Z)
• Multimodal Graph Representation Learning with Dynamic Information Pathways [12.019248723233673]
  We propose a novel multimodal graph representation learning framework with Dynamic information Pathways (DiP)<n>DiP enables dynamic message routing within each modality via proximity-guided pseudo-node interactions.<n>Experiments across multiple benchmarks demonstrate that DiP consistently outperforms baselines.
  arXiv  Detail & Related papers  (2026-03-10T06:45:59Z)
• Graph is a Substrate Across Data Modalities [50.51414622183521]
  Graphs provide a natural representation of relational structure that arises across diverse domains.<n>Despite this ubiquity, graph structure is typically learned in a modality- and task-isolated manner.<n>We propose G-Substrate, a graph substrate framework that organizes learning around shared graph structures.
  arXiv  Detail & Related papers  (2026-01-29T22:46:02Z)
• Decoupling and Damping: Structurally-Regularized Gradient Matching for Multimodal Graph Condensation [3.2987327415317895]
  We propose Structurally-Regularized Gradient Matching (SR-GM), a novel condensation framework tailored for multimodal graphs.<n> SR-GM significantly improves accuracy and accelerates convergence compared to baseline methods.<n>This research provides a scalable methodology for multimodal graph-based learning in resource-constrained environments.
  arXiv  Detail & Related papers  (2025-11-25T11:50:34Z)
• Graph4MM: Weaving Multimodal Learning with Structural Information [52.16646463590474]
  Graphs provide powerful structural information for modeling intra- and inter-modal relationships.<n>Previous works fail to distinguish multi-hop neighbors and treat the graph as a standalone modality.<n>We propose Graph4MM, a graph-based multimodal learning framework.
  arXiv  Detail & Related papers  (2025-10-19T20:13:03Z)
• GTP-4o: Modality-prompted Heterogeneous Graph Learning for Omni-modal Biomedical Representation [68.63955715643974]
  Modality-prompted Heterogeneous Graph for Omnimodal Learning (GTP-4o) We propose an innovative Modality-prompted Heterogeneous Graph for Omnimodal Learning (GTP-4o)
  arXiv  Detail & Related papers  (2024-07-08T01:06:13Z)
• DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations [62.04558318166396]
  Graph neural networks (GNNs) demonstrate a robust capability for representation learning on graphs with complex structures. A novel GNNs framework, dubbed Decoupled Graph Neural Networks (DGNN), is introduced to obtain a more comprehensive embedding representation of nodes. Experimental results conducted on several graph benchmark datasets verify DGNN's superiority in node classification task.
  arXiv  Detail & Related papers  (2024-01-28T06:43:13Z)
• Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks [68.9026534589483]
  RioGNN is a novel Reinforced, recursive and flexible neighborhood selection guided multi-relational Graph Neural Network architecture. RioGNN can learn more discriminative node embedding with enhanced explainability due to the recognition of individual importance of each relation.
  arXiv  Detail & Related papers  (2021-04-16T04:30:06Z)
• Adversarial Graph Disentanglement [47.27978741175575]
  A real-world graph has a complex topological structure, which is often formed by the interaction of different latent factors. We propose an underlinetextbfAdversarial underlinetextbfDisentangled underlinetextbfGraph underlinetextbfConvolutional underlinetextbfNetwork (ADGCN) for disentangled graph representation learning.
  arXiv  Detail & Related papers  (2021-03-12T14:11:36Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.