Fetching the paper…
Reading the bibliography…
When estimating finite mixture models, it is common to make assumptions on the mixture components, such as parametric assumptions.
Identifiability of finite mixtures
Henry Teicher · 1963
Earlier work this paper cites.
On the identifiability of finite mixtures
Sidney J. Yakowitz and John D. Spragins · 1968
Earlier work this paper cites.
Introduction to Probabilistic Automata (Computer Science and Applied Mathematics)
Azaria Paz · 1971
Earlier work this paper cites.
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Joseph B. Kruskal · 1977
Earlier work this paper cites.
Fundamentals of the theory of operator algebras. V1: Elementary theory
R.V. Kadison and J.R. Ringrose · 1983
Earlier work this paper cites.
Studies of multinomial mixture models
Byung Soo Kim · 1984
Earlier work this paper cites.
Identifiability of continuous mixtures of unknown Gaussian distributions
C. Bruni and G. Koch · 1985
Earlier work this paper cites.
An Introduction to Hilbert Space
N. Young · 1988
Earlier work this paper cites.
Matrix Computations (3rd Ed.)
Gene H. Golub and Charles F. Van Loan · 1996
Earlier work this paper cites.
Real analysis: modern techniques and their applications
Gerald B. Folland · 1999
Earlier work this paper cites.
Foundations of Modern Probability
O. Kallenberg · 2002
Earlier work this paper cites.
Identifiability and estimation in finite mixture models with multinomial components
Ryan Elmore and Shaoli Wang · 2003
Cited alongside, same era.
Theory of Point Estimation
E.L. Lehmann and G. Casella · 2003
Cited alongside, same era.
When does non-negative matrix factorization give a correct decomposition into parts?
David Donoho and Victoria Stodden · 2004
Cited alongside, same era.
Reconstructing trees from subtree weights
Lior Pachter and David E Speyer · 2004
Cited alongside, same era.
Variational minimax estimation of discrete distributions under kl loss
Liam Paninski · 2005
Cited alongside, same era.
On signal reconstruction without phase
Radu Balan, Pete Casazza, and Dan Edidin · 2006
Cited alongside, same era.
Tensor decompositions for learning latent variable models
Animashree Anandkumar, Rong Ge, Daniel Hsu, Sham M. Kakade, and Matus Telgarsky · 2014
Later among the works it cites.
The more, the merrier: The blessing of dimensionality for learning large Gaussian mixtures
Joseph Anderson, Mikhail Belkin, Navin Goyal, Luis Rademacher, and James Voss · 2014
Later among the works it cites.
Decontamination of mutually contaminated models
Gilles Blanchard and Clayton Scott · 2014
Later among the works it cites.
Minimax estimation of discrete distributions under ℓ 1 \ell_{1} loss
Yanjun Han, Jiantao Jiao, and Tsachy Weissman · 2014
Later among the works it cites.
Learning mixtures of arbitrary distributions over large discrete domains
Yuval Rabani, Leonard J. Schulman, and Chaitanya Swamy · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Universal kernels
Charles A. Micchelli, Yuesheng Xu, Haizhang Zhang, and Gabor Lugosi · 2006
Cited alongside, same era.
Symmetric tensors and symmetric tensor rank
Pierre Comon, Gene Golub, Lek-Heng Lim, and Bernard Mourrain · 2008
Cited alongside, same era.
Identifiability of parameters in latent structure models with many observed variables
Elizabeth S. Allman, Catherine Matias, and John A. Rhodes · 2009
Cited alongside, same era.
Computing a nonnegative matrix factorization – provably
Sanjeev Arora, Rong Ge, Ravindran Kannan, and Ankur Moitra · 2012
Cited alongside, same era.
Le Song, Animashree Anandkumar, Bo Dai, and Bo Xie · 2014
Later among the works it cites.
On learning distributions from their samples
Sudeep Kamath, Alon Orlitsky, Dheeraj Pichapati, and Ananda Theertha Suresh · 2015
Later among the works it cites.
Competitive distribution estimation: Why is good-turing good
Alon Orlitsky and Ananda Theertha Suresh · 2015
Later among the works it cites.
Instance optimal learning of discrete distributions
Gregory Valiant and Paul Valiant · 2016
Closest in time.
On The Identifiability of Mixture Models from Grouped Samples. Available at arXiv:1502.06644
R. A. Vandermeulen and C. D. Scott · 2016
Closest in time.