Fetching the paper…
Reading the bibliography…
Researchers currently use a number of approaches to predict and substantiate information-computation gaps in high-dimensional statistical estimation problems.
Mark Jerrum, Large cliques elude the metropolis process
1992
Earlier work this paper cites.
Richard Beigel, The polynomial method in circuit complexity
1993
Earlier work this paper cites.
Avrim Blum, Merrick Furst, Jeffrey Jackson, Michael Kearns, Yishay Mansour, and Steven Rudich, Weakly learning dnf and characterizing statistical query learning using fourier analysis
1994
Earlier work this paper cites.
Ping Feng and Yoram Bresler, Spectrum-blind minimum-rate sampling and reconstruction of multiband signals
1996
Earlier work this paper cites.
Michael Kearns, Efficient noise-tolerant learning from statistical queries
1998
Earlier work this paper cites.
Rocco A Servedio, Computational sample complexity and attribute-efficient learning
1999
Earlier work this paper cites.
Scott E Decatur, Oded Goldreich, and Dana Ron, Computational sample complexity
2000
Earlier work this paper cites.
Dima Grigoriev, Linear lower bound on degrees of positivstellensatz calculus proofs for the parity
2001
Earlier work this paper cites.
Uriel Feige, Relations between average case complexity and approximation complexity
2002
Earlier work this paper cites.
Uriel Feige and Robert Krauthgamer, The probable value of the lovász–schrijver relaxations for maximum independent set
2003
Earlier work this paper cites.
Haixia Jia, Cris Moore, and Bart Selman, From spin glasses to hard satisfiable formulas
2004
Earlier work this paper cites.
Jinho Baik, Gérard Ben Arous, Sandrine Péché, et al., Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
2005
Earlier work this paper cites.
Emmanuel J Candes, Justin K Romberg, and Terence Tao, Stable signal recovery from incomplete and inaccurate measurements
2006
Earlier work this paper cites.
David L Donoho, Compressed sensing
2006
Earlier work this paper cites.
Emmanuel Candes and Terence Tao, The Dantzig selector: Statistical estimation when p is much larger than n
2007
Earlier work this paper cites.
Adam R Klivans and Alexander A Sherstov, Unconditional lower bounds for learning intersections of halfspaces
2007
Earlier work this paper cites.
Michael Lustig, David Donoho, and John M Pauly, Sparse MRI: The application of compressed sensing for rapid MR imaging
2007
Earlier work this paper cites.
Dimitris Achlioptas and Amin Coja-Oghlan, Algorithmic barriers from phase transitions
2008
Earlier work this paper cites.
Alexandre d’Aspremont, Francis Bach, and Laurent El Ghaoui, Optimal solutions for sparse principal component analysis
2008
Earlier work this paper cites.
J. Friedman, T. Hastie, and R. Tibshirani, Sparse inverse covariance estimation with the graphical lasso
2008
Earlier work this paper cites.
Benjamin Rossman, On the constant-depth complexity of k-clique
2008
Earlier work this paper cites.
Shai Shalev-Shwartz and Nathan Srebro, SVM optimization: inverse dependence on training set size
2008
Earlier work this paper cites.
Iain M Johnstone and Arthur Yu Lu, On consistency and sparsity for principal components analysis in high dimensions
2009
Earlier work this paper cites.
Marc Mezard and Andrea Montanari, Information, physics, and computation
2009
Earlier work this paper cites.
Anwei Chai, Miguel Moscoso, and George Papanicolaou, Array imaging using intensity-only measurements
2010
Earlier work this paper cites.
Ankur Moitra and Gregory Valiant, Settling the polynomial learnability of mixtures of gaussians
2010
Earlier work this paper cites.
Ron Rubinstein, Alfred M Bruckstein, and Michael Elad, Dictionaries for sparse representation modeling
2010
Earlier work this paper cites.
Benjamin Recht, Maryam Fazel, and Pablo A Parrilo, Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
2010
Earlier work this paper cites.
Wei Wang, Martin J Wainwright, and Kannan Ramchandran, Information-theoretic bounds on model selection for gaussian markov random fields
2010
Earlier work this paper cites.
Sivaraman Balakrishnan, Mladen Kolar, Alessandro Rinaldo, Aarti Singh, and Larry Wasserman, Statistical and computational tradeoffs in biclustering
2011
Earlier work this paper cites.
Pradeep Ravikumar, Martin J Wainwright, Garvesh Raskutti, Bin Yu, et al., High-dimensional covariance estimation by minimizing ℓ 1 \ell_{1} -penalized log-determinant divergence
2011
Earlier work this paper cites.
Ery Arias-Castro, Sébastien Bubeck, and Gábor Lugosi, Detection of correlations
2012
Earlier work this paper cites.
Vitaly Feldman, A complete characterization of statistical query learning with applications to evolvability
2012
Earlier work this paper cites.
Morteza Ibrahimi, Yashodhan Kanoria, Matt Kraning, and Andrea Montanari, The set of solutions of random xorsat formulae
2012
Cited alongside, same era.
Shai Shalev-Shwartz, Ohad Shamir, and Eran Tromer, Using more data to speed-up training time
2012
Cited alongside, same era.
Daniel A Spielman, Huan Wang, and John Wright, Exact recovery of sparsely-used dictionaries
2012
Cited alongside, same era.
Quentin Berthet and Philippe Rigollet, Complexity theoretic lower bounds for sparse principal component detection
2013
Cited alongside, same era.
Venkat Chandrasekaran and Michael I Jordan, Computational and statistical tradeoffs via convex relaxation
2013
Cited alongside, same era.
Albert Atserias, Ilario Bonacina, Susanna De Rezende, Massimo Lauria, Jakob Nordstrőm, and Alexander Razborov, Clique is hard on average for regular resolution
2018
Later among the works it cites.
Matthew Brennan, Guy Bresler, and Wasim Huleihel, Reducibility and computational lower bounds for problems with planted sparse structure
2018
Later among the works it cites.
Vitaly Feldman, Will Perkins, and Santosh Vempala, On the complexity of random satisfiability problems with planted solutions
2018
Later among the works it cites.
Samuel B Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, and Tselil Schramm, On the integrality gap of degree-4 sum of squares for planted clique
2018
Later among the works it cites.
Samuel B Hopkins, Statistical inference and the sum of squares method
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi, Low-rank matrix completion using alternating minimization
2013
Cited alongside, same era.
Kishore Jaganathan, Samet Oymak, and Babak Hassibi, Sparse phase retrieval: Convex algorithms and limitations
2013
Cited alongside, same era.
2013
Cited alongside, same era.
Ery Arias-Castro and Nicolas Verzelen, Community detection in dense random networks
2014
Cited alongside, same era.
G. Bresler, D. Gamarnik, and D. Shah, Hardness of parameter estimation in graphical models
2014
Cited alongside, same era.
David Gamarnik and Madhu Sudan, Limits of local algorithms over sparse random graphs
2014
Cited alongside, same era.
Ziwei Ji and Matus Telgarsky, Risk and parameter convergence of logistic regression
2018
Later among the works it cites.
Amelia Perry, Alexander S Wein, Afonso S Bandeira, Ankur Moitra, et al., Optimality and sub-optimality of pca i: Spiked random matrix models
2018
Later among the works it cites.
2018
Later among the works it cites.
Daniel Soudry, Elad Hoffer, Mor Shpigel Nacson, Suriya Gunasekar, and Nathan Srebro, The implicit bias of gradient descent on separable data
2018
Later among the works it cites.
Anru Zhang and Dong Xia, Tensor SVD: Statistical and computational limits
2018
Later among the works it cites.
Matthew Brennan and Guy Bresler, Optimal average-case reductions to sparse pca: From weak assumptions to strong hardness
2019
Later among the works it cites.
2019
Later among the works it cites.
Boaz Barak, Samuel Hopkins, Jonathan Kelner, Pravesh K Kothari, Ankur Moitra, and Aaron Potechin, A nearly tight sum-of-squares lower bound for the planted clique problem
2019
Later among the works it cites.
2019
Later among the works it cites.
Ilias Diakonikolas, Weihao Kong, and Alistair Stewart, Efficient algorithms and lower bounds for robust linear regression
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Samuel B Hopkins and Jerry Li, How hard is robust mean estimation?
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Alexander S Wein, Ahmed El Alaoui, and Cristopher Moore, The Kikuchi hierarchy and tensor PCA
2019
Later among the works it cites.
Gérard Ben Arous, Alexander S Wein, and Ilias Zadik, Free energy wells and overlap gap property in sparse pca
2020
Closest in time.
Rishabh Dudeja and Daniel Hsu, Statistical query lower bounds for tensor PCA
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Justin Holmgren and Alexander S Wein, Counterexamples to the low-degree conjecture
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Gerard Ben Arous, Reza Gheissari, Aukosh Jagannath, et al., Algorithmic thresholds for tensor pca
2087
Closest in time.