3 papers
math.OC2026
A non-autonomous center-stable set theorem for saddle avoidance in optimization
Andreea-Alexandra Muşat, Nicolas Boumal
Optimization algorithms are unlikely to converge to strict saddle points. Proofs to that effect rely on the Center-Stable Manifold Theorem (CSMT), casting algorithms as dynamical s…
math.OC2025
Gradient descent avoids strict saddles with a simple line-search method too
Andreea-Alexandra Muşat, Andreea-Alexandra Musat, Nicolas Boumal
It is known that gradient descent (GD) on a cost function generically avoids strict saddle points when using a small, constant step size. However, no such guarantee existed f…
math.NA2014
Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14)
L. Jacques, C. De Vleeschouwer, Y. Boursier +64
The implicit objective of the biennial "international - Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST) is to foster collaboration between interna…