AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Approximate Newton Methods

Haishan Ye, Luo Luo, Zhihua Zhang

JMLR 2021 · 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
increase sample size from 100 to 600 in Regularized Subsampled NewtonRegularized Subsampled Newton · Least squares (n=8000, d=5000)iterations to precise solution: 8000 -> 1200Improved
use a large regularizer alpha when sample size is small, instead of a small one (ablation)Regularized Subsampled Newton · Least squares (n=8000, d=5000)convergenceImproved
make regularizer alpha too large (ablation)Regularized Subsampled Newton · Least squares (n=8000, d=5000)convergence speedHurt
use a small target rank in NewSamp when sample size is small (ablation)NewSamp · Least squares (n=8000, d=5000)convergenceImproved
drop Lipschitz continuity of the Hessian (Hinge-2 SVM with Subsampled Newton, 5% support vectors)Subsampled Newton · Linear SVM on mushrooms, a9a, Covertypeconvergence rateNo clear effect
use sketch size of several times d in Sketch NewtonSketch Newton · Least squares (10000x54, kappa 1.8741e4)convergenceImproved

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