← Search

Joelle Pineau

45 accepted papers

2024

Piecewise Linear Parametrization of Policies: Towards Interpretable Deep Reinforcement Learning

ICLR 2024poster

Learning inherently interpretable policies is a central challenge in the path to developing autonomous agents that humans can trust. Linear policies can justify their decisions while interacting in a dynamic environment, but their reduced expressivity prevents them from solving hard tasks. Instead,…

Cited by 4SourcePDFScholar
2024

Position: On the Societal Impact of Open Foundation Models

ICML 2024oral

Foundation models are powerful technologies: how they are released publicly directly shapes their societal impact. In this position paper, we focus on *open* foundation models, defined here as those with broadly available model weights (e.g., Llama 3, Stable Diffusion XL). We identify five distincti…

Cited by 4SourcePDFScholar
2022

A Generalized Bootstrap Target for Value-Learning, Efficiently Combining Value and Feature Predictions

AAAI 2022technical

Estimating value functions is a core component of reinforcement learning algorithms. Temporal difference (TD) learning algorithms use bootstrapping, i.e. they update the value function toward a learning target using value estimates at subsequent time-steps. Alternatively, the value function can be u…

Cited by 1SourcePDFScholar
2022

Improving Passage Retrieval with Zero-Shot Question Generation

EMNLP 2022main

We propose a simple and effective re-ranking method for improving passage retrieval in open question answering. The re-ranker re-scores retrieved passages with a zero-shot question generation model, which uses a pre-trained language model to compute the probability of the input question conditioned…

2022

New Insights on Reducing Abrupt Representation Change in Online Continual Learning

ICLR 2022poster

In the online continual learning paradigm, agents must learn from a changing distribution while respecting memory and compute constraints. Experience Replay (ER), where a small subset of past data is stored and replayed alongside new data, has emerged as a simple and effective learning strategy. In…

Cited by 251SourcePDFScholar
2022

Robust Policy Learning over Multiple Uncertainty Sets

ICML 2022spotlight

Reinforcement learning (RL) agents need to be robust to variations in safety-critical environments. While system identification methods provide a way to infer the variation from online experience, they can fail in settings where fast identification is not possible. Another dominant approach is robus…

Cited by 18SourcePDFScholar
2022

The Curious Case of Absolute Position Embeddings

EMNLP 2022finding

Transformer language models encode the notion of word order using positional information. Most commonly, this positional information is represented by absolute position embeddings (APEs), that are learned from the pretraining data. However, in natural language, it is not absolute position that matte…

2021

Improving Sample Efficiency in Model-Free Reinforcement Learning from Images

AAAI 2021technical

Training an agent to solve control tasks directly from high-dimensional images with model-free reinforcement learning (RL) has proven difficult. A promising approach is to learn a latent representation together with the control policy. However, fitting a high-capacity encoder using a scarce reward s…

2021

Learning Robust State Abstractions for Hidden-Parameter Block MDPs

ICLR 2021poster

Many control tasks exhibit similar dynamics that can be modeled as having common latent structure. Hidden-Parameter Markov Decision Processes (HiP-MDPs) explicitly model this structure to improve sample efficiency in multi-task settings. However, this setting makes strong assumptions on the observab…

Cited by 57SourcePDFScholar
2021

Masked Language Modeling and the Distributional Hypothesis: Order Word Matters Pre-training for Little

EMNLP 2021main

A possible explanation for the impressive performance of masked language model (MLM) pre-training is that such models have learned to represent the syntactic structures prevalent in classical NLP pipelines. In this paper, we propose a different explanation: MLMs succeed on downstream tasks almost en…

2021

Multi-Objective SPIBB: Seldonian Offline Policy Improvement with Safety Constraints in Finite MDPs

NeurIPS 2021poster

We study the problem of Safe Policy Improvement (SPI) under constraints in the offline Reinforcement Learning (RL) setting. We consider the scenario where: (i) we have a dataset collected under a known baseline policy, (ii) multiple reward signals are received from the environment inducing as many o…

