Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Phuc Minh Nguyen

dblp:410/0227 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Language models and text generation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › alignment › preference alignment
direct alignment algorithms
0.912025
Mitigating Reward Over-optimization in Direct Alignment Algorithms with Importance Sampling · NeurIPS 2025
Natural language and speech › Language models and text generation › alignment › preference alignment
human feedback alignment
0.912025
Mitigating Reward Over-optimization in Direct Alignment Algorithms with Importance Sampling · NeurIPS 2025
Natural language and speech › Language models and text generation › alignment
reward overoptimization
0.912025
Mitigating Reward Over-optimization in Direct Alignment Algorithms with Importance Sampling · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

importance sampling · 0.9clipping · 0.9
YearPublicationVenuePosition
2025 Mitigating Reward Over-optimization in Direct Alignment Algorithms with Importance Sampling
abstract
Recently, Direct Alignment Algorithms (DAAs) such as Direct Preference Optimization (DPO) have emerged as alternatives to the standard Reinforcement Learning from Human Feedback (RLHF) for aligning large language models (LLMs) with human values. Surprisingly, while DAAs do not use a separate proxy reward model as in RLHF, their performance can still deteriorate over the course of training -- an over-optimization phenomenon found in RLHF where the learning policy exploits the overfitting to inaccuracies of the reward model to achieve high rewards. One attributed source of over-optimization in DAAs is the under-constrained nature of their offline optimization, which can gradually shift probability mass toward non-preferred responses not presented in the preference dataset. This paper proposes a novel importance-sampling approach to mitigate the distribution shift problem of offline DAAs. This approach, called (IS-DAAs), multiplies the DAA objective with an importance ratio that accounts for the reference policy distribution. IS-DAAs additionally avoid the high variance issue associated with importance sampling by clipping the importance ratio to a maximum value. Our extensive experiments demonstrate that IS-DAAs can effectively mitigate over-optimization, especially under low regularization strength, and achieve better performance than other methods designed to address this problem.
Phuc Minh Nguyen, Ngoc-Hieu Nguyen, Duy M. H. Nguyen, Anji Liu, An Mai, Binh T. Nguyen 0001, Daniel Sonntag, Khoa D. Doan
NeurIPS1