Research map / Learning theory and algorithms / Combinatorial and search optimization
General Error Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems
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
- Efficient Constraint Generation for Stochastic Shortest Path Problems (AAAI 2024 · similarity 0.89)
- Near-optimal Regret Bounds for Stochastic Shortest Path (ICML 2020 · similarity 0.87)
- Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation (ICML 2022 · similarity 0.87)
- New Results in Bounded-Suboptimal Search (AAAI 2022 · similarity 0.87)
- Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path (NeurIPS 2021 · similarity 0.87)
- Stochastic Optimization with Random Search (NeurIPS 2026 · similarity 0.84)
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.