← Search

Nando de Freitas

27 accepted papers

2024

Genie: Generative Interactive Environments

ICML 2024oral

We introduce Genie, the first *generative interactive environment* trained in an unsupervised manner from unlabelled Internet videos. The model can be prompted to generate an endless variety of action-controllable virtual worlds described through text, synthetic images, photographs, and even sketche…

Cited by 172SourcePDFScholar
2022

Towards Learning Universal Hyperparameter Optimizers with Transformers

NeurIPS 2022accept

Meta-learning hyperparameter optimization (HPO) algorithms from prior experiments is a promising approach to improve optimization efficiency over objective functions from a similar distribution. However, existing methods are restricted to learning from experiments sharing the same set of hyperparame…

2021

Active Offline Policy Selection

NeurIPS 2021poster

This paper addresses the problem of policy selection in domains with abundant logged data, but with a restricted interaction budget. Solving this problem would enable safe evaluation and deployment of offline reinforcement learning policies in industry, robotics, and recommendation domains among oth…

2021

Learning Deep Features in Instrumental Variable Regression

ICLR 2021poster

Instrumental variable (IV) regression is a standard strategy for learning causal relationships between confounded treatment and outcome variables from observational data by using an instrumental variable, which affects the outcome only through the treatment. In classical IV regression, learning proc…

2020

Critic Regularized Regression

NeurIPS 2020poster

Offline reinforcement learning (RL), also known as batch RL, offers the prospect of policy optimization from large pre-recorded datasets without online environment interaction. It addresses challenges with regard to the cost of data collection and safety, both of which are particularly pertinent to…

Cited by 378SourcePDFScholar
2020

Making Efficient Use of Demonstrations to Solve Hard Exploration Problems

ICLR 2020poster

This paper introduces R2D3, an agent that makes efficient use of demonstrations to solve hard exploration problems in partially observable environments with highly variable initial conditions. We also introduce a suite of eight tasks that combine these three properties, and show that R2D3 can solve…

Cited by 107SourceScholar
2020

Modular Meta-Learning with Shrinkage

NeurIPS 2020spotlight

Many real-world problems, including multi-speaker text-to-speech synthesis, can greatly benefit from the ability to meta-learn large models with only a few task- specific components. Updating only these task-specific modules then allows the model to be adapted to low-data tasks for as many steps as…

Cited by 51SourcePDFScholar
2020

RL Unplugged: A Suite of Benchmarks for Offline Reinforcement Learning

NeurIPS 2020poster

Offline methods for reinforcement learning have a potential to help bridge the gap between reinforcement learning research and real-world applications. They make it possible to learn policies from offline datasets, thus overcoming concerns associated with online data collection in the real-world, in…

2020

Scaling data-driven robotics with reward sketching and batch reinforcement learning

RSS 2020poster

By harnessing a growing dataset of robot experience, we learn control policies for a diverse and increasing set of related manipulation tasks. To make this possible, we introduce reward sketching: an effective way of eliciting human preferences to learn the reward function for a new task. This rewar…

2020

Task-Relevant Adversarial Imitation Learning

CoRL 2020

We show that a critical vulnerability in adversarial imitation is the tendency of discriminator networks to learn spurious associations between visual features and expert labels. When the discriminator focuses on task-irrelevant features, it does not provide an informative reward signal, leading to

Cited by 0SourcePDFScholar
2019

Hyperbolic Attention Networks

ICLR 2019poster

Recent approaches have successfully demonstrated the benefits of learning the parameters of shallow networks in hyperbolic space. We extend this line of work by imposing hyperbolic geometry on the embeddings used to compute the ubiquitous attention mechanisms for different neural networks architectu…

Cited by 302SourcePDFScholar
2019

Learning Compositional Neural Programs with Recursive Tree Search and Planning

NeurIPS 2019spotlight

We propose a novel reinforcement learning algorithm, AlphaNPI, that incorpo- rates the strengths of Neural Programmer-Interpreters (NPI) and AlphaZero. NPI contributes structural biases in the form of modularity, hierarchy and recursion, which are helpful to reduce sample complexity, improve general…

2019

Sample Efficient Adaptive Text-to-Speech

ICLR 2019poster

We present a meta-learning approach for adaptive text-to-speech (TTS) with few data. During training, we learn a multi-speaker model using a shared conditional WaveNet core and independent learned embeddings for each speaker. The aim of training is not to produce a neural network with fixed weights,…

Cited by 177SourcePDFScholar
2019

