Research map / Optimization / Nonconvex and smooth optimization
Explicit Convergence Rates of Greedy and Random Quasi-Newton Methods
Dachao Lin, Haishan Ye, Zhihua 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
- Greedy and Random Quasi-Newton Methods with Faster Explicit Superlinear Convergence (NeurIPS 2021 · similarity 0.95)
- Sharpened Quasi-Newton Methods: Faster Superlinear Rate and Larger Local Convergence Neighborhood (ICML 2022 · similarity 0.92)
- Exploiting Local Convergence of Quasi-Newton Methods Globally: Adaptive Sample Size Approach (NeurIPS 2021 · similarity 0.91)
- Stochastic Adaptive Quasi-Newton Methods for Minimizing Expected Values (ICML 2017 · similarity 0.91)
- Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates (AAAI 2024 · similarity 0.90)
- Skip the Hessian, Keep the Rates: Globalized Semismooth Newton with Lazy Hessian Updates (NeurIPS 2026 · similarity 0.89)
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.
