Adaptive aggregation for reinforcement learning in average reward Markov decision processes

DOI10.1007/s10479-012-1064-yzbMath1274.90476OpenAlexW2071815241MaRDI QIDQ378753

Ronald Ortner

Publication date: 12 November 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1064-y

zbMATH Keywords

Markov decision processreinforcement learningregretbounded parameter MDP

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items (2)

Unnamed Item ⋮ Clustering in block Markov chains

Cites Work

• Unnamed Item
• Unnamed Item
• Knows what it knows: a framework for self-aware learning
• Equivalence notions and model minimization in Markov decision processes
• Simulation-based algorithms for Markov decision processes.
• An analysis of model-based interval estimation for Markov decision processes
• Asymptotically efficient adaptive allocation rules
• Bounded-parameter Markov decision processes
• Optimal adaptive policies for sequential allocation problems
• Bisimulation Metrics for Continuous Markov Decision Processes
• Pseudometrics for State Aggregation in Average Reward Markov Decision Processes
• Adaptive aggregation methods for infinite horizon dynamic programming
• Optimal Adaptive Policies for Markov Decision Processes
• Learning Theory and Kernel Machines
• An Adaptive Sampling Algorithm for Solving Markov Decision Processes
• Performance Loss Bounds for Approximate Value Iteration with State Aggregation
• Bounded Parameter Markov Decision Processes with Average Reward Criterion
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Adaptive aggregation for reinforcement learning in average reward Markov decision processes