Research map / Bandits and online learning / Online convex optimization and games
The Power of Predictions in 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.
Closest papers by meaning
- Maximizing the Value of Predictions in Control: Accuracy Is Not Enough (NeurIPS 2025 · similarity 0.92)
- Making Non-Stochastic Control (Almost) as Easy as Stochastic (NeurIPS 2020 · similarity 0.90)
- Optimal Algorithms for Online Convex Optimization with Adversarial Constraints (NeurIPS 2024 · similarity 0.88)
- Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator (ICLR 2025 · similarity 0.87)
- Tight Rates for Bandit Control Beyond Quadratics (NeurIPS 2024 · similarity 0.87)
- Online Control with Adversarial Disturbance for Continuous-time Linear Systems (NeurIPS 2024 · similarity 0.87)
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.