Fetching the paper…
Reading the bibliography…
We consider the problem of identifying, from its first $m$ noisy moments, a probability distribution on $[0,1]$ of support $k<\infty$.
Inverses of Vandermonde matrices
F. D. Parker · 1964
Earlier work this paper cites.
Bounds on a polynomial
T. J. Rivlin · 1970
Earlier work this paper cites.
Introduction to Numerical Analysis
F. B. Hildebrand · 1974
Earlier work this paper cites.
An Introduction to Orthogonal Polynomials
T. S. Chihara · 1978
Earlier work this paper cites.
A Prony method for noisy data: Choosing the signal components and selecting the order in exponential signal models
R. Kumaresan, D. W. Tufts, and L. L. Scharf · 1984
Earlier work this paper cites.
The perfidious polynomial
J. H. Wilkinson · 1984
Earlier work this paper cites.
How (un)stable are Vandermonde systems
W. Gautschi · 1990
Earlier work this paper cites.
The structured sensitivity of Vandermonde-like systems
S. G. Bartels and D. J. Higham · 1992
Earlier work this paper cites.
On the learnability of discrete distributions
M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie · 1994
Earlier work this paper cites.
Optimal and nearly optimal algorithms for approximating polynomial zeros
V. Y. Pan · 1996
Earlier work this paper cites.
The complexity of the algebraic eigenproblem
V. Y. Pan, Z. Q. Chen, and A. Zheng · 1998
Earlier work this paper cites.
The Symmetric Eigenvalue Problem
B. N. Parlett · 1998
Cited alongside, same era.
Estimating a mixture of two product distributions
Y. Freund and Y. Mansour · 1999
Cited alongside, same era.
Probabilistic latent semantic analysis
T. Hofmann · 1999
Cited alongside, same era.
The complexity of the matrix eigenproblem
V. Y. Pan and Z. Q. Chen · 1999
Cited alongside, same era.
Latent semantic indexing: A probabilistic analysis
C. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala · 2000
Cited alongside, same era.
Evolutionary trees can be learned in polynomial time in the two state general Markov model
M. Cryan, L. Goldberg, and P. Goldberg · 2001
Cited alongside, same era.
A method of moments for mixture models and hidden Markov models
A. Anandkumar, D. Hsu, and S. M. Kakade · 2012
Later among the works it cites.
Learning topic models — going beyond SVD
S. Arora, R. Ge, and A. Moitra · 2012
Later among the works it cites.
Learning mixtures of arbitrary distributions over large discrete domains
Y. Rabani, L. J. Schulman, and C. Swamy · 2014
Later among the works it cites.
Learning arbitrary statistical mixtures of discrete distributions
J. Li, Y. Rabani, L. J. Schulman, and C. Swamy · 2015
Later among the works it cites.
A comprehensive course in analysis
B. Simon · 2015
Later among the works it cites.
Elements of Causal Inference
J. Peters, D. Janzing, and B. Schölkopf · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Chaudhuri and S. Rao · 2008
Cited alongside, same era.
Learning mixtures of product distributions over discrete domains
J. Feldman, R. O’Donnell, and R. A. Servedio · 2008
Cited alongside, same era.
Causality
J. Pearl · 2009
Cited alongside, same era.
A spectral algorithm for latent Dirichlet allocation
A. Anandkumar, D. P. Foster, D. J. Hsu, S. M. Kakade, and Y.-K. Liu · 2012
Cited alongside, same era.
Essai expérimentale et analytique
R. de Prony
Cited in the paper.
K. Schmüdgen · 2017
Later among the works it cites.
Beyond the low-degree algorithm: mixtures of subcubes and their applications
S. Chen and A. Moitra · 2019
Later among the works it cites.
How many subpopulations is too many? exponential lower bounds for inferring population histories
Y. Kim, F. Koehler, A. Moitra, E. Mossel, and G. Ramnarayan · 2019
Later among the works it cites.
Hoeffding’s inequality — Wikipedia, the free encyclopedia, 2020
Wikipedia contributors · 2020
Closest in time.