Sample complexity bounds for stochastic shortest path with a generative model

MaRDI QIDQ7028602zbMATH OpenFDO

Authors Jean Tarbouriech, Matteo Pirotta, Michal Valko, Alessandro Lazaric

Publication date 11 February 2025

Full work available at URL https://proceedings.mlr.press/v132/tarbouriech21a.html

zbMATH Keywords

Markov decision processsample complexitystochastic shortest path

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Markov and semi-Markov decision processes (90C40)

Cites work

• An Analysis of Stochastic Shortest Path Problems
• scientific article; zbMATH DE number 1095138 (Why is no real title available?)
• Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model
• Near-optimal reinforcement learning in polynomial time

Cited in

(1)

• A unified algorithm for stochastic path problems

This page was built for publication: Sample complexity bounds for stochastic shortest path with a generative model

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