← Search

Pierre Harvey Richemond

7 accepted papers

2025

ShiQ: Bringing back Bellman to LLMs

NeurIPS 2025poster

The fine-tuning of pre-trained large language models (LLMs) using reinforcement learning (RL) is generally formulated as direct policy optimization. This approach was naturally favored as it efficiently improves a pretrained LLM with simple gradient updates. Another RL paradigm, Q-learning methods,…

Cited by 0Source ↗Scholar ↗
2024

Generalized Preference Optimization: A Unified Approach to Offline Alignment

ICML 2024poster

Offline preference optimization allows fine-tuning large models directly from offline data, and has proved effective in recent alignment practices. We propose generalized preference optimization (GPO), a family of offline losses parameterized by a general class of convex functions. GPO enables a uni…

Cited by 83Source ↗PDF ↗Scholar ↗
2024

Human Alignment of Large Language Models through Online Preference Optimisation

ICML 2024poster

Ensuring alignment of language model's outputs with human preferences is critical to guarantee a useful, safe, and pleasant user experience. Thus, human alignment has been extensively studied recently and several methods such as Reinforcement Learning from Human Feedback (RLHF), Direct Policy Optimi…

Cited by 40Source ↗PDF ↗Scholar ↗
2023

SemPPL: Predicting Pseudo-Labels for Better Contrastive Representations

ICLR 2023poster

Learning from large amounts of unsupervised data and a small amount of supervision is an important open problem in computer vision. We propose a new semi-supervised learning method, Semantic Positives via Pseudo-Labels (SEMPPL), that combines labelled and unlabelled data to learn informative represe…

2023

The Edge of Orthogonality: A Simple View of What Makes BYOL Tick

ICML 2023poster

Self-predictive unsupervised learning methods such as BYOL or SimSIAM have shown impressive results, and counter-intuitively, do not collapse to trivial representations. In this work, we aim at exploring the simplest possible mathematical arguments towards explaining the underlying mechanisms behind…

Cited by 8Source ↗PDF ↗Scholar ↗
2023

Understanding Self-Predictive Learning for Reinforcement Learning

ICML 2023poster

We study the learning dynamics of self-predictive learning for reinforcement learning, a family of algorithms that learn representations by minimizing the prediction error of their own future latent representations. Despite its recent empirical success, such algorithms have an apparent defect: trivi…

Cited by 34Source ↗PDF ↗Scholar ↗
2022

Data Distributional Properties Drive Emergent In-Context Learning in Transformers

NeurIPS 2022accept

Large transformer-based models are able to perform in-context few-shot learning, without being explicitly trained for it. This observation raises the question: what aspects of the training regime lead to this emergent behavior? Here, we show that this behavior is driven by the distributions of the t…