activity
20192025
most citedLinear Lower Bounds and Conditioning of Differentiable Games

25 citations · 57 across the 14 of their papers we have counts for

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC2025

The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations

Waïss Azizian, Franck Iutzeler, Jérôme Malick +1

In this paper, we examine the time it takes for stochastic gradient descent (SGD) to reach the global minimum of a general, non-convex loss function. We approach this question thro…

math.OC2024

What is the long-run distribution of stochastic gradient descent? A large deviations analysis

Waïss Azizian, Franck Iutzeler, Jérôme Malick +1

In this paper, we examine the long-run distribution of stochastic gradient descent (SGD) in general, non-convex problems. Specifically, we seek to understand which regions of the p…

math.OC2022★ 2 cited

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness

Waïss Azizian, Franck Iutzeler, Jérôme Malick +1

We examine the last-iterate convergence rate of Bregman proximal methods - from mirror descent to mirror-prox and its optimistic variants - as a function of the local geometry indu…

math.OC2022★ 1 cited

Regularization for Wasserstein Distributionally Robust Optimization

Waïss Azizian, Franck Iutzeler, Jérôme Malick

Optimal transport has recently proved to be a useful tool in various machine learning applications needing comparisons of probability measures. Among these, applications of distrib…

math.OC2021★ 5 cited

The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities

Waïss Azizian, Franck Iutzeler, Jérôme Malick +1

In this paper, we analyze the local convergence rate of optimistic mirror descent methods in stochastic variational inequalities, a class of optimization problems with important ap…