Projective simulation with generalization

Dynamic Programming (Princeton University Press, Princeton, NJ, US, 1957)

Bellman, R. E · 1957

Earlier work this paper cites.

A new approach to manipulator control: The cerebellar model articulation controller (CMAC)

Albus, J. S · 1975

Earlier work this paper cites.

Adaptation

Holland, J. H · 1976

Earlier work this paper cites.

Induction: Processes of Inference, Learning, and Discovery

Holland, J. H., Holyoak, K. J., Nisbett, R. E. & Thagard, P · 1986

Earlier work this paper cites.

Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems

Holland, J. H · 1986

Earlier work this paper cites.

Learning from delayed rewards

Watkins, C. J. C. H · 1989

Earlier work this paper cites.

On-line Q-learning using connectionist systems

Rummery, G. A. & Niranjan, M · 1994

Earlier work this paper cites.

Generalization in reinforcement learning: Safely approximating the value function

Boyan, J. A. & Moore, A. W · 1995

Earlier work this paper cites.

Support-vector networks

Cortes, C. & Vapnik, V · 1995

Earlier work this paper cites.

Randomized Algorithms , chap. 6 (Cambridge University Press, New York, USA, 1995)

Motwani, R. & Raghavan, P · 1995

Earlier work this paper cites.

Generalization in reinforcement learning: Successful examples using sparse coarse coding

Sutton, R. S · 1996

Earlier work this paper cites.

Reinforcement Learning: An Introduction (MIT press, Cambridge, MA, USA, 1998)

Sutton, R. S. & Barto, A. G · 1998

Earlier work this paper cites.

Constructive function approximation

Utgoff, P. E. & Precup, D · 1998

Earlier work this paper cites.

Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning

Sutton, R. S., Precup, D. & Singh, S · 1999

Earlier work this paper cites.

Understanding Intelligence (MIT Press, Cambridge, MA, USA, 1999), first edn

Pfeiffer, R. & Scheier, C · 1999

Earlier work this paper cites.

Decision tree function approximation in reinforcement learning

Pyeatt, L. D. & Howe, A. E · 2001

Earlier work this paper cites.

Exponential algorithmic speedup by a quantum walk

Childs, A. M. et al · 2003

Earlier work this paper cites.

Relational reinforcement learning: An overview

Tadepalli, P., Givan, R. & Driessens, K · 2004

Earlier work this paper cites.

Tree-based batch mode reinforcement learning

Ernst, D., Geurts, P. & Wehenkel, L · 2005

Cited alongside, same era.

State abstraction discovery from irrelevant state variables

Jong, N. K · 2005

Cited alongside, same era.

Discrete quantum walks hit exponentially faster

Kempe, J · 2005

Cited alongside, same era.

Bandit problems with side observations

Wang, C.-C., Kulkarni, S. R. & Poor, H. V · 2005

Cited alongside, same era.

Evolutionary function approximation for reinforcement learning

Whiteson, S. & Stone, P · 2006

Cited alongside, same era.

Towards a unified theory of state abstraction for MDPs

Li, L., Walsh, T. J. & Littman, M. L · 2006

Cited alongside, same era.

Abstraction in Artificial Intelligence and Complex Systems (Springer, New York, NY, USA, 2013)

Saitta, L. & Zucker, J.-D · 2013

Later among the works it cites.

Feature reinforcement learning: State of the art

Daswani, M., Sunehag, P. & Hutter, M · 2014

Later among the works it cites.

Quantum speed-up for active learning agents

Paparo, G. D., Dunjko, V., Makmal, A., Martin-Delgado, M. A. & Briegel, H. J · 2014

Later among the works it cites.

Projective simulation applied to the grid-world and the mountain-car problem

Original

Melnikov, A. A., Makmal, A. & Briegel, H. J · 2014

Later among the works it cites.

Human-level control through deep reinforcement learning

Mnih, V. et al · 2015

Closest in time.

Quantum walks can find a marked element on any graph

Krovi, H., Magniez, F., Ozols, M. & Roland, J · 2015