atlas

Research map / Optimization / Nonconvex and smooth optimization

Sub-sampled Cubic Regularization for Non-convex Optimization

ICML 2017 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 43 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use sub-sampled gradient and Hessian estimates in cubic regularization instead of full-data estimatesCubic regularization (SCR) · a9a, covtype, higgscomputation timeHelped
Use sub-sampled gradient and Hessian estimates in cubic regularization instead of full-data estimatesCubic regularization (SCR) · a9a, covtype, higgssuboptimalityNo clear effect
Use the proposed iteration-dependent sampling scheme instead of linearly increasing sample sizes (ablation)SCR · a9a, covtype, gaussiansuboptimalityHelped
Use the proposed iteration-dependent sampling scheme instead of exponentially increasing sample sizes (ablation)SCR · a9a, covtype, gaussiansuboptimalityHelped
Use Newton's method instead of SCROptimization of logistic regression · a9a, covtype, higgscomputation timeMixed
Use BFGS instead of SCRNon-convex logistic regression · higgsoptimization completionHurt
Use Newton's method instead of SCRNon-convex logistic regression · covtypeoptimization completionHurt

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