Convergence of Constrained Anderson Acceleration

Adrien Taylor; Alexandre d'Aspremont; Mathieu Barr\'e

Convergence of Constrained Anderson Acceleration

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2010.15482 v1 pith:VIMBAK44 submitted 2020-10-29 math.NA cs.NAmath.OC

Convergence of Constrained Anderson Acceleration

Mathieu Barr\'e , Adrien Taylor , Alexandre d'Aspremont This is my paper

classification math.NA cs.NAmath.OC

keywords constrainedaccelerationandersonconvergenceschemeabsoluteasymptoticbounded

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

Share X Bluesky LinkedIn Reddit HN

abstract

We prove non asymptotic linear convergence rates for the constrained Anderson acceleration extrapolation scheme. These guarantees come from new upper bounds on the constrained Chebyshev problem, which consists in minimizing the maximum absolute value of a polynomial on a bounded real interval with $l_1$ constraints on its coefficients vector. Constrained Anderson Acceleration has a numerical cost comparable to that of the original scheme.

discussion (0)

Forward citations

Cited by 1 Pith paper

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

Restart and Adaptive Acceleration in Stochastic Gradient Methods
math.OC 2026-06 conditional novelty 5.0

Restart schemes for SGD on KL-satisfying non-smooth weakly convex problems deliver accelerated convergence robust to exponent misspecification, with optimal schedules resembling Polyak steps.