Research map / Bandits and online learning / Online convex optimization and games
Perturbation-based Regret Analysis of Predictive Control in Linear Time Varying Systems
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
- Bounded-Regret MPC via Perturbation Analysis: Prediction Error, Constraints, and Nonlinearity (NeurIPS 2022 · similarity 0.93)
- Online Control of Unknown Time-Varying Dynamical Systems (NeurIPS 2021 · similarity 0.91)
- Logarithmic Regret for Online Control (NeurIPS 2019 · similarity 0.89)
- Maximizing the Value of Predictions in Control: Accuracy Is Not Enough (NeurIPS 2025 · similarity 0.86)
- Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator (ICLR 2025 · similarity 0.86)
- Infinite-Horizon Distributionally Robust Regret-Optimal Control (ICML 2024 · similarity 0.85)
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.