2 citations · 3 across the 3 of their papers we have counts for
4 papers · 1 filter
Finding Simple Proofs for First-Order Optimization
Daniel Berg Thomsen, Manu Upadhyaya, Baptiste Goujaud +2
Progress in mathematics often requires more than a certificate of truth: it requires proof structures that are transparent, checkable, and reusable. Automated systems can increasin…
Open Problem: Two Riddles in Heavy-Ball Dynamics
Baptiste Goujaud, Adrien Taylor, Aymeric Dieuleveut
This short paper presents two open problems on the widely used Polyak's Heavy-Ball algorithm. The first problem is the method's ability to exactly \textit{accelerate} in dimension…
Quadratic minimization: from conjugate gradient to an adaptive Heavy-ball method with Polyak step-sizes
Baptiste Goujaud, Adrien Taylor, Aymeric Dieuleveut
In this work, we propose an adaptive variation on the classical Heavy-ball method for convex quadratic minimization. The adaptivity crucially relies on so-called "Polyak step-sizes…
Optimal first-order methods for convex functions with a quadratic upper bound
Baptiste Goujaud, Adrien Taylor, Aymeric Dieuleveut
We analyze worst-case convergence guarantees of first-order optimization methods over a function class extending that of smooth and convex functions. This class contains convex fun…