AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

A Damped Newton Method Achieves Global $\mathcal O \left(\frac{1}{k^2}\right)$ and Local Quadratic Convergence Rate

Slavomir Hanzely, Dmitry Kamzolov, Dmitry Pasechnyuk, Alexander Gasnikov, Peter Richtárik, Martin Takáč

NeurIPS 2022 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use AICN (damped Newton with explicit stepsize) instead of fixed-stepsize Damped NewtonAICN · logistic regression on a9a, start x0 = 10*onesconvergence per iteration and per timeImproved
use AICN instead of Cubic NewtonAICN · logistic regression on a9awall-clock timeImproved
use AICN instead of Cubic NewtonAICN · second-order lower bound function (d = 20)convergence per iterationHurt
use AICN instead of Damped Newton with fixed stepsizeAICN · second-order lower bound function (d = 20)convergence per iterationImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy