Research map / Optimization / Nonconvex and smooth optimization
Non-convex online learning via algorithmic equivalence
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
- Delay-Tolerant Online Convex Optimization: Unified Analysis and Adaptive-Gradient Algorithms (AAAI 2016 · similarity 0.90)
- Online mirror descent and dual averaging: keeping pace in the dynamic case (ICML 2020 · similarity 0.90)
- Adaptive Algorithms for Online Convex Optimization with Long-term Constraints (ICML 2016 · similarity 0.89)
- Gradient-Variation Bound for Online Convex Optimization with Constraints (AAAI 2023 · similarity 0.89)
- Revisiting Projection-Free Online Learning with Time-Varying Constraints (AAAI 2025 · similarity 0.88)
- Gradient-Variation Online Adaptivity for Accelerated Optimization with Hölder Smoothness (NeurIPS 2025 · 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.