No official code found. Best implementation: SongShihong/fair_kmeans-relax_and_merge (0 stars, last commit 2025-02-07).
Approximately Pareto-optimal Solutions for Bi-Objective k-Clustering
Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
MoE-LLaVA: Mixture of Experts for Large Vision-Language Models
On Sparse Canonical Correlation Analysis
Random Search as a Baseline for Sparse Neural Network Architecture Search
A Single-Step, Sharpness-Aware Minimization is All You Need to Achieve Efficient and Accurate Sparse Training
@article{song2026relax,
title = {Relax and Merge: A Simple Yet Effective Framework for Solving Fair k-Means and k-sparse Wasserstein Barycenter Problems},
author = {Shihong Song and Guanlin Mo and Hu Ding},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:07fded4f90dc6807d7729a5c55a360382097c5a5},
journal = {ICLR 2025 2025}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/07fded4f90dc6807d7729a5c55a360382097c5a5)