Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains

DOI10.1007/S10994-010-5186-7zbMath1470.68083OpenAlexW2018547649MaRDI QIDQ1959632

Andrey Bernstein, Nahum Shimkin

Publication date: 7 October 2010

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-010-5186-7

zbMATH Keywords

reinforcement learningkernel functionsadaptive resolutionefficient exploration

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Unnamed Item ⋮ Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains ⋮ Data-driven approximate Q-learning stabilization with optimality error bound analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
• Kernel-based reinforcement learning
• Near-optimal reinforcement learning in polynomial time
• Variable resolution discretization in optimal control
• Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains
• 10.1162/153244303765208377
• An optimal one-way multigrid algorithm for discrete-time stochastic control
• A New Approach to Manipulator Control: The Cerebellar Model Articulation Controller (CMAC)
• Approximations of Dynamic Programs, I
• OnActor-Critic Algorithms
• Approximate Dynamic Programming
• Neuro-Dynamic Programming: An Overview and Recent Results

This page was built for publication: Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains