Research map / Bandits and online learning / RL theory and MDPs
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Minimax Regret for Stochastic Shortest Path (NeurIPS 2021 · similarity 0.97)
- Near-optimal Regret Bounds for Stochastic Shortest Path (ICML 2020 · similarity 0.95)
- OPSRL-SSP: Optimistic Posterior Sampling for Stochastic Shortest Path with Minimax-Optimal Regret (NeurIPS 2026 · similarity 0.93)
- Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path (NeurIPS 2021 · similarity 0.93)
- Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory Feedback (ICML 2025 · similarity 0.89)
- Regret Lower Bounds for Decentralized Multi-Agent Stochastic Shortest Path Problems (NeurIPS 2025 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.