Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
arXiv:2604.16111v1 Announce Type: new
Abstract: We study the sample complexity of learning an $\epsilon$-optimal policy in the Stochastic Shortest Path (SSP) problem. We first derive sample complexity bounds when the learner has access to a generative…