← Search

Pablo Sprechmann

8 accepted papers

2024

Unlocking the Power of Representations in Long-term Novelty-based Exploration

ICLR 2024spotlight

We introduce Robust Exploration via Clustering-based Online Density Estimation (RECODE), a non-parametric method for novelty-based exploration that estimates visitation counts for clusters of states based on their similarity in a chosen embedding space. By adapting classical clustering to the nonsta…

Cited by 6SourcePDFScholar
2020

Agent57: Outperforming the Atari Human Benchmark

ICML 2020poster

Atari games have been a long-standing benchmark in the reinforcement learning (RL) community for the past decade. This benchmark was proposed to test general competency of RL algorithms. Previous work has achieved good average performance by doing outstandingly well on many games of the set, but ver…

Cited by 759SourcePDFScholar
2020

Never Give Up: Learning Directed Exploration Strategies

ICLR 2020poster

We propose a reinforcement learning agent to solve hard exploration games by learning a range of directed exploratory policies. We construct an episodic memory-based intrinsic reward using k-nearest neighbors over the agent's recent experience to train the directed exploratory policies, thereby enco…

Cited by 410SourceScholar
2018

Fast deep reinforcement learning using online adjustments from the past

NeurIPS 2018poster

We propose Ephemeral Value Adjusments (EVA): a means of allowing deep reinforcement learning agents to rapidly adapt to experience in their replay buffer. EVA shifts the value predicted by a neural network with an estimate of the value function found by prioritised sweeping over experience tuples fr…

2018

Memory-based Parameter Adaptation

ICLR 2018poster

Deep neural networks have excelled on a wide range of problems, from vision to language and game playing. Neural networks very gradually incorporate information into weights as they process data, requiring very low learning rates. If the training distribution shifts, the network is slow to adapt, an…

Cited by 121SourcePDFScholar
2017

Accelerating Eulerian Fluid Simulation With Convolutional Networks

ICML 2017poster

Efficient simulation of the Navier-Stokes equations for fluid flow is a long standing problem in applied mathematics, for which state-of-the-art methods require large compute resources. In this work, we propose a data-driven approach that leverages the approximation power of deep-learning with the p…

Cited by 741SourcePDFScholar
2016

Disentangling factors of variation in deep representation using adversarial training

NeurIPS 2016poster

We propose a deep generative model for learning to distill the hidden factors of variation within a set of labeled observations into two complementary codes. One code describes the factors of variation relevant to solving a specified task. The other code describes the remaining factors of variation…

Cited by 574SourcePDFScholar