EFUF: Efficient Fine-grained Unlearning Framework for Mitigating Hallucinations in Multimodal Large Language Models
Shangyu Xing, Fei Zhao, Zhen Wu, Tuo An, Weihao Chen, Chunhui Li, Jianbing Zhang, Xinyu Dai
TL;DR
EFUF introduces an efficient fine-grained unlearning framework to mitigate object hallucinations in multimodal LLMs without requiring paired data. It leverages CLIP-based text-image congruence to construct positive and negative subsentence samples and applies three losses (positive, negative, sentence) to unlearn hallucinated object alignments while preserving fluent, coherent long-form text. Across multiple MLLMs and a COCO-derived evaluation setup, EFUF achieves substantial reductions in hallucination rates and improvements in generation quality with markedly lower training costs and annotation burdens than RLHF- or DPO-based methods. The approach demonstrates strong compatibility with existing hallucination mitigation techniques and offers a scalable, data-efficient path toward more reliable multimodal generation systems.
Abstract
Multimodal large language models (MLLMs) have attracted increasing attention in the past few years, but they may still generate descriptions that include objects not present in the corresponding images, a phenomenon known as object hallucination. To eliminate hallucinations, existing methods manually annotate paired responses with and without hallucinations, and then employ various alignment algorithms to improve the alignment capability between images and text. However, they not only demand considerable computation resources during the finetuning stage but also require expensive human annotation to construct paired data needed by the alignment algorithms. To address these issues, we borrow the idea of unlearning and propose an efficient fine-grained unlearning framework (EFUF), which can eliminate hallucinations without the need for paired data. Extensive experiments show that our method consistently reduces hallucinations while preserving the generation quality with modest computational overhead. Our code and datasets will be publicly available.
