← Search

Marc Dymetman

9 accepted papers

2026

Whatever Remains Must Be True: Filtering Drives Reasoning in LLMs, Shaping Diversity

ICLR 2026poster

Reinforcement Learning (RL) has become the _de facto_ standard for tuning LLMs to solve tasks involving reasoning. However, growing evidence shows that such models often suffer from a significant loss in diversity. We argue that this arises because RL implicitly optimizes the Reverse KL to a target…

Cited by 0SourcecodeScholar
2025

FaST: Feature-aware Sampling and Tuning for Personalized Preference Alignment with Limited Data

EMNLP 2025

LLM-powered conversational assistants are often deployed in a one-size-fits-all manner, which fails to accommodate individual user preferences. Recently, LLM personalization – tailoring models to align with specific user preferences – has gained increasing attention as a way to bridge this gap. In t

2025

Guaranteed Generation from Large Language Models

ICLR 2025poster

As large language models (LLMs) are increasingly used across various applications, there is a growing need to control text generation to satisfy specific constraints or requirements. This raises a crucial question: Is it possible to guarantee strict constraint satisfaction in generated outputs while…

Cited by 3SourcePDFScholar
2024

Compositional Preference Models for Aligning LMs

ICLR 2024poster

As language models (LMs) become more capable, it is increasingly important to align them with human preferences. However, the dominant paradigm for training Preference Models (PMs) for that purpose suffers from fundamental limitations, such as lack of transparency and scalability, along with suscept…

2023

Aligning Language Models with Preferences through $f$-divergence Minimization

ICML 2023poster

Aligning language models with preferences can be posed as approximating a target distribution representing some desired behavior. Existing approaches differ both in the functional form of the target distribution and the algorithm used to approximate it. For instance, Reinforcement Learning from Huma…

2023

Should you marginalize over possible tokenizations?

ACL 2023short

Autoregressive language models (LMs) map token sequences to probabilities. The usual practice for computing the probability of any character string (e.g. English sentences) is to first transform it into a sequence of tokens that is scored by the model. However, there are exponentially many token seq…

2022

Controlling Conditional Language Models without Catastrophic Forgetting

ICML 2022spotlight

Machine learning is shifting towards general-purpose pretrained generative models, trained in a self-supervised manner on large amounts of data, which can then be applied to solve a large number of tasks. However, due to their generic training methodology, these models often fail to meet some of the…

2022

On Reinforcement Learning and Distribution Matching for Fine-Tuning Language Models with no Catastrophic Forgetting

NeurIPS 2022accept

The availability of large pre-trained models is changing the landscape of Machine Learning research and practice, moving from a "training from scratch" to a "fine-tuning'' paradigm. While in some applications the goal is to "nudge'' the pre-trained distribution towards preferred outputs, in others i…

2021

A Distributional Approach to Controlled Text Generation

ICLR 2021oral

We propose a Distributional Approach for addressing Controlled Text Generation from pre-trained Language Models (LM). This approach permits to specify, in a single formal framework, both “pointwise’” and “distributional” constraints over the target LM — to our knowledge, the first model with su…