Research map / Bandits and online learning / Online convex optimization and games
Efficient Adaptive Online Learning via Frequent Directions
Yuanyu Wan, Lijun Zhang
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
- Dimension-Free Adaptive Subgradient Methods with Frequent Directions (ICML 2025 · similarity 0.91)
- Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent (ICML 2025 · similarity 0.87)
- Discounted Adaptive Online Learning: Towards Better Regularization (ICML 2024 · similarity 0.87)
- On the necessity of adaptive regularisation: Optimal anytime online learning on $\boldsymbol{\ell_p}$-balls (NeurIPS 2025 · similarity 0.86)
- A Simple and Optimal Approach for Universal Online Learning with Gradient Variations (NeurIPS 2024 · similarity 0.86)
- Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad (NeurIPS 2024 · 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.
