Research map / Bandits and online learning / Online convex optimization and games
Projection-free Online Learning in Dynamic Environments
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 |
|---|---|---|---|
| Use Multi-OCG+ instead of CBCE-RFTL | Online matrix completion on MovieLens 100K · Dynamic online matrix completion | cumulative loss | Helped |
| Use Multi-OCG+ instead of CBCE-RFTL | Online matrix completion on MovieLens 100K · Dynamic online matrix completion | cumulative runtime | Helped |
| Use static-regret RFTL without adaptation to changes | Online matrix completion on MovieLens 100K · Dynamic online matrix completion | cumulative loss | Hurt |
Closest papers by meaning
- Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees (AAAI 2024 · similarity 0.95)
- Revisiting Projection-Free Online Learning with Time-Varying Constraints (AAAI 2025 · similarity 0.94)
- Dynamic Regret Reduces to Kernelized Static Regret (NeurIPS 2025 · similarity 0.91)
- Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability (ICML 2025 · similarity 0.90)
- Projection-Free Online Convex Optimization with Time-Varying Constraints (ICML 2024 · similarity 0.90)
- Universal Online Convex Optimization with $1$ Projection per Round (NeurIPS 2024 · similarity 0.90)
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.