Andrii Semenov
Andrii Semenov
Home
Education
Work Experience
Posts
Publications
Talks
Projects
Light
Dark
Automatic
Source Themes
Bregman Proximal Method for Efficient Communications under Similarity
We propose a novel distributed method for monotone variational inequalities and convex-concave saddle point problems arising in various machine learning applications such as game theory and adversarial training. By exploiting similarity our algorithm overcomes communication bottleneck which is a major issue in distributed optimization.
Aleksandr Beznosikov
,
Darina Dvinskikh
,
Andrei Semenov
,
Alexander Gasnikov
PDF
Cite
DOI
arXiv
«
Cite
×