article Open AccessTop 1% cited
Near-Optimal Reinforcement Learning in Polynomial Time
Machine Learning · 2002 · Vol. 49(2-3) · pp. 209–232
Michael Kearns✉(University of Pennsylvania)Satinder Singh(Syntek Technologies (United States))
Reinforcement Learning in RoboticsOptimization and Search ProblemsMachine Learning and AlgorithmsMarkov decision processBounded functionMathematical optimizationComputationPolynomialMathematicsReinforcement learningComputer scienceMarkov processAlgorithm
Funding
- National Science Foundation
Citations
851
FWCI
15.91
field-weighted impact
References
57
Percentile
99%
vs. same field & year
Citations per year
References
Q-learning
Machine Learning · 1992 · 8,916 citations
Technical Note: Q-Learning
Machine Learning · 1992 · 3,640 citations
Learning to Predict by the Methods of Temporal Differences
Machine Learning · 1988 · 3,908 citations
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
Journal of the American Statistical Association · 1995 · 8,424 citations
Reinforcement Learning: An Introduction
IEEE Transactions on Neural Networks · 2005 · 25,702 citations
On the Convergence of Stochastic Iterative Dynamic Programming Algorithms
Neural Computation · 1994 · 796 citations
Learning to predict by the methods of temporal differences
Machine Learning · 1988 · 2,774 citations
Advances in neural information processing systems 7
Computers & Mathematics with Applications · 1996 · 14,367 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.