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

Abstract

We introduce a generic template for developing regret minimization algorithms in the Stochastic Shortest Path (SSP) model, which achieves minimax optimal regret as long as certain properties are ensured. The key of our analysis is a new technique called implicit finite-horizon approximation, which approximates the SSP model by a finite-horizon counterpart only in the analysis without explicit implementation. Using this template, we develop two new algorithms: the first one is model-free (the first in the literature to our knowledge) and minimax optimal under strictly positive costs; the second one is model-based and minimax optimal even with zero-cost state-action pairs, matching the best existing result from [Tarbouriech et al., 2021b]. Importantly, both algorithms admit highly sparse updates, making them computationally more efficient than all existing algorithms. Moreover, both can be made completely parameter-free.

References in corpus (6)

• Planning with Goal-Conditioned Policies
• Online Convex Optimization in Adversarial Markov Decision Processes
• Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs
• Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition
• Improved Sample Complexity for Incremental Autonomous Exploration in MDPs
• Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model

Cited by in corpus (3)

• Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
• Learning Stochastic Shortest Path with Linear Function Approximation
• Adaptive Multi-Goal Exploration