2 papers
cs.LG2024
Relax and Merge: A Simple Yet Effective Framework for Solving Fair -Means and -sparse Wasserstein Barycenter Problems
Shihong Song, Guanlin Mo, Qingyuan Yang +1
The fairness of clustering algorithms has gained widespread attention across various areas, including machine learning, In this paper, we study fair -means clustering in Euclide…
cs.LG2024
Approximate Algorithms For -Sparse Wasserstein Barycenter With Outliers
Qingyuan Yang, Hu Ding
Wasserstein Barycenter (WB) is one of the most fundamental optimization problems in optimal transportation. Given a set of distributions, the goal of WB is to find a new distributi…