Fetching the paper…
Reading the bibliography…
We study the fundamental tradeoffs between statistical accuracy and computational tractability in the analysis of high dimensional heterogeneous data.
Statistical and computational trade-offs in estimation of sparse principal components
Wang, T · 1930
Earlier work this paper cites.
Detection and feature selection in sparse mixture models
Verzelen, N · 1950
Earlier work this paper cites.
Estimating mixtures of normal distributions and switching regressions
Quandt, R. E · 1978
Earlier work this paper cites.
Estimation of the parameters of a Gaussian mixture using the method of moments
Fukunaga, K · 1983
Earlier work this paper cites.
Statistical analysis of finite mixture distributions
Titterington, D · 1985
Earlier work this paper cites.
Asymptotic methods in statistical decision theory
Le Cam, L · 1986
Earlier work this paper cites.
Mixtures of linear regressions
De Veaux, R. D · 1989
Earlier work this paper cites.
Multivariate normal mixtures: A fast consistent method of moments
Lindsay, B. G · 1993
Earlier work this paper cites.
Weakly learning DNF and characterizing statistical query learning using fourier analysis
Blum, A · 1994
Earlier work this paper cites.
Robust text-independent speaker identification using Gaussian mixture speaker models
Reynolds, D · 1995
Earlier work this paper cites.
A mixture likelihood approach for generalized linear models
Wedel, M · 1995
Earlier work this paper cites.
Gaussian mixture density modeling, decomposition, and applications
Zhuang, X · 1996
Earlier work this paper cites.
Finding a large hidden clique in a random graph
Alon, N · 1998
Earlier work this paper cites.
A polynomial-time algorithm for learning noisy linear threshold functions
Blum, A · 1998
Earlier work this paper cites.
Efficient noise-tolerant learning from statistical queries
Kearns, M · 1998
Earlier work this paper cites.
Learning mixtures of Gaussians
Dasgupta, S · 1999
Earlier work this paper cites.
Computational sample complexity and attribute-efficient learning
Servedio, R. A · 1999
Earlier work this paper cites.
A two-round variant of EM for Gaussian mixtures
Dasgupta, S · 2000
Earlier work this paper cites.
Learning mixtures of arbitrary Gaussians
Sanjeev, A · 2001
Earlier work this paper cites.
On learning correlated Boolean functions using statistical queries
Yang, K · 2001
Earlier work this paper cites.
Model-based clustering and data transformations for gene expression data
Yeung, K. Y · 2001
Earlier work this paper cites.
Relations between average case complexity and approximation complexity
Feige, U · 2002
Earlier work this paper cites.
On the efficiency of noise-tolerant PAC algorithms derived from statistical queries
Jackson, J · 2003
Earlier work this paper cites.
Finite mixture models
McLachlan, G · 2004
Earlier work this paper cites.
A spectral algorithm for learning mixture models
Vempala, S · 2004
Earlier work this paper cites.
Hypothesis testing in mixture regression models
Zhu, H.-T · 2004
Earlier work this paper cites.
Practical privacy: The SuLQ framework
Blum, A · 2005
Earlier work this paper cites.
New lower bounds for statistical query learning
Yang, K · 2005
Earlier work this paper cites.
Variable selection for model-based clustering
Raftery, A. E · 2006
Earlier work this paper cites.
An investigation of computational and informational limits in Gaussian mixture clustering
Srebro, N · 2006
Earlier work this paper cites.
Map-reduce for machine learning on multicore
Chu, C · 2007
Earlier work this paper cites.
Variables selection in finite mixture of regression models
Khalili, A · 2007
Earlier work this paper cites.
Penalized model-based clustering with application to variable selection
Pan, W · 2007
Earlier work this paper cites.
On basing lower-bounds for learning on worst-case assumptions
Applebaum, B · 2008
Cited alongside, same era.
Isotropic PCA and affine-invariant clustering
Brubaker, S. C · 2008
Cited alongside, same era.
Slope heuristics for variable selection and clustering via Gaussian mixtures
Maugis, C · 2008
Cited alongside, same era.
Continuous bivariate distributions
Balakrishnan, N · 2009
Cited alongside, same era.
Learning Gaussian mixtures with arbitrary separation
Belkin, M · 2009
Cited alongside, same era.
Variable selection for clustering with Gaussian mixture models
Maugis, C · 2009
Cited alongside, same era.
Sparse PCA via covariance thresholding
Deshpande, Y · 2014
Later among the works it cites.
Challenges of big data analysis
Fan, J · 2014
Later among the works it cites.
Sparse Bayesian unsupervised learning
Gaiffas, S · 2014
Later among the works it cites.
Computational barriers in minimax submatrix detection
Ma, Z · 2014
Later among the works it cites.
Wang, Z · 2014
Later among the works it cites.
Alternating minimization for mixed linear regression
Yi, X · 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…
Characterizing statistical query learning: Simplified notions and proofs
Szörényi, B · 2009
Cited alongside, same era.
Polynomial learning of distribution families
Belkin, M · 2010
Cited alongside, same era.
Fitting mixtures of linear regressions
Faria, S · 2010
Cited alongside, same era.
Efficiently learning mixtures of two Gaussians
Kalai, A. T · 2010
Cited alongside, same era.
Settling the polynomial learnability of mixtures of Gaussians
Moitra, A · 2010
Cited alongside, same era.
ℓ 1 \ell_{1} -penalization for mixture regression models
Städler, N · 2010
Cited alongside, same era.
Lower bounds on the performance of polynomial-time algorithms for sparse linear regression
Zhang, Y · 2014
Later among the works it cites.
Efficient sparse clustering of high-dimensional non-spherical Gaussian mixtures
Azizyan, M · 2015
Later among the works it cites.
Incoherence-optimal matrix completion
Chen, Y · 2015
Later among the works it cites.
On the complexity of random satisfiability problems with planted solutions
Feldman, V · 2015
Later among the works it cites.
Learning mixtures of Gaussians in high dimensions
Ge, R · 2015
Later among the works it cites.
Computational lower bounds for community detection on random graphs
Hajek, B · 2015
Later among the works it cites.
Do semidefinite relaxations solve sparse PCA up to the information limit?
Krauthgamer, R · 2015
Later among the works it cites.
Minimax rate of convergence and the performance of empirical risk minimization in phase retrieval
Lecué, G · 2015
Later among the works it cites.
Regularized EM algorithms: A unified framework and statistical guarantees
Yi, X · 2015
Later among the works it cites.
Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
Cai, T. T · 2016
Later among the works it cites.
Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices
Chen, Y · 2016
Later among the works it cites.
Rare and weak effects in large-scale inference: Methods and phase diagrams
Jin, J · 2016
Later among the works it cites.
Fundamental limits of symmetric low-rank matrix estimation
Lelarge, M · 2016
Later among the works it cites.
Optimality and sub-optimality of pca for spiked random matrices and synchronization
Perry, A · 2016
Later among the works it cites.
More supervision, less computation: statistical-computational tradeoffs in weakly supervised learning
Yi, X · 2016
Later among the works it cites.
Statistical guarantees for the EM algorithm: From population to sample-based analysis
Balakrishnan, S · 2017
Later among the works it cites.
Computational and statistical boundaries for submatrix localization in a large noisy matrix
Cai, T. T · 2017
Later among the works it cites.
Statistical query lower bounds for robust estimation of high-dimensional Gaussians and Gaussian mixtures
Diakonikolas, I · 2017
Later among the works it cites.
Statistical query algorithms for mean vector estimation and stochastic convex optimization
Feldman, V · 2017
Later among the works it cites.
Phase transitions for high dimensional clustering and related problems
Jin, J · 2017
Later among the works it cites.
Reducibility and computational lower bounds for problems with planted sparse structure
Brennan, M · 2018
Closest in time.
Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
Cai, T. T · 2018
Closest in time.
The edge density barrier: Computational-statistical tradeoffs in combinatorial inference
Lu, H · 2018
Closest in time.
Wang, Z · 2018
Closest in time.
Statistical problems with planted structures: Information-theoretical and computational limits
Wu, Y · 2018
Closest in time.
Tensor SVD: Statistical and computational limits
Zhang, A · 2018
Closest in time.
Sparse cca: Adaptive estimation and computational barriers
Gao, C · 2074
Closest in time.