← Search

Guillaume Lample

16 accepted papers

2023

Deep Generative Symbolic Regression with Monte-Carlo-Tree-Search

ICML 2023poster

Symbolic regression (SR) is the problem of learning a symbolic expression from numerical data. Recently, deep neural models trained on procedurally-generated synthetic datasets showed competitive performance compared to more classical Genetic Programming (GP) ones. Unlike their GP counterparts, thes…

Cited by 30SourcePDFScholar
2023

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs

ICLR 2023top-5%

The formalization of existing mathematical proofs is a notoriously difficult process. Despite decades of research on automation and proof assistants, writing formal proofs remains arduous and only accessible to a few experts. While previous studies to automate formalization focused on powerful searc…

Cited by 172SourcePDFScholar
2022

Deep symbolic regression for recurrence prediction

ICML 2022spotlight

Symbolic regression, i.e. predicting a function from the observation of its values, is well-known to be a challenging task. In this paper, we train Transformers to infer the function or recurrence relation underlying sequences of integers or floats, a typical task in human IQ tests which has hardly…

Cited by 29SourcePDFScholar
2022

End-to-end Symbolic Regression with Transformers

NeurIPS 2022accept

Symbolic regression, the task of predicting the mathematical expression of a function from the observation of its values, is a difficult task which usually involves a two-step procedure: predicting the "skeleton" of the expression up to the choice of numerical constants, then fitting the constants b…

2022

HyperTree Proof Search for Neural Theorem Proving

NeurIPS 2022accept

We propose an online training procedure for a transformer-based automated theorem prover. Our approach leverages a new search algorithm, HyperTree Proof Search (HTPS), that learns from previous proof searches through online training, allowing it to generalize to domains far from the training distrib…

Cited by 158SourcePDFScholar
2022

Leveraging Automated Unit Tests for Unsupervised Code Translation

ICLR 2022spotlight

With little to no parallel data available for programming languages, unsupervised methods are well-suited to source code translation. However, the majority of unsupervised machine translation approaches rely on back-translation, a method developed in the context of natural language translation and o…

Cited by 137SourcePDFScholar
2021

DOBF: A Deobfuscation Pre-Training Objective for Programming Languages

NeurIPS 2021poster

Recent advances in self-supervised learning have dramatically improved the state of the art on a wide variety of tasks. However, research in language model pre-training has mostly focused on natural languages, and it is unclear whether models like BERT and its variants provide the best pre-training…

2021

Learning advanced mathematical computations from examples

ICLR 2021poster

Using transformers over large generated datasets, we train models to learn mathematical properties of differential systems, such as local stability, behavior at infinity and controllability. We achieve near perfect prediction of qualitative characteristics, and good approximations of numerical featu…

2020

Unsupervised Translation of Programming Languages

NeurIPS 2020poster

A transcompiler, also known as source-to-source translator, is a system that converts source code from a high-level programming language (such as C++ or Python) to another. Transcompilers are primarily used for interoperability, and to port codebases written in an obsolete or deprecated language (e.…

2019

Large Memory Layers with Product Keys

NeurIPS 2019spotlight

This paper introduces a structured memory which can be easily integrated into a neural network. The memory is very large by design and significantly increases the capacity of the architecture, by up to a billion parameters with a negligible computational overhead. Its design and access pattern is ba…

2019

Multiple-Attribute Text Rewriting

ICLR 2019poster

The dominant approach to unsupervised "style transfer'' in text is based on the idea of learning a latent representation, which is independent of the attributes specifying its "style''. In this paper, we show that this condition is not necessary and is not always met in practice, even with domain ad…

Cited by 278SourcePDFScholar
2018

Unsupervised Machine Translation Using Monolingual Corpora Only

ICLR 2018poster

Machine translation has recently achieved impressive performance thanks to recent advances in deep learning and the availability of large-scale parallel corpora. There have been numerous attempts to extend these successes to low-resource language pairs, yet requiring tens of thousands of parallel se…

Cited by 1332SourcePDFScholar
2018

Word translation without parallel data

ICLR 2018poster

State-of-the-art methods for learning cross-lingual word embeddings have relied on bilingual dictionaries or parallel corpora. Recent studies showed that the need for parallel data supervision can be alleviated with character-level information. While these methods showed encouraging results, they ar…

2017

Fader Networks:Manipulating Images by Sliding Attributes

NeurIPS 2017poster

This paper introduces a new encoder-decoder architecture that is trained to reconstruct images by disentangling the salient information of the image and the values of attributes directly in the latent space. As a result, after training, our model can generate different realistic versions of an input…