12 citations · 14 across the 2 of their papers we have counts for
2 papers
cs.DS2015★ 12 cited
A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k
Jerry Li, Ludwig Schmidt
Learning a Gaussian mixture model (GMM) is a fundamental problem in machine learning, learning theory, and statistics. One notion of learning a GMM is proper learning: here, the go…
cs.DS2015★ 2 cited
Sample-Optimal Density Estimation in Nearly-Linear Time
Jayadev Acharya, Ilias Diakonikolas, Jerry Li +1
We design a new, fast algorithm for agnostically learning univariate probability distributions whose densities are well approximated by piecewise polynomial functions. Let be t…