June 15, 2022, 1:11 a.m. | Elad Romanov, Tamir Bendory, Or Ordentlich

stat.ML updates on arXiv.org arxiv.org

This paper studies the sample complexity of learning the $k$ unknown centers
of a balanced Gaussian mixture model (GMM) in $\mathbb{R}^d$ with spherical
covariance matrix $\sigma^2\mathbf{I}$. In particular, we are interested in the
following question: what is the maximal noise level $\sigma^2$, for which the
sample complexity is essentially the same as when estimating the centers from
labeled measurements? To that end, we restrict attention to a Bayesian
formulation of the problem, where the centers are uniformly distributed on the …

arxiv capacity learning role

More from arxiv.org / stat.ML updates on arXiv.org

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Data Management Assistant

@ World Vision | Amman Office, Jordan

Cloud Data Engineer, Global Services Delivery, Google Cloud

@ Google | Buenos Aires, Argentina