Wasserstein distributionally robust estimators have emerged as powerful
...
We examine the last-iterate convergence rate of Bregman proximal methods...
This brief note aims to introduce the recent paradigm of distributional
...
We consider decentralized optimization problems in which a number of age...
This paper is an extended version of [Burashnikova et al., 2021, arXiv:
...
In this paper, we analyze the local convergence rate of optimistic mirro...
In networks of autonomous agents (e.g., fleets of vehicles, scattered
se...
Online learning has been successfully applied to many problems in which ...
Nonsmoothness is often a curse for optimization; but it is sometimes a
b...
Progressive Hedging is a popular decomposition algorithm for solving
mul...
In this paper, we introduce and formalize a rank-one partitioning learni...
Owing to their stability and convergence speed, extragradient methods ha...
Variational inequalities have recently attracted considerable interest i...
In this paper, we present an asynchronous optimization algorithm for
dis...
We develop and analyze an asynchronous algorithm for distributed convex
...
In this paper, we investigate the attractive properties of the proximal
...
In many distributed learning problems, the heterogeneous loading of comp...
We address the problem of multi-class classification in the case where t...