Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path

Aug-14-2025, 16:27:00 GMT–Neural Information Processing Systems 

Tarbouriech et al. [2020a] develop the first regret minimization algorithm for SSP with a regret bound