English

Learning Populations of Parameters

Machine Learning 2017-11-23 v2

Abstract

Consider the following estimation problem: there are nn entities, each with an unknown parameter pi[0,1]p_i \in [0,1], and we observe nn independent random variables, X1,,XnX_1,\ldots,X_n, with XiX_i \sim Binomial(t,pi)(t, p_i). How accurately can one recover the "histogram" (i.e. cumulative density function) of the pip_i's? While the empirical estimates would recover the histogram to earth mover distance Θ(1t)\Theta(\frac{1}{\sqrt{t}}) (equivalently, 1\ell_1 distance between the CDFs), we show that, provided nn is sufficiently large, we can achieve error O(1t)O(\frac{1}{t}) which is information theoretically optimal. We also extend our results to the multi-dimensional parameter case, capturing settings where each member of the population has multiple associated parameters. Beyond the theoretical results, we demonstrate that the recovery algorithm performs well in practice on a variety of datasets, providing illuminating insights into several domains, including politics, sports analytics, and variation in the gender ratio of offspring.

Keywords

Cite

@article{arxiv.1709.02707,
  title  = {Learning Populations of Parameters},
  author = {Kevin Tian and Weihao Kong and Gregory Valiant},
  journal= {arXiv preprint arXiv:1709.02707},
  year   = {2017}
}
R2 v1 2026-06-22T21:37:17.137Z