Research map / Bandits and online learning / RL theory and MDPs
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments
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
- Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret (NeurIPS 2021 · similarity 0.91)
- Near-optimal Regret Bounds for Stochastic Shortest Path (ICML 2020 · similarity 0.91)
- DARLING: Detection Augmented Reinforcement Learning with Non-Stationary Guarantees (NeurIPS 2026 · similarity 0.89)
- Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory Feedback (ICML 2025 · similarity 0.88)
- Reinforcement Learning with Random Time Horizons (ICML 2025 · similarity 0.88)
- Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time (NeurIPS 2024 · similarity 0.88)
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.