Jiwon's Alcove

Fair $k$-Cover Coresets

Pranay Mundra
Yurong Yu
Fatemeh Nargesian
Red and blue points on a plane, with some red points and some blue points having a circle around them.

We study the fair $k$-cover problem, which aims to efficiently obtain coresets such that 1) every point in the full dataset is covered by a point in the coreset at least $k$ times, and 2) points in the coreset adequately represent groups of interest. We solve the problem through a reduction to submodular optimization. Our $\mathrm{F}\mathcal{K}\mathrm{C}$ coresets reduce accuracy disparity while generating coresets rapidly.