mlsanityData to 7 Oct 2026

Regularized Nonlinear Acceleration

arXiv 1606.04133 ↗First posted 13 Jun 2016math.OCcited by 18

Not on the map. Why?

Abstract (arXiv)

We describe a convergence acceleration technique for unconstrained optimization problems. Our scheme computes estimates of the optimum from a nonlinear average of the iterates produced by any optimization method. The weights in this average are computed via a simple linear system, whose solution can be updated online. This acceleration scheme runs in parallel to the base algorithm, providing improved estimates of the solution on the fly, while the original optimization method is running. Numerical experiments are detailed on classical classification problems.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Jun 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 4; 2023: 4; 2024: 3; 2025: 1; 2026: 2.

18 papers.

Sort:

By area: