Fetching the paper…
Reading the bibliography…
We study the problem of recovering a hidden binary $k$-sparse $p$-dimensional vector $\beta$ from $n$ noisy linear observations $Y=X\beta+W$ where $X_{ij}$ are i.i.d.
Statistical problems with planted structures: Information-theoretical and computational limits
Yihong Wu and Jiaming Xu · 1903
Earlier work this paper cites.
The distribution of a quadratic form of normal random variables
Bruno Baldessari · 1967
Earlier work this paper cites.
Subset selection in regression
Alan Miller. Chapman and Hall · 1990
Earlier work this paper cites.
Adaptive estimation of a quadratic functional by model selection
Beatrice Laurent and Pascal Massart · 2000
Earlier work this paper cites.
Atomic decomposition by basis pursuit
Scott Shaobing Chen, David L. Donoho, and Michael A. Saunders · 2001
Earlier work this paper cites.
A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors
T. Tanaka · 2002
Earlier work this paper cites.
Decoding by linear programming
Emmanuel J Candes and Terence Tao · 2005
Earlier work this paper cites.
Randomly spread CDMA: Asymptotics via statistical physics
Dongning Guo and Sergio Verdú · 2005
Earlier work this paper cites.
Elements of information theory 2nd edition
Thomas M Cover and Joy A Thomas · 2006
Earlier work this paper cites.
Compressed sensing
David L Donoho · 2006
Earlier work this paper cites.
Maxwell construction: The hidden bridge between iterative and maximum a posteriori decoding
Cyril Méasson, Andrea Montanari, and Rüdiger Urbanke · 2008
Earlier work this paper cites.
Necessary and sufficient conditions for sparsity pattern recovery
Alyson K. Fletcher, Sundeep Rangan, and Vivek K Goyal · 2009
Earlier work this paper cites.
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
Martin J. Wainwright · 2009
Earlier work this paper cites.
Sharp thresholds for high-dimensional and noisy sparsity recovery using constrained quadratic programming (lasso)
Martin J Wainwright · 2009
Earlier work this paper cites.
Information theoretic bounds for compressed sensing
Shuchin Aeron, Venkatesh Saligrama, and Manqi Zhao · 2010
Earlier work this paper cites.
Shannon-theoretic limits on noisy compressive sampling
Mehmet Akcakaya and Vahid Tarokh · 2010
Cited alongside, same era.
Bounding the volume of hamming balls
Nirman Kumar · 2010
Cited alongside, same era.
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices
Wei Wang, Martin J Wainwright, and Kannan Ramchandran · 2010
Cited alongside, same era.
Limits on support recovery of sparse signals via multiple-access communication techniques
Yuzhe Jin, Young-Han Kim, and Bhaskar D Rao · 2011
Cited alongside, same era.
Nearly sharp sufficient conditions on exact sparsity pattern recovery
K. Rahnama Rad · 2011
Cited alongside, same era.
High-rate sparse superposition codes with iteratively optimal estimates
A. R. Barron and S. Cho · 2012
Cited alongside, same era.
The mutual information in random linear estimation
Jean Barbier, Mohamad Dia, Nicolas Macris, and Florent Krzakala · 2016
Later among the works it cites.
Information-theoretic thresholds for community detection in sparse networks
Jess Banks, Cristopher Moore, Joe Neeman, and Praneeth Netrapalli · 2016
Later among the works it cites.
Statistical limits of spiked tensor models
Amelia Perry, Alexander S. Wein, and Afonso S. Bandeira · 2016
Later among the works it cites.
The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact
Galen Reeves and Henry D. Pfister · 2016
Later among the works it cites.
Finite size corrections and likelihood ratio fluctuations in the spiked Wigner model
Ahmed El Alaoui, Florent Krzakala, and Michael I Jordan · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Least sqaures superposition codes of moderate dictionarysize are reliable at rates up to capacity
Antony Joseph and Andrew R. Barron · 2012
Cited alongside, same era.
The sampling rate-distortion tradeoff for sparsity pattern recovery in compressed sensing
Galen Reeves and Michael Gastpar · 2012
Cited alongside, same era.
Concentration inequalities: A nonasymptotic theory of independence
S. Boucheron, G. Lugosi, and P. Massart · 2013
Cited alongside, same era.
Approximate sparsity pattern recovery: Information-theoretic lower bounds
Galen Reeves and Michael Gastpar · 2013
Cited alongside, same era.
High-dimensional regression with random design, including sparse superposition codes
S. Cho · 2014
Cited alongside, same era.
Fast sparse superposition codes have near exponential error probability for r ¡ c,
A. Joseph and A. R. Barron · 2014
Cited alongside, same era.
Later among the works it cites.
High dimensional linear regression with binary coefficients: Mean squared error and a phase transition
David Gamarnik and Ilias Zadik · 2017
Later among the works it cites.
Sparse high dimensional linear regression: Algorithmic barrier and a local search algorithm
David Gamarnik and Ilias Zadik · 2017
Later among the works it cites.
Reed–muller codes achieve capacity on erasure channels
Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D Pfister, Eren Şaşoǧlu, and Rüdiger L Urbanke · 2017
Later among the works it cites.
Conditional central limit theorems for Gaussian projections
Galen Reeves · 2017
Later among the works it cites.
Capacity-achieving sparse superposition codes via approximate message passing decoding
C. Rush, A. Greig, and R. Venkataramanan · 2017
Later among the works it cites.
Limits on support recovery with probabilistic models: An information-theoretic framework
Jonathan Scarlett and Volkan Cevher · 2017
Later among the works it cites.
Information-theoretic bounds and phase transitions in clustering, sparse pca, and submatrix localization
J. Banks, C. Moore, R. Vershynin, N. Verzelen, and J. Xu · 2018
Later among the works it cites.
High dimensional linear regression using lattice basis reduction
David Gamarnik and Ilias Zadik · 2018
Later among the works it cites.
Optimal variable selection and adaptive noisy compressed sensing
Mohamed Ndaoud and Alexandre B Tsybakov · 2018
Later among the works it cites.