5.7k citations · 17.6k across the 75 of their papers we have counts for
9 papers · 1 filter
Algorithmic Improvements for Deep Reinforcement Learning applied to Interactive Fiction
Vishal Jain, William Fedus, Hugo Larochelle +2
Text-based games are a natural challenge domain for deep reinforcement learning algorithms. Their state and action spaces are combinatorially large, their reward function is sparse…
Small-GAN: Speeding Up GAN Training Using Core-sets
Samarth Sinha, Han Zhang, Anirudh Goyal +3
Recent work by Brock et al. (2018) suggests that Generative Adversarial Networks (GANs) benefit disproportionately from large mini-batch sizes. Unfortunately, using large batches i…
Learning Neural Causal Models from Unknown Interventions
Nan Rosemary Ke, Olexa Bilaniuk, Anirudh Goyal +6
Promising results have driven a recent surge of interest in continuous optimization methods for Bayesian network structure learning from observational data. However, there are theo…
A RAD approach to deep mixture models
Laurent Dinh, Jascha Sohl-Dickstein, Hugo Larochelle +1
Flow based models such as Real NVP are an extremely powerful approach to density estimation. However, existing flow based models are restricted to transforming continuous densities…
Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examples
Eleni Triantafillou, Tyler Zhu, Vincent Dumoulin +8
Few-shot classification refers to learning a classifier for new classes given only a few examples. While a plethora of models have emerged to tackle it, we find the procedure and d…
Hyperbolic Discounting and Learning over Multiple Horizons
William Fedus, Carles Gelada, Yoshua Bengio +2
Reinforcement learning (RL) typically defines a discount factor as part of the Markov Decision Process. The discount factor values future rewards by an exponential scheme that lead…
Are Few-Shot Learning Benchmarks too Simple ? Solving them without Task Supervision at Test-Time
Gabriel Huang, Hugo Larochelle, Simon Lacoste-Julien
We show that several popular few-shot learning benchmarks can be solved with varying degrees of success without using support set Labels at Test-time (LT). To this end, we introduc…
The Hanabi Challenge: A New Frontier for AI Research
Nolan Bard, Jakob N. Foerster, Sarath Chandar +12
From the early days of computing, games have been important testbeds for studying how well machines can do sophisticated decision making. In recent years, machine learning has made…
InfoBot: Transfer and Exploration via the Information Bottleneck
Anirudh Goyal, Riashat Islam, Daniel Strouse +5
A central challenge in reinforcement learning is discovering effective policies for tasks where rewards are sparsely distributed. We postulate that in the absence of useful reward…