Learning rates for Gaussian mixtures under group invariance

被引:0
作者
Brunel, Victor-Emmanuel [1 ]
机构
[1] ENSAE ParisTech, Palaiseau, France
来源
CONFERENCE ON LEARNING THEORY, VOL 99 | 2019年 / 99卷
关键词
Asymptotic rates; Gaussian mixtures; Maximum likelihood; Group actions; CONVERGENCE; FINITE; EM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We study the pointwise maximum likelihood estimation rates for a class of Gaussian mixtures that are invariant under the action of some isometry group. This model is also known as multi-reference alignment, where random rotations of a given vector are observed, up to Gaussian noise. We completely characterize the speed of the maximum likelihood estimator, by giving a comprehensive description of the likelihood geometry of the model. We show that the unknown parameter can always be decomposed into two components, one of which can be estimated at the fast rate n(-1/2), the other one being estimated at the slower rate n(-1/4). We provide an algebraic description and a geometric interpretation of these facts.
引用
收藏
页数:21
相关论文
共 26 条
  • [1] Abbe E., 2018, IEEE Transactions on Information Theory
  • [2] Abbe E, 2018, IEEE INT SYMP INFO, P561, DOI 10.1109/ISIT.2018.8437646
  • [3] Algebraic Identifiability of Gaussian Mixtures
    Amendola, Carlos
    Ranestad, Kristian
    Sturmfels, Bernd
    [J]. INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2018, 2018 (21) : 6556 - 6580
  • [4] [Anonymous], 2013, Advances in Neural Information Processing Systems
  • [5] Arora Sanjeev, 2001, P 33 ANN ACM S THEOR, P247, DOI DOI 10.1145/380752.380808
  • [6] STATISTICAL GUARANTEES FOR THE EM ALGORITHM: FROM POPULATION TO SAMPLE-BASED ANALYSIS
    Balakrishnan, Sivaraman
    Wainwrightt, Martin J.
    Yu, Bin
    [J]. ANNALS OF STATISTICS, 2017, 45 (01) : 77 - 120
  • [7] Bandeira Afonso S, 2014, P 5 C INN THEOR COMP, P459
  • [8] OPTIMAL RATE OF CONVERGENCE FOR FINITE MIXTURE-MODELS
    CHEN, JH
    [J]. ANNALS OF STATISTICS, 1995, 23 (01) : 221 - 233
  • [9] Dasgupta S., 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), P634, DOI 10.1109/SFFCS.1999.814639
  • [10] Tight Bounds for Learning a Mixture of Two Gaussians
    Hardt, Moritz
    Price, Eric
    [J]. STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 753 - 760