AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Fair Clustering Under a Bounded Cost

Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan, John P Dickerson

NeurIPS 2021 · Learning theory and algorithms › Clustering · approach: Fair clustering approximation · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
raise the clustering cost upper bound (price of fairness) (ablation)Group-utilitarian algorithm · Adult and Census1990, delta=0.1group-utilitarian objectiveImproved
use fewer clusters (lower k) (ablation)Group-utilitarian algorithm · Adult and Census1990group-utilitarian objective at fixed cost boundImproved
raise the allowed clustering cost for hard colors (ablation)Group-egalitarian and leximin algorithms · Adult (race, delta=0.05, k=10) and Census1990 (age, delta=0.1, k=5)per-group proportional violationImproved

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