Cited by 24SourcePDFScholar
2021

OptiDICE: Offline Policy Optimization via Stationary Distribution Correction Estimation

ICML 2021spotlight

We consider the offline reinforcement learning (RL) setting where the agent aims to optimize the policy solely from the data without further environment interactions. In offline RL, the distributional shift becomes the primary source of difficulty, which arises from the deviation of the target polic…

Cited by 129SourcePDFScholar
2021

Regularized Inverse Reinforcement Learning

ICLR 2021spotlight

Inverse Reinforcement Learning (IRL) aims to facilitate a learner’s ability to imitate expert behavior by acquiring reward functions that explain the expert’s decisions. Regularized IRLapplies strongly convex regularizers to the learner’s policy in order to avoid the expert’s behavior being rational…

Cited by 15SourcePDFScholar
2021

Sometimes We Want Ungrammatical Translations

EMNLP 2021finding

Rapid progress in Neural Machine Translation (NMT) systems over the last few years has focused primarily on improving translation quality, and as a secondary focus, improving robustness to perturbations (e.g. spelling). While performance and robustness are important objectives, by over-focusing on t…

2020

Adversarial Soft Advantage Fitting: Imitation Learning without Policy Optimization

NeurIPS 2020spotlight

Adversarial Imitation Learning alternates between learning a discriminator -- which tells apart expert's demonstrations from generated ones -- and a generator's policy to produce trajectories that can fool this discriminator. This alternated optimization is known to be delicate in practice since it…

2020

Handling Black Swan Events in Deep Learning with Diversely Extrapolated Neural Networks

IJCAI 2020poster

By virtue of their expressive power, neural networks (NNs) are well suited to fitting large, complex datasets, yet they are also known to produce similar predictions for points outside the training distribution. As such, they are, like humans, under the influence of the Black Swan theory: models…

2020

Invariant Causal Prediction for Block MDPs

ICML 2020poster

Generalization across environments is critical to the successful application of reinforcement learning (RL) algorithms to real-world challenges. In this work we propose a method for learning state abstractions which generalize to novel observation distributions in the multi-environment RL setting. W…

2020

Language GANs Falling Short

ICLR 2020poster

Traditional natural language generation (NLG) models are trained using maximum likelihood estimation (MLE) which differs from the sample generation inference procedure. During training the ground truth tokens are passed to the model, however, during inference, the model instead reads its previously…

Cited by 265SourcecodeScholar
2020

Novelty Search in Representational Space for Sample Efficient Exploration

NeurIPS 2020oral

We present a new approach for efficient exploration which leverages a low-dimensional encoding of the environment learned with a combination of model-based and model-free objectives. Our approach uses intrinsic rewards that are based on the distance of nearest neighbors in the low dimensional repre…

2020

On Overfitting and Asymptotic Bias in Batch Reinforcement Learning with Partial Observability (Extended Abstract)

IJCAI 2020poster

When an agent has limited information on its environment, the suboptimality of an RL algorithm can be decomposed into the sum of two terms: a term related to an asymptotic bias (suboptimality with unlimited data) and a term due to overfitting (additional suboptimality due to limited data). In the co…

Cited by 0SourcePDFScholar
2020

On the interaction between supervision and self-play in emergent communication

ICLR 2020poster

A promising approach for teaching artificial agents to use natural language involves using human-in-the-loop training. However, recent work suggests that current machine learning methods are too data inefficient to be trained in this way from scratch. In this paper, we investigate the relationship b…

Cited by 77SourcecodeScholar
2020

Online Learned Continual Compression with Adaptive Quantization Modules

ICML 2020poster

We introduce and study the problem of Online Continual Compression, where one attempts to simultaneously learn to compress and store a representative dataset from a non i.i.d data stream, while only observing each sample once. A naive application of auto-encoder in this setting encounters a major ch…

2020

Stable Policy Optimization via Off-Policy Divergence Regularization

UAI 2020poster

Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO) are among the most successful policy gradient approaches in deep reinforcement learning (RL). While these methods achieve state-of-the-art performance across a wide range of challenging tasks, there is room for improvemen…

2019

Gossip-based Actor-Learner Architectures for Deep Reinforcement Learning

NeurIPS 2019poster

Multi-simulator training has contributed to the recent success of Deep Reinforcement Learning (Deep RL) by stabilizing learning and allowing for higher training throughputs. In this work, we propose Gossip-based Actor-Learner Architectures (GALA) where several actor-learners (such as A2C agents) are…

2019

Leveraging exploration in off-policy algorithms via normalizing flows

CoRL 2019

The ability to discover approximately optimal policies in domains with sparse rewards is crucial to applying reinforcement learning (RL) in many real-world scenarios. Approaches such as neural density models and continuous exploration (e.g., Go-Explore) have been proposed to maintain the high explor

2019

No-Press Diplomacy: Modeling Multi-Agent Gameplay

NeurIPS 2019poster

Diplomacy is a seven-player non-stochastic, non-cooperative game, where agents acquire resources through a mix of teamwork and betrayal. Reliance on trust and coordination makes Diplomacy the first non-cooperative multi-agent benchmark for complex sequential social dilemmas in a rich environment. In…

2019

Randomized Value Functions via Multiplicative Normalizing Flows

UAI 2019poster

Randomized value functions offer a promising approach towards the challenge of efficient exploration in complex environments with high dimensional state and action spaces. Unlike traditional point estimate methods, randomized value functions maintain a posterior distribution over action-space values…

Cited by 47SourcePDFScholar
2019

Separating value functions across time-scales

ICML 2019oral

In many finite horizon episodic reinforcement learning (RL) settings, it is desirable to optimize for the undiscounted return - in settings like Atari, for instance, the goal is to collect the most points while staying alive in the long run. Yet, it may be difficult (or even intractable) mathematica…

2018

Focused Hierarchical RNNs for Conditional Sequence Processing

ICML 2018oral

Recurrent Neural Networks (RNNs) with attention mechanisms have obtained state-of-the-art results for many sequence processing tasks. Most of these models use a simple form of encoder with attention that looks over the entire sequence and assigns a weight to each token independently. We present a me…

Cited by 28SourcePDFScholar
2018

Reward Estimation for Variance Reduction in Deep Reinforcement Learning

CoRL 2018

Reinforcement Learning (RL) agents require the specification of a reward signal for learning behaviours. However, introduction of corrupt or stochastic rewards can yield high variance in learning. Such corruption may be a direct result of goal misspecification, randomness in the reward signal, or co

2018

Temporal Regularization for Markov Decision Process

NeurIPS 2018poster

Several applications of Reinforcement Learning suffer from instability due to high variance. This is especially prevalent in high dimensional domains. Regularization is a commonly used technique in machine learning to reduce variance, at the cost of introducing some bias. Most existing regularizatio…

2017

An Actor-Critic Algorithm for Sequence Prediction

ICLR 2017poster

We present an approach to training neural networks to generate sequences using actor-critic methods from reinforcement learning (RL). Current log-likelihood training methods are limited by the discrepancy between their training and testing modes, as models must generate tokens conditioned on their p…

Cited by 758SourcecodeScholar
2017

Towards an automatic Turing test: Learning to evaluate dialogue responses

ICLR 2017workshop

Automatically evaluating the quality of dialogue responses for unstructured domains is a challenging problem. Unfortunately, existing automatic evaluation metrics are biased and correlate very poorly with human judgements of response quality (Liu et al., 2016). Yet having an accurate automatic evalu…

Cited by 453SourcecodeScholar
2015

Automatically characterizing driving activities onboard smart wheelchairs from accelerometer data

IROS 2015poster

Wheelchairs play an important role for people living with locomotor impairments. However, power wheelchair users frequently report both minor and major accidents. The goal of this paper is to advocate for the use of robotic technology, in particular sensor-based detection and automatic classificatio…

Cited by 7SourceScholar