Learning on Multimodal Graphs: A Survey
read the original abstract
Multimodal data pervades various domains, including healthcare, social media, and transportation, where multimodal graphs play a pivotal role. Machine learning on multimodal graphs, referred to as multimodal graph learning (MGL), is essential for successful artificial intelligence (AI) applications. The burgeoning research in this field encompasses diverse graph data types and modalities, learning techniques, and application scenarios. This survey paper conducts a comparative analysis of existing works in multimodal graph learning, elucidating how multimodal learning is achieved across different graph types and exploring the characteristics of prevalent learning techniques. Additionally, we delineate significant applications of multimodal graph learning and offer insights into future directions in this domain. Consequently, this paper serves as a foundational resource for researchers seeking to comprehend existing MGL techniques and their applicability across diverse scenarios.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Towards Robust Federated Multimodal Graph Learning under Modality Heterogeneity
FedMPO recovers missing modalities via topology-aware generation, filters noisy recoveries with missing-aware routing, and uses reliability-aware aggregation to achieve up to 5.65% gains over baselines in high-missing...
-
Beyond the Aggregation Dilemma: Prior-Retaining Decoupled Learning for Multimodal Graphs
SUPRA resolves the aggregation dilemma in MAGL by decoupling modality-specific MLP paths from a shared lightweight GNN, achieving SOTA performance with 3.5x lower memory and 4.4x faster training.
-
Stable Multimodal Graph Unlearning via Feature-Dimension Aware Quantile Selection
FDQ improves stability in multimodal graph unlearning by using feature-dimension aware quantile selection to protect sensitive high-dimensional layers while preserving utility and enabling effective forgetting.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.