Research map / Bandits and online learning / Online convex optimization and games
Online Adaptive Policy Selection in Time-Varying Systems: No-Regret via Contractive Perturbations
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
- Online Control of Unknown Time-Varying Dynamical Systems (NeurIPS 2021 · similarity 0.91)
- Strongly Adaptive Online Learning with Time-Varying Movement Cost (NeurIPS 2026 · similarity 0.89)
- Policy Optimization as Online Learning with Mediator Feedback (AAAI 2021 · similarity 0.89)
- Policy-Regret Minimization in Markov Games with Function Approximation (ICML 2025 · similarity 0.88)
- Pausing Policy Learning in Non-stationary Reinforcement Learning (ICML 2024 · similarity 0.88)
- A Regret Minimization Approach to Iterative Learning Control (ICML 2021 · 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.