Modality robustness under knowledge conflict is studied across 13 MLLMs and two datasets, and it is found that instability has practical consequences: it degrades performance in multimodal RAG and can be exploited by adversarial attacks.
Abstract
Multimodal large language models (MLLMs) are increasingly provided with contextual evidence in heterogeneous forms: as a text passage, as a rendered image of the same passage, or as both together. However, it remains unclear how consistently these surface forms are processed, especially when the evidence conflicts with the model's parametric knowledge. We study modality robustness under knowledge conflict across 13 MLLMs and two datasets, and find them far from robust. (1) Contrary to common belief, models favor a context that contradicts parametric knowledge more readily in image form than in text form; (2) when a contradicting text and image are presented together, the preferred modality is essentially arbitrary, varying with input order, model, and dataset. We further demonstrate that this instability has practical consequences: it degrades performance in multimodal RAG and can be exploited by adversarial attacks. To alleviate this brittleness, we examine several simple techniques---prompting, steering, supervised fine-tuning (SFT), and direct preference optimization; the majority prove ineffective, whereas SFT achieves moderate success. We therefore call for greater awareness of this inconsistency and argue that it is fundamental, demanding attention at multiple training stages.
A 998-case diagnostic is introduced that independently varies visual evidence, commonsense priors, and external text, and probes when this failure arises by moving the information boundary around a context-blind visual witness.
Multimodal large language models (MLLMs) have extended the capability of large language models (LLMs) to process more contextual multimodal information, showing remarkable progress in diverse realistic multimodal applications. Despite their strong perception and reasoning abilities, recent studies reveal that MLLMs rem...
Dai-Zong Liu, Junhao Dong, Zhi-Yuan Ma et al.· IEEE transactions on multime...· 0 citations
Adaptive Relevance-guided Evidence Allocation (AREA) is introduced, a training-free inference-time method that formulates evidence highlighting as adaptive allocation and establishes the best performance among training-free highlighting methods.
Zhen-Bin Wang, Lei Zhang, Li-Tuan Wang et al.· 0 citations
ForUM is presented, a training-free test-time fusion of frozen MLLMs guided by two fixed geometric rules: agreement-based selection keeps the region supported by the most distinct models, and medoid localization returns an actual member box instead of a coordinate average, so one loose prediction cannot shift the answe...
Taiyo Sato, Takamasa Sanda, Keisuke Maeda et al.· 0 citations
Adversarial Contrastive Fine-Tuning (ACFT) uses an Adversarial Hallucination Attribute Flipping procedure, involving minimal, targeted adversarial perturbations that flip an image's hallucination attribute, to construct perfectly aligned positive-negative pairs, which are then used for contrastive fine- tuning.
Pei-Yang Xu, Xiaopei Zhu, Jun Zhu et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduSep 24, 2026