mlsanityData to 14 Oct 2026

OptiMAG: Structure-Semantic Alignment via Unbalanced Optimal Transport

arXiv 2601.22856 ↗First posted 30 Jan 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Multimodal Attributed Graphs (MAGs) have been widely adopted for modeling complex systems by integrating multi-modal information, such as text and images, on nodes. However, we identify a discrepancy between the implicit semantic structure induced by different modality embeddings and the explicit graph structure. For instance, neighbors in the explicit graph structure may be close in one modality but distant in another. Since existing methods typically perform message passing over the fixed explicit graph structure, they inadvertently aggregate dissimilar features, introducing modality-specific noise and impeding effective node representation learning. To address this, we propose OptiMAG, an Unbalanced Optimal Transport-based regularization framework. OptiMAG employs the Fused Gromov-Wasserstein distance to explicitly guide cross-modal structural consistency within local neighborhoods, effectively mitigating structural-semantic conflicts. Moreover, a KL divergence penalty enables adaptive handling of cross-modal inconsistencies. This framework can be seamlessly integrated into existing multimodal graph models, acting as an effective drop-in regularizer. Experiments demonstrate that OptiMAG consistently outperforms baselines across multiple tasks, ranging from graph-centric tasks (e.g., node classification, link prediction) to multimodal-centric generation tasks (e.g., graph2text, graph2image). The source code will be available upon acceptance.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 25 references that are in the map. First posted on arXiv 30 Jan 2026.

Builds on

15 of 25 references.

References · 15

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  3. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
  4. 2018Computational Optimal Transportcited by 780
  5. 2022Graph Neural Networks for Graphs with Heterophily: A Surveycited by 175
  6. 2018Optimal Transport for structured data with application on graphscited by 172
  7. 2019Gromov-Wasserstein Learning for Graph Matching and Node Embeddingcited by 126
  8. 2018Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical propertiescited by 93
  9. 2019Sinkhorn Divergences for Unbalanced Optimal Transportcited by 55
  10. 2025UniGraph2: Learning a Unified Embedding Space to Bind Multimodal Graphscited by 49
  11. 2024Mosaic of Modalities: A Comprehensive Benchmark for Multimodal Graph Learningcited by 29
  12. 2025GRAPHGPT-O: Synergistic Multimodal Comprehension and Generation on Graphscited by 17
3 more
  1. 2025Cross-Contrastive Clustering for Multimodal Attributed Graphs with Dual Graph Filteringcited by 14
  2. 2025On the Value of Cross-Modal Misalignment in Multimodal Representation Learningcited by 10
  3. 2024Learn from Heterophily: Heterophilous Information-enhanced Graph Neural Networkcited by 3

Built on by

Not cited yet.