Provably Efficient Maximum Entropy Exploration

An algorithm for quadratic programming

Marguerite Frank and Philip Wolfe · 1956

Earlier work this paper cites.

Learning to achieve goals

Leslie Pack Kaelbling · 1993

Earlier work this paper cites.

Policy invariance under reward transformations: Theory and application to reward shaping

Andrew Y. Ng, Daishi Harada, and Stuart J. Russell · 1999

Earlier work this paper cites.

Policy gradient methods for reinforcement learning with function approximation

Richard S Sutton, David A McAllester, Satinder P Singh, and Yishay Mansour · 2000

Earlier work this paper cites.

Near-optimal reinforcement learning in polynomial time

Michael Kearns and Satinder Singh · 2002

Earlier work this paper cites.

The linear programming approach to approximate dynamic programming

Daniela Pucci De Farias and Benjamin Van Roy · 2003

Earlier work this paper cites.

On the sample complexity of reinforcement learning

Sham Machandranath Kakade · 2003

Earlier work this paper cites.

Apprenticeship learning via inverse reinforcement learning

Pieter Abbeel and Andrew Y. Ng · 2004

Earlier work this paper cites.

Dynamic programming and optimal control

Dimitri P Bertsekas · 2005

Earlier work this paper cites.

Intrinsically motivated reinforcement learning

Nuttapong Chentanez, Andrew G. Barto, and Satinder P. Singh · 2005

Earlier work this paper cites.

Pac model-free reinforcement learning

Alexander L Strehl, Lihong Li, Eric Wiewiora, John Langford, and Michael L Littman · 2006

Earlier work this paper cites.

Where do rewards come from?

Satinder Singh, Richard L. Lewis, and Andrew G. Barto · 2009

Earlier work this paper cites.

Intrinsically motivated reinforcement learning: An evolutionary perspective

Satinder P. Singh, Richard L. Lewis, Andrew G. Barto, and Jonathan Sorg · 2010

Earlier work this paper cites.

Model-based reinforcement learning with nearly tight exploration complexity bounds

István Szita and Csaba Szepesvári · 2010

Earlier work this paper cites.

A reduction of imitation learning and structured prediction to no-regret online learning

Stéphane Ross, Geoffrey J. Gordon, and J. Andrew Bagnell · 2011

Cited alongside, same era.

Exploration in model-based reinforcement learning by empirically estimating learning progress

Manuel Lopes, Tobias Lang, Marc Toussaint, and Pierre yves Oudeyer · 2012

Cited alongside, same era.

Near-optimal pac bounds for discounted mdps

Tor Lattimore and Marcus Hutter · 2014

Cited alongside, same era.

Markov decision processes: discrete stochastic dynamic programming

Martin L Puterman · 2014

Cited alongside, same era.

Convex optimization: Algorithms and complexity

Sébastien Bubeck et al · 2015

Cited alongside, same era.

Sample complexity of episodic fixed-horizon reinforcement learning

Christoph Dann and Emma Brunskill · 2015

Ex2: Exploration with exemplar models for deep reinforcement learning

Justin Fu, John Co-Reyes, and Sergey Levine · 2017

Later among the works it cites.

Count-based exploration with neural density models

Georg Ostrovski, Marc G. Bellemare, Aäron van den Oord, and Rémi Munos · 2017

Later among the works it cites.

Curiosity-driven exploration by self-supervised prediction

Deepak Pathak, Pulkit Agrawal, Alexei A. Efros, and Trevor Darrell · 2017

Later among the works it cites.

#exploration: A study of count-based exploration for deep reinforcement learning

Haoran Tang, Rein Houthooft, Davis Foote, Adam Stooke, OpenAI Xi Chen, Yan Duan, John Schulman, Filip DeTurck, and Pieter Abbeel · 2017

Later among the works it cites.

Imagination-augmented agents for deep reinforcement learning

Original

Théophane Weber, Sébastien Racanière, David P Reichert, Lars Buesing, Arthur Guez, Danilo Jimenez Rezende, Adria Puigdomenech Badia, Oriol Vinyals, Nicolas Heess, Yujia Li, et al · 2017

Later among the works it cites.