activity
20152026
most citedDSA: Decentralized Double Stochastic Averaging Gradient Algorithm

146 citations · 362 across the 38 of their papers we have counts for

collaborators
Showing 2019 · math.OCShow all

6 papers · 2 filters

math.OC2019★ 15 cited

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…

math.OC2019★ 11 cited

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…

math.OC2019★ 14 cited

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…

math.OC2019

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…

math.OC2019

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…

math.OC2019

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)…