Research map / Bandits and online learning / Online convex optimization and games
Making Non-Stochastic Control (Almost) as Easy as Stochastic
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
- Optimal Dynamic Regret in LQR Control (NeurIPS 2022 · similarity 0.92)
- Naive Exploration is Optimal for Online LQR (ICML 2020 · similarity 0.91)
- Tight Rates for Bandit Control Beyond Quadratics (NeurIPS 2024 · similarity 0.89)
- Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization (ICML 2024 · similarity 0.89)
- Online Control with Adversarial Disturbance for Continuous-time Linear Systems (NeurIPS 2024 · similarity 0.89)
- Optimal Algorithms for Online Convex Optimization with Adversarial Constraints (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.