paper-with-me

Papers

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

2026-01-02 · Longtian Qiu, Shan Ning, Chuyu Zhang, Jiaxuan Sun, Xuming He arxiv

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/.

📄 PDF Abstract BibTeX arXiv:2601.00623

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

QUIVER: Cost-Aware Adaptive Preference Querying in Surrogate-Assisted Evolutionary Multi-Objective Optimization

2026-05-05 · Florian A. D. Burnat arxiv

Interactive multi-objective optimization systems face a budget allocation dilemma: one can spend resources on expensive objective evaluations or on eliciting decision-maker preferences that identify the relevant region o…

Mitigating Overthinking in Large Reasoning Models via Difficulty-aware Reinforcement Learning

2026-01-29 · Qian Wan, Ziao Xu, Luona Wei, Xiaoxuan Shen 외 arxiv

Large Reasoning Models (LRMs) achieve explicit chain-of-thought expansion by imitating deep thinking behaviors of humans, demonstrating excellent performance in complex task scenarios. However, the deep-thinking mode oft…

Reinforcement Learning

LPOI: Listwise Preference Optimization for Vision Language Models

2025-05-27 · Fatemeh Pesaran Zadeh, Yoojin Oh, Gunhee Kim

Aligning large VLMs with human preferences is a challenging task, as methods like RLHF and DPO often overfit to textual information or exacerbate hallucinations. Although augmenting negative image samples partially addre…

Object

Less is More Tokens: Efficient Math Reasoning via Difficulty-Aware Chain-of-Thought Distillation

2025-09-05 · Abdul Waheed, Chancharik Mitra, Laurie Z. Wang, Deva Ramanan 외 arxiv

Chain-of-thought reasoning, while powerful, can produce unnecessarily verbose output for simpler problems. We present a framework for difficulty-aware reasoning that teaches models to dynamically adjust reasoning depth b…

Small-Margin Preferences Still Matter-If You Train Them Right

2026-02-01 · Jinlong Pang, Zhaowei Zhu, Na Di, Yichi Zhang 외 arxiv

Preference optimization methods such as DPO align large language models (LLMs) using paired comparisons, but their effectiveness can be highly sensitive to the quality and difficulty of preference pairs. A common heurist…