← Search

Mathieu Besançon

4 accepted papers

2025

Efficient Quadratic Corrections for Frank-Wolfe Algorithms

NeurIPS 2025poster

We develop a Frank-Wolfe algorithm with corrective steps, generalizing previous algorithms including Blended Conditional Gradients, Blended Pairwise Conditional Gradients, and Fully-Corrective Frank-Wolfe. For this, we prove tight convergence guarantees together with an optimal face identification p…

Cited by 0SourceScholar
2025

Secant Line Search for Frank-Wolfe Algorithms

ICML 2025poster

We present a new step-size strategy based on the secant method for Frank-Wolfe algorithms. This strategy, which requires mild assumptions about the function under consideration, can be applied to any Frank-Wolfe algorithm. It is as effective as full line search and, in particular, allows for adaptin…

Cited by 0SourcePDFScholar
2025

The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control

AISTATS 2025oral

We propose the pivoting meta algorithm (PM) to enhance optimization algorithms that generate iterates as convex combinations of vertices of a feasible region $C\subseteq \mathbb{R}^n$, including Frank-Wolfe (FW) variants. PM guarantees that the active set (the set of vertices in the convex combinati…

Cited by 0SourceScholar
2021

Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions

NeurIPS 2021poster

Generalized self-concordance is a key property present in the objective function of many important learning problems. We establish the convergence rate of a simple Frank-Wolfe variant that uses the open-loop step size strategy $\gamma_t = 2/(t+2)$, obtaining a $\mathcal{O}(1/t)$ convergence rate fo…

Cited by 22SourcePDFScholar