activity
20142023
most citedNonasymptotic Convergence Rates for Cooperative Learning Over Time-Varying Directed Graphs

63 citations · 323 across the 46 of their papers we have counts for

collaborators
Showing 2018 · math.OCShow all

10 papers · 2 filters

math.OC2018

On Increasing Self-Confidence in Non-Bayesian Social Learning over Time-Varying Directed Graphs

César A. Uribe, Ali Jadbabaie

We study the convergence of the log-linear non-Bayesian social learning update rule, for a group of agents that collectively seek to identify a parameter that best describes a join…

math.OC2018

Achieving Acceleration in Distributed Optimization via Direct Discretization of the Heavy-Ball ODE

Jingzhao Zhang, César A. Uribe, Aryan Mokhtari +1

We develop a distributed algorithm for convex Empirical Risk Minimization, the problem of minimizing large but finite sum of convex functions over networks. The proposed algorithm…

math.OC2018

Graph-Theoretic Analysis of Belief System Dynamics under Logic Constraints

Angelia Nedić, Alex Olshevsky, César A. Uribe

Opinion formation cannot be modeled solely as an ideological deduction from a set of principles; rather, repeated social interactions and logic constraints among statements are con…

math.OC2018

A Method for Distributed Transactive Control in Power Systems based on the Projected Consensus Algorithm

Eder Baron-Prada, César A. Uribe, Eduardo Mojica-Nava

The shift of power systems toward a smarter grid has brought devices such as distributed generators and smart loads with an increase of the operational challenges for the system op…

math.OC2018★ 6 cited

A Dual Approach for Optimal Algorithms in Distributed Optimization over Networks

César A. Uribe, Soomin Lee, Alexander Gasnikov +1

We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a sum of functions over in a ne…

math.OC2018★ 18 cited

The global rate of convergence for optimal tensor methods in smooth convex optimization

Alexander Gasnikov, Pavel Dvurechensky, Eduard Gorbunov +3

We consider convex optimization problems with the objective function having Lipshitz-continuous -th order derivative, where . We propose a new tensor method, which clos…

math.OC2018★ 21 cited

Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters

Pavel Dvurechensky, Darina Dvinskikh, Alexander Gasnikov +2

We study the decentralized distributed computation of discrete approximations for the regularized Wasserstein barycenter of a finite set of continuous probability measures distribu…

math.OC2018

Accelerating Incremental Gradient Optimization with Curvature Information

Hoi-To Wai, Wei Shi, Cesar A. Uribe +2

This paper studies an acceleration technique for incremental aggregated gradient ({\sf IAG}) method through the use of \emph{curvature} information for solving strongly convex fini…

math.OC2018★ 18 cited

Optimal Distributed Optimization on Slowly Time-Varying Graphs

Alexander Rogozin, César A. Uribe, Alexander Gasnikov +2

We study optimal distributed first-order optimization algorithms when the network (i.e., communication constraints between the agents) changes with time. This problem is motivated…

math.OC2018

Distributed Computation of Wasserstein Barycenters over Networks

César A. Uribe, Darina Dvinskikh, Pavel Dvurechensky +2

We propose a new \cu{class-optimal} algorithm for the distributed computation of Wasserstein Barycenters over networks. Assuming that each node in a graph has a probability distrib…