Research map / Bandits and online learning / Online convex optimization and games
Geometric Exploration for Online Control
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace explore-then-commit exploration with adaptive barycentric-spanner exploration | Online control of LDS with known costs · Online control of LDS, known cost | regret horizon dependence: T^{2/3} -> \sqrt{T} | Helped |
| Use an SBCO-based algorithm with estimated disturbances | Online control of LDS with bandit feedback · Online control of LDS, bandit feedback | regret horizon dependence: T^{3/4} -> \sqrt{T} | Helped |
Closest papers by meaning
- Bandit Linear Control (NeurIPS 2020 · similarity 0.92)
- Rate-Optimal Online Convex Optimization in Adaptive Linear Control (NeurIPS 2022 · similarity 0.91)
- Tight Rates for Bandit Control Beyond Quadratics (NeurIPS 2024 · similarity 0.89)
- Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback (ICML 2025 · similarity 0.88)
- Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory Feedback (ICML 2025 · similarity 0.88)
- Handling Heterogeneous Curvatures in Bandit LQR Control (ICML 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.