arXiv:cs.LG· Zekai Chen, Kai Hu, YuXin Zeng, Xunkai Li, Xun Wu, Yinlin Zhu, Zhengyu Wu, Xu Wang, Rong-Hua Li·· 3 小时前AI 评分33
MAG-SCOUT:判断多模态数据何时该做图化
No-Free-Graph: Learning When Multimodal Data Should Be Graphified
AI 导读
针对多模态图学习中"是否该引入关系结构"这一被忽视的问题,研究者提出预构建图评估框架 MAG-SCOUT,在生成完整拓扑前估计图化的预期效用与构建成本,据此决定构建或跳过。在六个多模态数据集、三类下游任务和多种图构建器上,MAG-SCOUT 节省了 33.1% 的任务宏观图工作量,同时保留 96.7% 的留出正收益质量。
正文
Abstract:Multimodal graph learning has recently emerged as an effective paradigm for in corporating inter-entity relationships into multimodal representations. Existing studies have made substantial progress on how to construct and optimize graphs, but rarely consider a more fundamental question: whether additional relational structures should be introduced for a given dataset and task. Through empirical studies across diverse datasets, tasks, and graph constructors, we reveal that graphification is not consistently beneficial: introducing relational structures can provide substantial improvements in some cases, while offering limited or even negative gains. This observation motivates a new perspective that graph construction should be treated as a selective decision based on its expected utility rather than a default preprocessing step. To address this issue, we propose MAG-SCOUT, a pre-construction graph assessment framework that estimates whether introducing graph structures is beneficial before generating the complete topology. MAG-SCOUT collects limited relational evidence, analyzes its potential taskspecific contribution, and estimates the expected utility of graphification together with construction cost to make a build-or-skip decision. Extensive experiments across six multimodal datasets, three downstream tasks, and diverse graph constructors demonstrate that MAG-SCOUT effectively identifies when graph structures should be introduced, saving 33.1% of task-macro graph work while retaining 96.7% of held-out positive-gain mass under the pre-registered floor.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2610.02768 [cs.LG] |
| (or arXiv:2610.02768v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2610.02768 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Zekai Chen [view email]
[v1]
Fri, 2 Oct 2026 03:48:52 UTC (478 KB)
来源:arXiv:cs.LG · arxiv.org