Social Influence as Intrinsic Motivation for Multi-Agent Deep Reinforcement Learning

ICML 2019oral

We propose a unified mechanism for achieving coordination and communication in Multi-Agent Reinforcement Learning (MARL), through rewarding agents for having causal influence over other agents’ actions. Causal influence is assessed using counterfactual reasoning. At each timestep, an agent simulates…

2018

Compositional Obverter Communication Learning from Raw Visual Input

ICLR 2018poster

One of the distinguishing aspects of human language is its compositionality, which allows us to describe complex environments with limited vocabulary. Previously, it has been shown that neural network agents can learn to communicate in a highly structured, possibly compositional language based on di…

Cited by 93SourcePDFScholar
2018

Few-shot Autoregressive Density Estimation: Towards Learning to Learn Distributions

ICLR 2018poster

Deep autoregressive models have shown state-of-the-art performance in density estimation for natural images on large-scale datasets such as ImageNet. However, such models require many thousands of gradient-based weight updates and unique image examples for training. Ideally, the models would rapidl…

Cited by 99SourcePDFScholar
2018

Learning Awareness Models

ICLR 2018poster

We consider the setting of an agent with a fixed body interacting with an unknown and uncertain external world. We show that models trained to predict proprioceptive information about the agent's body come to represent objects in the external world. In spite of being trained with only internally ava…

Cited by 58SourcePDFScholar
2018

Playing hard exploration games by watching YouTube

NeurIPS 2018spotlight

Deep reinforcement learning methods traditionally struggle with tasks where environment rewards are particularly sparse. One successful method of guiding exploration in these domains is to imitate trajectories provided by a human demonstrator. However, these demonstrations are typically collected un…

Cited by 329SourcePDFScholar
2018

Reinforcement and Imitation Learning for Diverse Visuomotor Skills

RSS 2018poster

We propose a general model-free deep reinforcement learning method and apply it to robotic manipulation tasks. Our approach leverages a small amount of demonstration data to assist a reinforcement learning agent. We train end-to-end visuomotor policies to learn a direct mapping from RGB camera input…

Cited by 398SourcePDFScholar
2017

Cortical microcircuits as gated-recurrent neural networks

NeurIPS 2017poster

Cortical circuits exhibit intricate recurrent architectures that are remarkably similar across different brain areas. Such stereotyped structure suggests the existence of common computational principles. However, such principles have remained largely elusive. Inspired by gated-memory networks, namel…

Cited by 79SourcePDFScholar
2017

Generating Interpretable Images with Controllable Structure

ICLR 2017workshop

We demonstrate improved text-to-image synthesis with controllable object locations using an extension of Pixel Convolutional Neural Networks (PixelCNN). In addition to conditioning on text, we show how the model can generate images conditioned on part keypoints and segmentation masks. The character-…

Cited by 73SourceScholar
2017

Learning to Perform Physics Experiments via Deep Reinforcement Learning

ICLR 2017poster

When encountering novel objects, humans are able to infer a wide range of physical properties such as mass, friction and deformability by interacting with them in a goal driven way. This process of active interaction is in the same spirit as a scientist performing experiments to discover hidden fact…

Cited by 91SourceScholar
2017

Robust Imitation of Diverse Behaviors

NeurIPS 2017poster

Deep generative models have recently shown great promise in imitation learning for motor control. Given enough data, even supervised approaches can do one-shot imitation learning; however, they are vulnerable to cascading failures when the agent trajectory diverges from the demonstrations. Compared…

Cited by 266SourcePDFScholar
2017

Sample Efficient Actor-Critic with Experience Replay

ICLR 2017poster

This paper presents an actor-critic deep reinforcement learning agent with experience replay that is stable, sample efficient, and performs remarkably well on challenging environments, including the discrete 57-game Atari domain and several continuous control problems. To achieve this, the paper int…

Cited by 1079SourceScholar
2016

Learning to Communicate with Deep Multi-Agent Reinforcement Learning

NeurIPS 2016poster

We consider the problem of multiple agents sensing and acting in environments with the goal of maximising their shared utility. In these environments, agents must learn communication protocols in order to share information that is needed to solve the tasks. By embracing deep neural networks, we are…

2016

Learning to learn by gradient descent by gradient descent

NeurIPS 2016poster

The move from hand-designed features to learned features in machine learning has been wildly successful. In spite of this, optimization algorithms are still designed by hand. In this paper we show how the design of an optimization algorithm can be cast as a learning problem, allowing the algorithm t…