Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in Fairness

Yuntao Wang, Yuxuan Li, Qingyuan Yang, Hu Ding
2/14/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

FLHetBench: Benchmarking Device and State Heterogeneity in Federated Learning

99% match1 repo182026

Zoology: Measuring and Improving Recall in Efficient Language Models

99% match2026

VibeCheck: Discover and Quantify Qualitative Differences in Large Language Models

99% match2026

Understanding and Minimising Outlier Features in Transformer Training

98% match2026

Evaluating Transferability in Retrieval Tasks: An Approach Using MMD and Kernel Methods

98% match2026

Bilevel Coreset Selection in Continual Learning: A New Formulation and Algorithm

98% match1 repo152026

Cite this paper

@article{wang2026finding,
  title  = {Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in Fairness},
  author = {Yuntao Wang and Yuxuan Li and Qingyuan Yang and Hu Ding},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:3e711a64eb3a9afd8ae3d19960973bd44b9214ed},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/3e711a64eb3a9afd8ae3d19960973bd44b9214ed.svg)](https://codeofpaper.com/paper/3e711a64eb3a9afd8ae3d19960973bd44b9214ed)

Discussion