activity
20032025
most citedTowards a Definition of Disentangled Representations

284 citations · 1.8k across the 35 of their papers we have counts for

collaborators
Showing cs.LGShow all

9 papers · 1 filter

cs.LG2019★ 27 cited

Hamiltonian Generative Networks

Peter Toth, Danilo Jimenez Rezende, Andrew Jaegle +3

The Hamiltonian formalism plays a central role in classical and quantum physics. Hamiltonians are the main tool for modelling the continuous time evolution of systems with conserve…

cs.LG2019★ 33 cited

Automated curricula through setter-solver interactions

Sebastien Racaniere, Andrew K. Lampinen, Adam Santoro +3

Reinforcement learning algorithms use correlations between policies and rewards to improve agent performance. But in dynamic or sparsely rewarding environments these correlations a…

cs.LG2019★ 32 cited

Differentiable Game Mechanics

Alistair Letcher, David Balduzzi, Sebastien Racaniere +4

Deep learning is built on the foundational guarantee that gradient descent on an objective function converges to local minima. Unfortunately, this guarantee fails in settings, such…

cs.LG2019

An investigation of model-free planning

Arthur Guez, Mehdi Mirza, Karol Gregor +10

The field of reinforcement learning (RL) is facing increasingly challenging domains with combinatorial complexity. For an RL agent to address these challenges, it is essential that…

cs.LG2018★ 284 cited

Towards a Definition of Disentangled Representations

Irina Higgins, David Amos, David Pfau +4

How can intelligent agents solve a diverse set of tasks in a data-efficient manner? The disentangled representation learning approach posits that such an agent would benefit from s…

cs.LG2018★ 39 cited

Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Search

Lars Buesing, Theophane Weber, Yori Zwols +4

Learning policies on data synthesized by models can in principle quench the thirst of reinforcement learning algorithms for large amounts of real experience, which is often costly…