activity
20182021
most citedA Decentralized Proximal Point-type Method for Saddle Point Problems

15 citations · 49 across the 9 of their papers we have counts for

collaborators

11 papers

cs.LG20213 cited

Federated Functional Gradient Boosting

Zebang Shen, Hamed Hassani, Satyen Kale +1

In this paper, we initiate a study of functional minimization in Federated Learning. First, in the semi-heterogeneous setting, when the marginal distributions of the feature vector…

stat.ML20204 cited

Sinkhorn Natural Gradient for Generative Models

Zebang Shen, Zhenfu Wang, Alejandro Ribeiro +1

We consider the problem of minimizing a functional over a parametric family of probability measures, where the parameterization is characterized via a push-forward structure. An im…

cs.LG20204 cited

Sinkhorn Barycenter via Functional Gradient Descent

Zebang Shen, Zhenfu Wang, Alejandro Ribeiro +1

In this paper, we consider the problem of computing the barycenter of a set of probability distributions under the Sinkhorn divergence. This problem has recently found applications…

cs.LG20203 cited

Safe Learning under Uncertain Objectives and Constraints

Mohammad Fereydounian, Zebang Shen, Aryan Mokhtari +2

In this paper, we consider non-convex optimization problems under \textit{unknown} yet safety-critical constraints. Such problems naturally arise in a variety of domains including…

math.OC201915 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…

cs.LG20192 cited

Efficient Projection-Free Online Methods with Stochastic Recursive Gradient

Jiahao Xie, Zebang Shen, Chao Zhang +2

This paper focuses on projection-free methods for solving smooth Online Convex Optimization (OCO) problems. Existing projection-free methods either achieve suboptimal regret bounds…