AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

New Coresets for Fair Clustering

Xuan Wu, Chansophea Wathanak In, Yi Li

NeurIPS 2026 · Learning theory and algorithms › Clustering · approach: Fair clustering approximation

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Constructs the first near-linear-in-k coreset for fair k-median in general metric spaces, and uses merge-and-reduce to obtain a streaming algorithm with near-linear-in-k space.

Problem

Coresets for fair (group-constrained) k-median clustering in general metric spaces have previously been large; the coreset size and streaming space were not near-linear in k.

Approach

A distributional reinterpretation of capacitated clustering, in which the cost of assigning a dataset to a capacitated set of centers is recast in distributional terms, enabling a coreset construction whose size is near-linear in k.

Key results

Experimental setup

Builds on: merge-and-reduce

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy