Speedy categorical distributional reinforcement learning and complexity analysis

DOI10.1137/20M1364436MaRDI QIDQ5865896zbMATH OpenOpenAlexFDO

Authors Markus Böck, Clemens Heitzinger

Publication date 10 June 2022

Published in SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/20m1364436

zbMATH Keywords

complexity analysisdistributional reinforcement learningPAC boundsQ-learningreinforcement learning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Agent technology and artificial intelligence (68T42)

Recommendations

• Fast online \(Q(\lambda)\)
• Q-learning for distributionally robust Markov decision processes
• \({\mathcal Q}\)-learning
• Reinforcement learning in finite MDPs: PAC analysis
• Distributional Reinforcement Learning

Cites work

• \({\mathcal Q}\)-learning
• scientific article; zbMATH DE number 5957196 (Why is no real title available?)
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• Random measures, theory and applications
• Reinforcement learning. An introduction

This page was built for publication: Speedy categorical distributional reinforcement learning and complexity analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865896)