Semidefinite Programming Relaxations of the Simplified Wasserstein Barycenter Problem: An ADMM Approach
MetadataShow full item record
The Simplified Wasserstein Barycenter problem, the problem of picking k points each chosen from a distinct set of n points as to minimize the sum of distances to their barycenter, finds applications in various areas of data science. Despite the simple formulation, it is a hard computational problem. The difficulty comes in the lack of efficient algorithms for approximating the solution. In this thesis, I propose a doubly non-negative relaxation to this problem and apply the alternating direction method of multipliers (ADMM) with intermediate update of multipliers, to efficiently compute tight lower and upper bounds on its optimal value for certain input data distributions. Our empirics show that generically the gap between upper and lower bounds is zero, though problems with symmetries exhibit positive gaps.
Cite this version of the work
Jiahui Cheng (2023). Semidefinite Programming Relaxations of the Simplified Wasserstein Barycenter Problem: An ADMM Approach. UWSpace. http://hdl.handle.net/10012/19416