Research map / Optimization / Nonconvex and smooth optimization
Projection-Free Online Convex Optimization via Efficient Newton Iterations
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
- Efficient Projection-Free Online Methods with Stochastic Recursive Gradient (AAAI 2020 · similarity 0.92)
- An Ellipsoid Algorithm for Online Convex Optimization (NeurIPS 2025 · similarity 0.91)
- Universal Online Convex Optimization with $1$ Projection per Round (NeurIPS 2024 · similarity 0.89)
- Projection-Free Online Convex Optimization with Time-Varying Constraints (ICML 2024 · similarity 0.88)
- Revisiting Projection-Free Online Learning with Time-Varying Constraints (AAAI 2025 · similarity 0.87)
- Improved Differentially Private and Lazy Online Convex Optimization: Lower Regret without Smoothness Requirements (ICML 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.