• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Distributed Algorithms with Variance Reduction for Calculating Wasserstein Barycenters

Student: Arzhantsev Andrei

Supervisor: Darina Dvinskikh

Faculty: Faculty of Computer Science

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Final Grade: 8

Year of Graduation: 2024

This work is focused on Wasserstein barycenters (WB) problem, which is an important application of optimal transport (OT) problem. WB can be considered as a saddle point optimization problem, for which many methods are developed and studied. Recent articles related to this topic had improvements in complexity bounds for the problem, obtained through the use of optimization methods such as MirrorProx or Dual extrapolation. Other studies in the field of saddle point optimization problems demonstrate that algorithms can be improved due to the proper utilization of variance reduction techniques. Investigation of the non-Euclidean setup of WB problem and generalization of the newest algorithms for it is the main goal of the work. Comparison with existing methods is considered as well.

Full text (added May 20, 2024)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses