4 citations · 4 across the 3 of their papers we have counts for
3 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…
cs.LG2022★ 4 cited
Coresets for Relational Data and The Applications
Jiaxiang Chen, Qingyuan Yang, Ruomin Huang +1
A coreset is a small set that can approximately preserve the structure of the original input data set. Therefore we can run our algorithm on a coreset so as to reduce the total com…