The planar data-selection constants $F(2,n)=2n/(2n-1)$, including $F(2,3)=6/5$ and $F(2,2)=4/3$
Source: hexagonmath.org/abs/2611.00511v1
For a finite multiset $D\subset\mathbb{R}^2$ let $L_D^*$ be the least mean squared distance from a point to $D$, and let $L_D^*(n)$ be the least such loss attained at the average of $n$ points selected from $D$ with repetition. Hanneke, Moran, Shlimovich and Yehudayoff asked for $F(d,n)=\sup_D L_D^*(n)/L_D^*$. We prove $F(2,n)=2n/(2n-1)$ for every $n\ge2$: every finite planar multiset satisfies $L_D^*(n)\le\frac{2n}{2n-1}L_D^*$, with equality for $2n-1$ copies of $(0,0)$ and one copy of $(1,0)$. In particular $F(2,3)=6/5$, and $F(2,2)=4/3$ receives a short proof. The proof reduces to three…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00511
curl -X POST /api/v1/records/hexagon/2611.00511/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00511/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'