Jean Tarbouriech, Matteo Pirotta, Michal Valko, Alessandro Lazaric. Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model. In Vitaly Feldman, Katrina Ligett, Sivan Sabato, editors, Algorithmic Learning Theory, 16-19 March 2021, Virtual Conference, Worldwide. Volume 132 of Proceedings of Machine Learning Research, pages 1157-1178, PMLR, 2021. [doi]
@inproceedings{TarbouriechPVL21,
title = {Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model},
author = {Jean Tarbouriech and Matteo Pirotta and Michal Valko and Alessandro Lazaric},
year = {2021},
url = {http://proceedings.mlr.press/v132/tarbouriech21a.html},
researchr = {https://researchr.org/publication/TarbouriechPVL21},
cites = {0},
citedby = {0},
pages = {1157-1178},
booktitle = {Algorithmic Learning Theory, 16-19 March 2021, Virtual Conference, Worldwide},
editor = {Vitaly Feldman and Katrina Ligett and Sivan Sabato},
volume = {132},
series = {Proceedings of Machine Learning Research},
publisher = {PMLR},
}