← Search

Matthias Gallé

8 accepted papers

2025

Commit0: Library Generation from Scratch

ICLR 2025poster

With the goal of benchmarking generative systems beyond expert software development ability, we introduce Commit0, a benchmark that challenges AI agents to write libraries from scratch. Agents are provided with a specification document outlining the library’s API as well as a suite of interactive un…

2025

Improving Reward Models with Synthetic Critiques

NAACL 2025findings

Reward models (RMs) play a critical role in aligning language models through the process of reinforcement learning from human feedback. RMs are trained to predict a score reflecting human preference, which requires significant time and cost for human annotation. Additionally, RMs tend to quickly ove…

2024

Back to Basics: Revisiting REINFORCE-Style Optimization for Learning from Human Feedback in LLMs

ACL 2024long

AI alignment in the shape of Reinforcement Learning from Human Feedback (RLHF) is increasingly treated as a crucial ingredient for high performance large language models. Proximal Policy Optimization (PPO) has been installed by the seminal literature as the standard method for the RL part of RLHF. H…

Cited by 174SourcePDFScholar
2024

On Leakage of Code Generation Evaluation Datasets

EMNLP 2024finding

In this paper, we consider contamination by code generation test sets, in particular in their use in modern large language models.We discuss three possible sources of such contamination and show findings supporting each of them: (i) direct data leakage, (ii) indirect data leakage through the use of…

Cited by 21SourcePDFScholar
2021

Multilingual Unsupervised Neural Machine Translation with Denoising Adapters

EMNLP 2021main

We consider the problem of multilingual unsupervised machine translation, translating to and from languages that only have monolingual data by using auxiliary parallel language pairs. For this problem the standard procedure so far to leverage the monolingual data is _back-translation_, which is comp…

2017

A Maximum Matching Algorithm for Basis Selection in Spectral Learning

AISTATS 2017poster

We present a solution to scale spectral algorithms for learning sequence functions. We are interested in the case where these functions are sparse (that is, for most sequences they return 0). Spectral algorithms reduce the learning problem to the task of computing an SVD decomposition over a specia…

Cited by 11SourcePDFScholar