Fetching the paper…
Reading the bibliography…
We consider a sparse linear regression model Y=X\beta^{*}+W where X has a Gaussian entries, W is the noise vector with mean zero Gaussian entries, and \beta^{*} is a binary vector with support size (sparsity) k.
Ping Zhang, Model selection via multifold cross validation , The Annals of Statistics (1993)
1993
Earlier work this paper cites.
A. Shwartz and A. Weiss, Large deviations for performance analysis , Chapman and Hall, 1995
1995
Earlier work this paper cites.
A. Hassibi and S. Boyd, Integer parameter estimation in linear models with applications to gps , IEEE Transactions on Signal Processing (1998)
1998
Earlier work this paper cites.
L. Brunel and J. Boutros, Euclidean space lattice decoding for joint detection in cdma systems. , IEEE Information Theory and Communications Workshop (1999)
1999
Earlier work this paper cites.
V.C. Chen and Hao Ling, Joint time-frequency analysis for radar signal and image processing , IEEE Transactions on Signal Processing (1999)
1999
Earlier work this paper cites.
Y. Shi X. Zhang and Z. Bao, A new feature vector using selected bispectra for signal classification with application in radar target recognition , IEEE Transactions on Signal Processing (2001)
2001
Earlier work this paper cites.
B. Hassibi and H. Vikalo, On the expected complexity of integer least-squares problems , IEEE International Conference on Acoustics, Speech, and Signal Processing. (2002)
2002
Earlier work this paper cites.
Emmanuel J Candes and Terence Tao, Decoding by linear programming , IEEE transactions on information theory 51
2005
Earlier work this paper cites.
Thomas M. Cover and Joy A. Thomas, Elements of information theory (wiley series in telecommunications and signal processing) , Wiley-Interscience, 2006
2006
Earlier work this paper cites.
David L Donoho, Compressed sensing , IEEE Transactions on information theory 52
2006
Earlier work this paper cites.
Nicolai Meinshausen and Peter Bühlmann, High-dimensional graphs and variable selection with the lasso , The Annals of Statistics (2006)
2006
Earlier work this paper cites.
Nicolai Meinshausen and Peter Bühlmann, High-dimensional graphs and variable selection with the lasso , Ann. Statist. 34
2006
Earlier work this paper cites.
Peng Zhao and Bin Yu, On model selection consistency of lasso , J. Mach. Learn. Res. 7
2006
Earlier work this paper cites.
Dimitris Achlioptas and Amin Coja-Oghlan, Algorithmic barriers from phase transitions , Foundations of Computer Science, 2008. FOCS’08 IEEE 49th Annual IEEE Symposium on, IEEE, 2008, pp. 793–802
2008
Earlier work this paper cites.
Carlos M. Carvalho, Jeffrey Chang, Joseph E. Lucas, Joseph R. Nevins, Quanli Wang, and Mike West, High-dimensional sparse factor modeling: Applications in gene expression genomics , Journal of the American Statistical Association (2008)
2008
Earlier work this paper cites.
Stefani M. dos Remedios C. G. Ho, J. W. and M. A. Charleston, Differential variability analysis of gene expression and its application to human diseases , Bioinformatics (2008)
2008
Earlier work this paper cites.
M. Lustig, D. L. Donoho, J. M. Santos, and J. M. Pauly, Compressed sensing mri , IEEE Signal Processing Magazine 25
2008
Earlier work this paper cites.
Peter J. Bickel, James B. Brown, Haiyan Huang, and Qunhua Li, An overview of recent developments in genomics and associated statistical methods , Phil. Trans. R. Soc. A (2009)
2009
Earlier work this paper cites.
Qiu X. Glazko G. Klevanov L. Hu, R. and A. Yakovlev, Detecting intergene correlation changes in microarray analysis: A new approach to gene selection , BMC Bioinformatics (2009)
2009
Cited alongside, same era.
Martin J Wainwright, Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting , Information Theory, IEEE Transactions on 55
2009
Cited alongside, same era.
David L. Donoho and Jared Tanner, Counting the faces of randomly-projected hypercubes and orthants, with applications , Discrete & Computational Geometry 43
2010
Cited alongside, same era.
Jianqing Fan and Jinchi Lv, A selective overview of variable selection in high dimensional feature space , Statistica Sinica (2010)
2010
Cited alongside, same era.
Qiu X. Hu, R. and G. Glazko, A new gene selection procedure based on the covariance distance , Bioinformatics (2010)
Richard Nickl and Sara Van De Geer, Confidence sets in sparse regression , The Annals of Statistics (2013)
2013
Later among the works it cites.
Galen Reeves and Michael Gapstar, Approximate sparsity pattern recovery: Information-theoretic lower bounds , IEEE Trans. Information Theory (2013)
2013
Later among the works it cites.
Zhao Bo, Wenmiao Lu, T. Kevin Hitchens, Fan Lam, Chien Ho, and Zhi‐Pei Liang, Accelerated mr parameter mapping with low‐rank and sparsity constraints , Magnetic Resonance in Medicine (2014)
2014
Later among the works it cites.
2014
Later among the works it cites.
Trevor Hastie, Robert Tibshirani, and Martin J. Wainwright, Statistical learning with sparsity: The lasso and generalizations , Chapman and Hall/CRC Monographs on Statistics and Applied Probability, 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
Wei Wang, Martin J Wainwright, and Kannan Ramchandran, Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices , IEEE Transactions on Information Theory 56
2010
Cited alongside, same era.
D. Achlioptas, A. Coja-Oghlan, and F. Ricci-Tersenghi, On the solution space geometry of random formulas , Random Structures and Algorithms 38
2011
Cited alongside, same era.
Mohsen Bayati and Andrea Montanari, The dynamics of message passing on dense graphs, with applications to compressed sensing , IEEE Transactions on Information Theory 57
2011
Cited alongside, same era.
A. Coja-Oghlan and C. Efthymiou, On independent sets in random graphs , Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2011, pp. 136–144
2011
Cited alongside, same era.
Emmanuel J. Cand‘es Ery Arias-Castro and Yaniv Plan, Global testing under sparse alternatives: Anova, multiple comparisons and the higher criticism , The Annals of Statistics (2011)
2011
Cited alongside, same era.
Andrea Montanari, Ricardo Restrepo, and Prasad Tetali, Reconstruction and clustering in random constraint satisfaction problems , SIAM Journal on Discrete Mathematics 25
2011
Cited alongside, same era.
Guillaumem Obozinski, Martin J. Wainwright, and Michael I. Jordan, Support union recovery in high-dimensional multivariate regression , The Annals of Statistics (2011)
2011
Cited alongside, same era.
2015
Later among the works it cites.
Jonathan Scarlett and Volkan Cevher, Limits on support recovery with probabilistic models: An information-theoretic framework , IEEE International Symposium on Information Theory (ISIT) (2015)
2015
Later among the works it cites.
2016
Later among the works it cites.
Bao Peng, Zhi Zhao, Guangjie Han, and Jian Shen, Consensus-based sparse signal reconstruction algorithm for wireless sensor networks , International Journal of Distributed Sensor Networks (2016)
2016
Later among the works it cites.
Jess Banks, Christopher Moore, Nicolas Verzelen, Roman Vershynin, and Jiaming Xu, Information-theoretic bounds and phase transitions in clustering, sparse pca, and submatrix localization , IEEE Trans. Inf. Theory, vol. 67, no. 7, pp. 4872-4894 (July 2017)
2017
Closest in time.
2017
Closest in time.
J. Dudczyk, A method of feature selection in the aspect of specific identification of radar signals , Bulletin of the Polish Academic of Sciences, Technical Sciences (2017)
2017
Closest in time.
Lucas Janson, Rina Foygel Barber, and Emmanuel Candès, Eigenprism: inference for high dimensional signal-to-noise ratios , Journal of the Royal Statistical Society. Series B (2017)
2017
Closest in time.
Paul Balister, Bela Bollobas, Julian Sahasrabudhe, and Alexander Veremyev, Dense subgraphs in random graphs , arXiv (2018)
2018
Closest in time.
T. Tony Cai and Zijian Gao, Accuracy assessment for high-dimensional linear regression1 , The Annals of Statistics (2018)
2018
Closest in time.
David Gamarnik and Ilias Zadik, High dimensional linear regression using lattice basis reduction , Neural Information Processing Systems (NeurIPS), 2018
2018
Closest in time.
Christos Thrampoulidis, Ilias Zadik, and Yury Polyanskyi, A simple bound on the ber of the map decoder for massive mimo systems , IEEE International Conference on Acoustics, Speech, and Signal Processing. (2019)
2019
Closest in time.
Ilias Zadik, Christos Thrampoulidis, and Yury Polyanskyi, Improved bounds on gaussian mac and sparse regression via gaussian inequalities , IEEE International Symposium on Information Theory (ISIT) (2019)
2019
Closest in time.