Liyu Chen, Andrea Tirinzoni, Matteo Pirotta, Alessandro Lazaric. Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path. In Shipra Agrawal 0001, Francesco Orabona, editors, International Conference on Algorithmic Learning Theory, February 20-23, 2023, Singapore. Volume 201 of Proceedings of Machine Learning Research, pages 310-357, PMLR, 2023. [doi]
Abstract is missing.