← Search

Nino Vieillard

14 accepted papers

2025

BOND: Aligning LLMs with Best-of-N Distillation

ICLR 2025poster

Reinforcement learning from human feedback (RLHF) is a key driver of quality and safety in state-of-the-art large language models. Yet, a surprisingly simple and strong inference-time strategy is Best-of-N sampling that selects the best generation among N candidates. In this paper, we propose Best-o…

Cited by 26SourcePDFScholar
2025

Loss Functions and Operators Generated by f-Divergences

ICML 2025poster

The logistic loss (a.k.a. cross-entropy loss) is one of the most popular loss functions used for multiclass classification. It is also the loss function of choice for next-token prediction in language modeling. It is associated with the Kullback-Leibler (KL) divergence and the softargmax operator.…

Cited by 0SourcePDFScholar
2025

On Teacher Hacking in Language Model Distillation

ICML 2025poster

Post-training of language models (LMs) increasingly relies on the following two stages: (i) knowledge distillation, where the LM is trained to imitate a larger teacher LM, and (ii) reinforcement learning from human feedback (RLHF), where the LM is aligned by optimizing a reward model. In the second…

Cited by 0SourcePDFScholar
2024

Imitating Language via Scalable Inverse Reinforcement Learning

NeurIPS 2024poster

The majority of language model training builds on imitation learning. It covers pretraining, supervised fine-tuning, and affects the starting conditions for reinforcement learning from human feedback (RLHF). The simplicity and scalability of maximum likelihood estimation (MLE) for next token predict…

Cited by 8SourcePDFScholar
2024

On-Policy Distillation of Language Models: Learning from Self-Generated Mistakes

ICLR 2024poster

Knowledge distillation (KD) is widely used for compressing a teacher model to reduce its inference cost and memory footprint, by training a smaller student model. However, current KD methods for auto-regressive sequence models suffer from distribution mismatch between output sequences seen during tr…

Cited by 109SourcePDFScholar
2024

WARM: On the Benefits of Weight Averaged Reward Models

ICML 2024poster

Aligning large language models (LLMs) with human preferences through reinforcement learning (RLHF) can lead to reward hacking, where LLMs exploit failures in the reward model (RM) to achieve seemingly high rewards without meeting the underlying objectives. We identify two primary challenges when des…

Cited by 76SourcePDFScholar
2023

Factually Consistent Summarization via Reinforcement Learning with Textual Entailment Feedback

ACL 2023long

Despite the seeming success of contemporary grounded text generation systems, they often tend to generate factually inconsistent text with respect to their input. This phenomenon is emphasized in tasks like summarization, in which the generated summaries should be corroborated by their source articl…

Cited by 82SourcePDFScholar
2023

Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice

ICML 2023poster

Mirror descent value iteration (MDVI), an abstraction of Kullback-Leibler (KL) and entropy-regularized reinforcement learning (RL), has served as the basis for recent high-performing practical RL algorithms. However, despite the use of function approximation in practice, the theoretical understandin…

2022

Implicitly Regularized RL with Implicit Q-values

AISTATS 2022poster

The $Q$-function is a central quantity in many Reinforcement Learning (RL) algorithms for which RL agents behave following a (soft)-greedy policy w.r.t. to $Q$. It is a powerful tool that allows action selection without a model of the environment and even without explicitly modeling the policy. Yet,…

Cited by 13SourcePDFScholar
2022

Offline Reinforcement Learning as Anti-exploration

AAAI 2022technical

Offline Reinforcement Learning (RL) aims at learning an optimal control from a fixed dataset, without interactions with the system. An agent in this setting should avoid selecting actions whose consequences cannot be predicted from the data. This is the converse of exploration in RL, which favors su…

Cited by 67SourcePDFScholar
2021

Offline Reinforcement Learning with Pseudometric Learning

ICML 2021spotlight

Offline Reinforcement Learning methods seek to learn a policy from logged transitions of an environment, without any interaction. In the presence of function approximation, and under the assumption of limited coverage of the state-action space of the environment, it is necessary to enforce the polic…

2020

Leverage the Average: an Analysis of KL Regularization in Reinforcement Learning

NeurIPS 2020oral

Recent Reinforcement Learning (RL) algorithms making use of Kullback-Leibler (KL) regularization as a core component have shown outstanding performance. Yet, only little is understood theoretically about why KL regularization helps, so far. We study KL regularization within an approximate value ite…

Cited by 95SourcePDFScholar