AI Paper Atlas

Research map / Bandits and online learning / Multi-armed bandits

Near-Optimal Algorithms for Autonomous Exploration and Multi-Goal Stochastic Shortest Path

Haoyuan Cai, Tengyu Ma, Simon Du

ICML 2022 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic bandit algorithms · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use VALAE instead of UcbExploreAutonomous exploration · Autonomous explorationsample complexity: \widetilde{O}(L^3S^2A/\varepsilon^3) -> \widetilde{O}(LSA/\varepsilon^2)Improved
Use VALAE instead of DisCoAutonomous exploration · Autonomous explorationsample complexity: \widetilde{O}(L^3S^2A/\varepsilon^2) -> \widetilde{O}(LSA/\varepsilon^2)Improved
Exploit value-function variance information to guide explorationVALAE · Autonomous explorationsample complexity dependence on L: cubic to linearImproved
Exploit value-function variance information to guide explorationVALAE · Autonomous explorationsample complexity dependence on S: square to linearImproved
Apply VALAE to multiple goal statesMulti-goal SSP · Multi-goal SSPcumulative cost: \widetilde{O}(LSA\varepsilon^{-2})Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy