DA-DPO: Cost-efficient Difficulty-aware Preference Optimization for Reducing MLLM Hallucinations

Longtian Qiu, Shan Ning, Chuyu Zhang, Jiaxuan Sun, Xuming He
1/2/2026
cs.AI

No official code found. Best implementation: Artanic30/DA-DPO (4 stars, Apache-2.0, last commit 2026-01-25).

Abstract

Direct Preference Optimization (DPO) has shown strong potential for mitigating hallucinations in Multimodal Large Language Models (MLLMs). However, existing multimodal DPO approaches often suffer from overfitting due to the difficulty imbalance in preference data. Our analysis shows that MLLMs tend to overemphasize easily distinguishable preference pairs, which hinders fine-grained hallucination suppression and degrades overall performance. To address this issue, we propose Difficulty-Aware Direct Preference Optimization (DA-DPO), a cost-effective framework designed to balance the learning process. DA-DPO consists of two main components: (1) Difficulty Estimation leverages pre-trained vision--language models with complementary generative and contrastive objectives, whose outputs are integrated via a distribution-aware voting strategy to produce robust difficulty scores without additional training; and (2) Difficulty-Aware Training reweights preference pairs based on their estimated difficulty, down-weighting easy samples while emphasizing harder ones to alleviate overfitting. This framework enables more effective preference optimization by prioritizing challenging examples, without requiring new data or extra fine-tuning stages. Extensive experiments demonstrate that DA-DPO consistently improves multimodal preference optimization, yielding stronger robustness to hallucinations and better generalization across standard benchmarks, while remaining computationally efficient. The project page is available at https://artanic30.github.io/project_pages/DA-DPO/.

View on arXivView PDF

Code Implementations(1)

Artanic30/DA-DPOCommunity72%
Apache-2.0

Official Implementation for TMLR25 DA-DPO: Cost-efficient Difficulty-aware Preference Optimization for Reducing MLLM Hallucinations

40C, ShellJan 1, 20268 months agoApache-2.0

Similar Papers

Cite this paper

@article{qiu2026dadpo,
  title  = {DA-DPO: Cost-efficient Difficulty-aware Preference Optimization for Reducing MLLM Hallucinations},
  author = {Longtian Qiu and Shan Ning and Chuyu Zhang and Jiaxuan Sun and Xuming He},
  year   = {2026},
  eprint = {2601.00623},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.00623v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.00623.svg)](https://codeofpaper.com/paper/2601.00623)

Discussion