Skip to content

Author

Ahmet Alacaoglu

5 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#machine learning Preprint Nov 2026

Last-Iterate Convergence of Stochastic Gradient Methods for Unbounded Problems

Last-iterate convergence guarantees for stochastic gradient methods have attracted significant attention as practical implementations typically return the last iterate instead of an average of the iterates. In this paper, we study two approaches for analyzing the last-iterate convergence of proximal and projected stoch...

Kevin Kurian Thomas Vaidyan, Ahmet Alacaoglu, M. Friedlander · 0 citations

Towards Weaker Variance Assumptions for Stochastic Optimization

A classical assumption for analyzing stochastic gradient algorithms where the squared norm of the stochastic subgradient is allowed to grow as fast as the squared norm of the optimization variable is revisited.

Ahmet Alacaoglu, Yura Malitsky, Stephen J. Wright · 21 citations · ⚡3
#machine learning Conference Feb 2024

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity

This work provides a refined analysis for inexact Halpern iteration that relaxes the required inexactness level to improve some state-of-the-art complexity results even for constrained stochastic convex-concave min-max problems.

Ahmet Alacaoglu, Donghwan Kim, Stephen J. Wright · 12 citations · ⚡2

Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities

We analyze a stochastic algorithm with Halpern-type anchoring for constrained convex-concave problems and monotone variational inequalities. This single-loop and single-call algorithm uses one unbiased sample of the gradient operator at every iteration, to be applicable to monotone games with noisy feedback. With $t$ d...

Jun-Hyun Kim, Ahmet Alacaoglu · 1 citation
#machine learning Preprint Sep 2026

How to Make the Gradient Mapping Small for Constrained Stochastic Min-Max Problems and Beyond

This work studies the stochastic first-order oracle complexity for constrained or regularized convex-concave min-max optimization and stochastic monotone variational inequalities and extends to prove the same complexity for problems without the bounded variance, by using the Blum-Gladyshev assumption.

Ahmet Alacaoglu · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.