Speedy categorical distributional reinforcement learning and complexity analysis

DOI10.1137/20M1364436zbMATH Open1487.68191OpenAlexW4282029132MaRDI QIDQ5865896FDOQ5865896

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

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

zbMATH Keywords

reinforcement learningcomplexity analysisQ-learningPAC boundsdistributional reinforcement learning

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• \({\mathcal Q}\)-learning
• Reinforcement learning. An introduction
• Title not available (Why is that?)
• Random measures, theory and applications

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)