362 citations · 2.5k across the 76 of their papers we have counts for
10 papers · 1 filter
A Decentralized Proximal Point-type Method for Saddle Point Problems
Weijie Liu, Aryan Mokhtari, Asuman Ozdaglar +3
In this paper, we focus on solving a class of constrained non-convex non-concave saddle point problems in a decentralized manner by a group of nodes in a network. Specifically, we…
One Sample Stochastic Frank-Wolfe
Mingrui Zhang, Zebang Shen, Aryan Mokhtari +2
One of the beauties of the projected gradient descent method lies in its rather simple mechanism and yet stable behavior with inexact, stochastic gradients, which has led to its wi…
FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization
Amirhossein Reisizadeh, Aryan Mokhtari, Hamed Hassani +2
Federated learning is a distributed framework according to which a model is trained over a set of devices, while keeping data localized. This framework faces several systems-orient…
On the Convergence Theory of Gradient-Based Model-Agnostic Meta-Learning Algorithms
Alireza Fallah, Aryan Mokhtari, Asuman Ozdaglar
We study the convergence of a class of gradient-based Model-Agnostic Meta-Learning (MAML) methods and characterize their overall complexity as well as their best achievable accurac…
Robust and Communication-Efficient Collaborative Learning
Amirhossein Reisizadeh, Hossein Taheri, Aryan Mokhtari +2
We consider a decentralized learning problem, where a set of computing nodes aim at solving a non-convex optimization problem collaboratively. It is well-known that decentralized o…
DAve-QN: A Distributed Averaged Quasi-Newton Method with Local Superlinear Convergence Rate
Saeed Soori, Konstantin Mischenko, Aryan Mokhtari +2
In this paper, we consider distributed algorithms for solving the empirical risk minimization problem under the master/worker communication model. We develop a distributed asynchro…
Convergence Rate of for Optimistic Gradient and Extra-gradient Methods in Smooth Convex-Concave Saddle Point Problems
Aryan Mokhtari, Asuman Ozdaglar, Sarath Pattathil
We study the iteration complexity of the optimistic gradient descent-ascent (OGDA) method and the extra-gradient (EG) method for finding a saddle point of a convex-concave unconstr…
Stochastic Conditional Gradient++
Hamed Hassani, Amin Karbasi, Aryan Mokhtari +1
In this paper, we consider the general non-oblivious stochastic optimization where the underlying stochasticity may change during the optimization procedure and depends on the poin…
Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free
Mingrui Zhang, Lin Chen, Aryan Mokhtari +2
How can we efficiently mitigate the overhead of gradient communications in distributed optimization? This problem is at the heart of training scalable machine learning models and h…
A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach
Aryan Mokhtari, Asuman Ozdaglar, Sarath Pattathil
In this paper we consider solving saddle point problems using two variants of Gradient Descent-Ascent algorithms, Extra-gradient (EG) and Optimistic Gradient Descent Ascent (OGDA)…