Efficient Memory-Based Dynamic Programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

17 Scopus citations

Abstract

A novel memory-based approach to dynamic programming that addresses the issue of generalization is presented. In this approach action values are represented by storing actual experiences in a memory and computed by a kind of locally weighted regression, and generalizations are made by searching the memory for relevant experience. The new approach does not require the quantization of continuous state or action spaces and can achieve arbitrarily variable resolution. By concentrating on important areas of the state space while ignoring the rest, the method represents an attempt to dodge Bellman's curse of dimensionality. This memory-based dynamic programming method has been implemented on a parallel machine, the Connection Machine, and used to successfully model and control a cart-pole system.

Original languageEnglish
Title of host publicationProceedings of the 12th International Conference on Machine Learning, ICML 1995
EditorsArmand Prieditis, Stuart Russell
PublisherMorgan Kaufmann Publishers, Inc.
Pages438-446
Number of pages9
ISBN (Electronic)1558603778, 9781558603776
StatePublished - 1995
Event12th International Conference on Machine Learning, ICML 1995 - Tahoe City, United States
Duration: 9 Jul 199512 Jul 1995

Publication series

NameProceedings of the 12th International Conference on Machine Learning, ICML 1995

Conference

Conference12th International Conference on Machine Learning, ICML 1995
Country/TerritoryUnited States
CityTahoe City
Period9/07/9512/07/95

Fingerprint

Dive into the research topics of 'Efficient Memory-Based Dynamic Programming'. Together they form a unique fingerprint.

Cite this