Research map / Bandits and online learning / Online convex optimization and games
Locally-Adaptive Nonparametric Online Learning
Ilja Kuzborskij, Nicolò Cesa-Bianchi
Read the paperCheck your idea against 137,217 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
- From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model (NeurIPS 2026 · similarity 0.87)
- Discounted Adaptive Online Learning: Towards Better Regularization (ICML 2024 · similarity 0.87)
- Convergence of Distributed Adaptive Optimization with Local Updates (ICLR 2025 · similarity 0.87)
- Minimax Adaptive Online Nonparametric Regression over Besov spaces (NeurIPS 2025 · similarity 0.87)
- Gradient-Variation Online Learning under Generalized Smoothness (NeurIPS 2024 · similarity 0.86)
- Instance-Adaptive Online Multicalibration (NeurIPS 2026 · similarity 0.86)
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.
