Fetching the paper…
Reading the bibliography…
Unsupervised estimation of latent variable models is a fundamental problem central to numerous applications of machine learning and statistics.
The statistical implications of a system of simultaneous equations
T. Haavelmo · 1943
Earlier work this paper cites.
Approximating discrete probability distributions with dependence trees
C. Chow and C. Liu · 1968
Earlier work this paper cites.
Introduction to Bayesian Inference in Econometrics
A. Zellner · 1971
Earlier work this paper cites.
The sociogenesis of psychological disorder
B. Wheaton · 1978
Earlier work this paper cites.
Causal models in marketing
R. Bagozzi · 1980
Earlier work this paper cites.
Job conditions and personality: A longitudinal assessment of their reciprocal effects
M. Kohn and C. Schooler · 1982
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O(1/ k 2 k^{2} )
Y. Nesterov · 1983
Earlier work this paper cites.
Probabilistic Reasoning in Intelligent Systems—Networks of Plausible Inference
J. Pearl · 1988
Earlier work this paper cites.
Structural Equations with Latent Variables
K. A. Bollen · 1989
Earlier work this paper cites.
Context-specific independence in Bayesian networks
C. Boutilier, N. Friedman, M. Goldszmidt, and D. Koller · 1996
Earlier work this paper cites.
Graphical Models
S. Lauritzen · 1996
Earlier work this paper cites.
Object-oriented Bayesian networks
D. Koller and A. Pfeffer · 1997
Earlier work this paper cites.
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
R. Durbin, S. Eddy, A. Krogh, and G. Mitchison · 1998
Earlier work this paper cites.
Graphs, causality, and structural equation models
J. Pearl · 1998
Earlier work this paper cites.
A few logs suffice to build (almost) all trees: Part I
P. L. Erdös, L. A. Székely, M. A. Steel, and T. J. Warnow · 1999
Earlier work this paper cites.
Causality: Models, Reasoning, and Inference
J. Pearl · 2000
Earlier work this paper cites.
Causation, Prediction, and Search
P. Spirtes, C. Glymour, and R. Scheines · 2000
Earlier work this paper cites.
Independent Component Analysis
A. Hyvärinen, J. Karhunen, and E. Oja · 2001
Earlier work this paper cites.
Blind source separation by sparse decomposition in a signal dictionary
M. Zibulevsky and B. A. Pearlmutter · 2001
Earlier work this paper cites.
Vector autoregressions, policy analysis, and directed acyclic graphs: An application to the U.S. economy
T. O. Awokuse and D. A. Bessler · 2003
Earlier work this paper cites.
Latent Dirichlet allocation
D. Blei, A. Ng, and M. Jordan · 2003
Earlier work this paper cites.
Optimal structure identification with greedy search
D. M. Chickering · 2003
Earlier work this paper cites.
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
I. Daubechies, M. Defrise, and C. De Mol · 2004
Cited alongside, same era.
Towards characterizing Markov equivalence classes for directed acyclic graphs with latent variables
R. Ali, T. Richardson, P. Spirtes, and J. Zhang · 2005
Cited alongside, same era.
Graphical models, causal inference, and econometric models
P. Spirtes · 2005
Cited alongside, same era.
Learning factor graphs in polynomial time and sample complexity
P. Abbeel, D. Koller, and A. Ng · 2006
Cited alongside, same era.
Optimal phylogenetic reconstruction
C. Daskalakis, E. Mossel, and S. Roch · 2006
Cited alongside, same era.
Pachinko allocation: DAG-structured mixture models of topic correlations
W. Li and A. McCallum · 2006
High-dimensional Ising model selection using ℓ 1 \ell_{1} -regularized logistic regression
P. Ravikumar, M. Wainwright, and J. Lafferty · 2010
Later among the works it cites.
Spectral methods for learning multivariate latent tree structure
A. Anandkumar, K. Chaudhuri, D. Hsu, S. M. Kakade, L. Song, and T. Zhang · 2011
Later among the works it cites.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky · 2011
Later among the works it cites.
Learning latent tree graphical models
M. Choi, V. Tan, A. Anandkumar, and A. Willsky · 2011
Later among the works it cites.
Robust matrix decomposition with sparse corruptions
D. Hsu, S. M. Kakade, and T. Zhang · 2011
Later among the works it cites.
On learning discrete graphical models using greedy methods
A. Jalali, C. Johnson, and P. Ravikumar · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
High dimensional graphs and variable selection with the lasso
N. Meinshausen and P. Bühlmann · 2006
Cited alongside, same era.
A linear non-gaussian acyclic model for causal discovery
S. Shimizu, P. O. Hoyer, A. Hyvärisen, and A. Kerminen · 2006
Cited alongside, same era.
Learning the structure of linear latent variable models
R. Silva, R. Scheines, C. Glymour, and P. Spirtes · 2006
Cited alongside, same era.
A correlated topic model of science
D. Blei and J. Lafferty · 2007
Cited alongside, same era.
Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems
M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright · 2007
Cited alongside, same era.
An Interior-Point Method for Large-Scale L1-Regularized Least Squares
S.-J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky · 2007
Cited alongside, same era.
Identifiability of causal graphs using functional models
J. Peters, J. Mooij, D. Janzing, and B. Schölkopf · 2011
Later among the works it cites.
A. Anandkumar, D. P. Foster, D. Hsu, S. M. Kakade, and Y.-K. Liu · 2012
Closest in time.
Tensor decompositions for learning latent variable models
A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and T. Telgarsky · 2012
Closest in time.
A method of moments for mixture models and hidden Markov models
A. Anandkumar, D. Hsu, and S. Kakade · 2012
Closest in time.
High-dimensional structure learning of Ising models: local separation criterion
A. Anandkumar, V. Y. F. Tan, F. Huang, and A. S. Willsky · 2012
Closest in time.
Learning loopy graphical models with latent variables: Efficient methods and guarantees
A. Anandkumar and R. Valluvan · 2012
Closest in time.
A practical algorithm for topic modeling with provable guarantees
S. Arora, R. Ge, Y. Halpern, D. M. Mimno, A. Moitra, D. Sontag, Y. Wu, and M. Zhu · 2012
Closest in time.
Learning topic models—going beyond svd
S. Arora, R. Ge, and A. Moitra · 2012
Closest in time.
Probabilistic topic models
D. M. Blei · 2012
Closest in time.
Latent variable graphical model selection via convex optimization
V. Chandrasekaran, P. Parrilo, and A. Willsky · 2012
Closest in time.
Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
A. Hauser and P. Bühlmann · 2012
Closest in time.
Identifiability of Gaussian structural equation models with same error variances
J. Peters and P. Bühlmann · 2012
Closest in time.
Recovering the tree-like trend of evolution despite extensive lateral genetic transfer: a probabilistic analysis
S. Roch and S. Snir · 2012
Closest in time.
Diagonal and low-rank matrix decompositions, correlation matrices, and ellipsoid fitting
J. Saunderson, V. Chandrasekaran, P. A. Parrilo, and A. S. Willsky · 2012
Closest in time.
Exact recovery of sparsely-used dictionaries
D. A. Spielman, H. Wang, and J. Wright · 2012
Closest in time.
User-friendly tail bounds for sums of random matrices
J. A. Tropp · 2012
Closest in time.