math.ST — Statistics Theory
The planar data-selection constants , including and
For a finite multiset let be the least mean squared distance from a point to , and let be the least such loss attained at the average of points selected from with repetition. Hanneke, Moran, Shlimovich and Yehudayoff asked for . We prove for every : every finite planar multiset satisfies , with equality for copies of and one copy of . In particular , and receives a short proof. The proof reduces to three support points by a mean-preserving Carathéodory argument and then exhibits an explicit random selection of support points, supported on one small triangle of the selection grid, whose second moment about the population weights is dominated by times the categorical covariance. For we also give random selections attaining this second moment exactly.