Pith. sign in

REVIEW 1 cited by

Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.01832 v2 pith:WNQEBVOC submitted 2022-11-03 math.OC cs.LGstat.ML

classification math.OCcs.LGstat.ML
keywords second-orderadaptivealgorithmconvergencefirstknowledgemethodoracle
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

This work proposes a universal and adaptive second-order method for minimizing second-order smooth, convex functions. Our algorithm achieves $O(\sigma / \sqrt{T})$ convergence when the oracle feedback is stochastic with variance $\sigma^2$, and improves its convergence to $O( 1 / T^3)$ with deterministic oracles, where $T$ is the number of iterations. Our method also interpolates these rates without knowing the nature of the oracle apriori, which is enabled by a parameter-free adaptive step-size that is oblivious to the knowledge of smoothness modulus, variance bounds and the diameter of the constrained set. To our knowledge, this is the first universal algorithm with such global guarantees within the second-order optimization literature.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees

    math.OC 2025-08 conditional novelty 5.0 of 10

    An explicit stepsize schedule for quasi-Newton updates achieves O(1/k) global convergence on convex functions, and O(1/k^2) when Hessian approximation error is controlled.

Pith tools