paper-with-me

Papers

Preference Optimization with Multi-Sample Comparisons

2024-10-16 · Chaoqi Wang, Zhuokai Zhao, Chen Zhu, Karthik Abinav Sankararaman, Michal Valko, Xuefei Cao, Zhaorun Chen, Madian Khabsa, Yuxin Chen, Hao Ma, Sinong Wang

Recent advancements in generative models, particularly large language models (LLMs) and diffusion models, have been driven by extensive pretraining on large datasets followed by post-training. However, current post-training methods such as reinforcement learning from human feedback (RLHF) and direct alignment from preference methods (DAP) primarily utilize single-sample comparisons. These approaches often fail to capture critical characteristics such as generative diversity and bias, which are more accurately assessed through multiple samples. To address these limitations, we introduce a novel approach that extends post-training to include multi-sample comparisons. To achieve this, we propose Multi-sample Direct Preference Optimization (mDPO) and Multi-sample Identity Preference Optimization (mIPO). These methods improve traditional DAP methods by focusing on group-wise characteristics. Empirically, we demonstrate that multi-sample comparison is more effective in optimizing collective characteristics~(e.g., diversity and bias) for generative models than single-sample comparison. Additionally, our findings suggest that multi-sample comparisons provide a more robust optimization framework, particularly for dataset with label noise.

📄 PDF Abstract BibTeX arXiv:2410.12138

Code (0)

등록된 구현이 없습니다.

Tasks

Diversity

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

GLISp-r: A preference-based optimization algorithm with convergence guarantees

2022-02-02 · Davide Previtali, Mirko Mazzoleni, Antonio Ferramosca, Fabio Previdi

Preference-based optimization algorithms are iterative procedures that seek the optimal calibration of a decision vector based only on comparisons between couples of different tunings. At each iteration, a human decision…

Preference learning along multiple criteria: A game-theoretic perspective

2021-05-05 · NeurIPS 2020 12 · Kush Bhatia, Ashwin Pananjady, Peter L. Bartlett, Anca D. Dragan 외

The literature on ranking from ordinal data is vast, and there are several ways to aggregate overall preferences from pairwise comparisons between objects. In particular, it is well known that any Nash equilibrium of the…

Autonomous Driving

A unified surrogate-based scheme for black-box and preference-based optimization

2022-02-03 · Davide Previtali, Mirko Mazzoleni, Antonio Ferramosca, Fabio Previdi

Black-box and preference-based optimization algorithms are global optimization procedures that aim to find the global solutions of an optimization problem using, respectively, the least amount of function evaluations or …

global-optimization

Importance Sampling for Multi-Negative Multimodal Direct Preference Optimization

2025-09-30 · Xintong Li, Chuhan Wang, Junda Wu, Rohan Surana 외 arxiv

Direct Preference Optimization (DPO) has recently been extended from text-only models to vision-language models. However, existing methods rely on oversimplified pairwise comparisons, generating a single negative image v…

Active Preference Learning for Ordering Items In- and Out-of-sample

2024-05-05 · Herman Bergström, Emil Carlsson, Devdatt Dubhashi, Fredrik D. Johansson

Learning an ordering of items based on pairwise comparisons is useful when items are difficult to rate consistently on an absolute scale, for example, when annotators have to make subjective assessments. When exhaustive …

Active Learning