← Search

Reza Babanezhad

7 accepted papers

2026

On the Convergence of Steepest Descent and Adaptive Gradient Methods under Non-Uniform Smoothness

ICML 2026poster

Recent work has analyzed the convergence of first-order methods under non-uniform smoothness assumptions that better model the loss landscape in machine learning tasks. We generalize this assumption to objectives whose curvature is an affine function of the objective value. This property is satisfie…

Cited by 0SourceScholar
2022

Towards Noise-adaptive, Problem-adaptive (Accelerated) Stochastic Gradient Descent

ICML 2022oral

We aim to make stochastic gradient descent (SGD) adaptive to (i) the noise $\sigma^2$ in the stochastic gradients and (ii) problem-dependent constants. When minimizing smooth, strongly-convex functions with condition number $\kappa$, we prove that $T$ iterations of SGD with exponentially decreasing…

2022

Towards painless policy optimization for constrained MDPs

UAI 2022poster

We study policy optimization in an infinite horizon, $\gamma$-discounted constrained Markov decision process (CMDP). Our objective is to return a policy that achieves large expected reward with a small constraint violation. We consider the online setting with linear function approximation and assume…

2021

An Analysis of the Adaptation Speed of Causal Models

AISTATS 2021poster

Consider a collection of datasets generated by unknown interventions on an unknown structural causal model $G$. Recently, Bengio et al. (2020) conjectured that among all candidate models, $G$ is the fastest to adapt from one dataset to another, along with promising experiments. Indeed, intuitively $…

2021

Infinite-Dimensional Optimization for Zero-Sum Games via Variational Transport

ICML 2021spotlight

Game optimization has been extensively studied when decision variables lie in a finite-dimensional space, of which solutions correspond to pure strategies at the Nash equilibrium (NE), and the gradient descent-ascent (GDA) method works widely in practice. In this paper, we consider infinite-dimensio…

Cited by 8SourcePDFScholar
2015

Non-Uniform Stochastic Average Gradient Method for Training Conditional Random Fields

AISTATS 2015poster

We apply stochastic average gradient (SAG) algorithms for training conditional random fields (CRFs). We describe a practical implementation that uses structure in the CRF gradient to reduce the memory requirement of this linearly-convergent stochastic gradient method, propose a non-uniform sampling…

Cited by 101SourcePDFScholar