ICE: Task-Aligned Clifford Latent Fields for Multimodal Graph Foundation Models
Not on the map. Why?
Abstract (arXiv)
Multimodal attributed graphs connect entities, visual content, language, and observed relations. Learning one foundation across such graphs requires more than compressing each node into a fused Euclidean vector. The representation must preserve entity semantics, construct interaction state from graph neighborhoods, and expose that state to prediction units with different geometry. Our empirical study shows why these requirements are inseparable. Higher-grade channels recover pair relations across the foundation graphs, specialized queries reveal information hidden by a generic readout, and rigid blade isolation removes cross-grade capacity. We therefore introduce ICE (Interaction-aware Clifford Encoder), a multimodal graph foundation model built on a node-indexed Clifford latent field. Topology, text, and images enter explicit Cl(3) addresses. Edge-aware geometric products transform these directions into scalar, bivector, and trivector relations over observed neighborhoods. A protected Grade-1 route preserves entity semantics, while the full grade and depth bank remains available to fresh node and link heads. We establish exact cross-grade reachability, node-permutation equivariance, and a bound on the task residual around the semantic score. Experiments span one shared foundation over eleven graphs, six node-classification datasets, three link-prediction datasets, and matched few-shot tasks. ICE ranks first in all 30 reported supervised and few-shot comparisons. Core removals reduce every task summary, and mechanism controls connect the gains to higher-order transport, retained multidepth structure, semantic protection, and direct field access.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 16 references that are in the map. First posted on arXiv 24 Sep 2026.
Builds on
12 of 16 references.
References · 12
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2023GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learnercited by 132
- 2024GFT: Graph Foundation Model with Transferable Tree Vocabularycited by 85
- 2025SAMGPT: Text-free Graph Foundation Model for Multi-domain Pre-training and Cross-domain Adaptationcited by 62
- 2022Multimodal learning with graphscited by 54
- 2025UniGraph2: Learning a Unified Embedding Space to Bind Multimodal Graphscited by 49
- 2025RiemannGFM: Learning a Graph Foundation Model from Riemannian Geometrycited by 35
- 2024Mosaic of Modalities: A Comprehensive Benchmark for Multimodal Graph Learningcited by 29
- 2024Learning on Multimodal Graphs: A Surveycited by 22
- 2026Toward Effective Multimodal Graph Foundation Model: A Divide-and-Conquer Based Approachcited by 7
- 2026LION: A Clifford Neural Paradigm for Multimodal-Attributed Graph Learningcited by 2
Built on by
Not cited yet.