stochastic shortest path

Adaptive Control of Positive Systems with Application to Learning SSP L4DC 2025 Contextual Linear Optimization with Bandit Feedback NeurIPS 2024 Efficient Constraint Generation for Stochastic Shortest Path Problems AAAI 2024 A Unified Algorithm for Stochastic Path Problems ALT 2023 Heuristic Search for Multi-Objective Probabilistic Planning AAAI 2023 Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path ICML 2023 Posterior sampling-based online learning for the stochastic shortest path model UAI 2023 Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path ALT 2023 Dynamic Regret of Online Markov Decision Processes ICML 2022 Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP ICML 2022 Learning Generalized Policy Automata for Relational Stochastic Shortest Path Problems NeurIPS 2022 Learning Stochastic Shortest Path with Linear Function Approximation ICML 2022 Near-Optimal Algorithms for Autonomous Exploration and Multi-Goal Stochastic Shortest Path ICML 2022 Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments NeurIPS 2022 Offline stochastic shortest path: Learning, evaluation and towards optimality UAI 2022 Policy Optimization for Stochastic Shortest Path COLT 2022 Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation ICML 2022 Risk-Aware Stochastic Shortest Path AAAI 2022 Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case ICML 2021 Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path NeurIPS 2021 Minimax Regret for Stochastic Shortest Path NeurIPS 2021 Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition COLT 2021 Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model ALT 2021 Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret NeurIPS 2021 Stochastic Shortest Path with Adversarially Changing Costs IJCAI 2021