Skip to content

ReCoG: Reciprocal Co-Evolution for Multimodal Graph Learning

Aug 2026 · 0 citations · 36 references
Computer Science

TL;DR

ReCoG (Reciprocal Co-Evolution for Multimodal Graph Learning) is proposed, a new learning paradigm that tightly couples graph structure learning and multimodal representation learning through end-to-end reciprocal interaction and yields greater expressiveness than decoupled or two-stage formulations.

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.

View source

Similar papers

Preprint Sep 2026

Signal or Noise? Modality Contribution and Cooperation in Multimodal GraphRAG

Multimodal knowledge graphs (KGs) integrate information from text, figures, tables, and other modalities into a unified structured representation, with the promise that richer evidence enables better inference. In GraphRAG systems built over such graphs, it is commonly assumed that retrieving evidence from more modalit...

A. Georgakopoulos, Paul T. Groth, Lise Stork · 0 citations
Sep 2026

Learning curvature-aware multimodal representations with bicomplex embeddings

CurvBi (Curvature-aware Bicomplex), a novel framework for multimodal knowledge graph completion that unifies modality alignment and relational modeling under a coherent mathematical foundation, is proposed.

Thanh Le, Vy Cao, Duong-Khang Au et al. · 0 citations
Book Open access Aug 2026

ECHO: Adaptive Community Search over Multimodal Graphs

An adaptive community search framework ECHO is proposed, which consistently outperforms state-of-the-art methods in terms of community quality while achieving superior search efficiency.

Cheng-Yang Luo, Zi-Xing Ding, Qing Liu et al. · 0 citations
#machine learning Preprint Sep 2026

Graph Domain Adaptation Does Not End with Representation Learning

EviGDA is proposed, an Evidence-Augmented Graph Domain Adaptation framework that complements graph representation adaptation with a graph-free local expert, and shows that EviGDA outperforms state-of-the-art baselines.

Zi-Qian Liu, Yong-Xue Xu, En-Ze Zhang et al. · 0 citations
#machine learning Preprint Sep 2026

MURAL: Multimodal Uncertainty-aware Recommendation via Adaptive edge Learning

Multimodal Graph Neural Networks have become standard for recommendation by augmenting sparse interaction data with content features. Yet current architectures face two bottlenecks: structural rigidity, from a reliance on static precomputed similarity graphs that cannot adapt to evolving preferences; and semantic fragi...

Ahmad Mousavi, Majid Alikhani, Yeon-Chang Lee et al. · 0 citations
Book Open access Aug 2026

MOBI: Monolithic Graph-Language Modeling Beyond Modality Interference

Graph-Language Models (GLMs) aim to endow LLMs with structure-grounded reasoning ability, yet existing solutions often struggle with modality interference : structural information can disrupt pretrained linguistic reasoning, while language cues can overwhelm structural signals. Mainstream modular GLMs with an external...

Zhiyao Zhou, Yugang Ji, Zi-Wen Xu et al. · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.