Estimation Under Model-Based Sparsity

作者: Sohail Bahmani

DOI: 10.1007/978-3-319-01881-2_5

关键词:

摘要: Beyond the ordinary, extensively studied, plain sparsity model, a variety of structured models have been proposed in literature Bach (2008); Roth and Fischer Jacob et al. (2009); Baraniuk (2010); (2012); Chandrasekaran Kyrillidis Cevher (2012a). These are designed to capture interdependence locations non-zero components that is known priori certain applications. For instance, wavelet transform natural images often (nearly) sparse dependence among dominant coefficients can be represented by rooted connected tree. Furthermore, applications such as array processing or sensor networks, while different sensors may take measurements, support set observed signal identical across sensors. Therefore, model this property system, we compose an enlarged with jointly-sparse block-sparse set, whose occur contiguous blocks.

参考文章(18)
Volkan Cevher, Anastasios Kyrillidis, Sublinear time, approximate model-based sparse recovery for all arXiv: Information Theory. ,(2012)
Laurent Jacob, Guillaume Obozinski, Jean-Philippe Vert, Group lasso with overlap and graph lasso Proceedings of the 26th Annual International Conference on Machine Learning - ICML '09. pp. 433- 440 ,(2009) , 10.1145/1553374.1553431
Anastasios Kyrillidis, Volkan Cevher, Combinatorial selection and least absolute shrinkage via the Clash algorithm international symposium on information theory. pp. 2216- 2220 ,(2012) , 10.1109/ISIT.2012.6283847
Volker Roth, Bernd Fischer, The Group-Lasso for generalized linear models Proceedings of the 25th international conference on Machine learning - ICML '08. pp. 848- 855 ,(2008) , 10.1145/1390156.1390263
Marco F. Duarte, Yonina C. Eldar, Structured Compressed Sensing: From Theory to Applications IEEE Transactions on Signal Processing. ,vol. 59, pp. 4053- 4085 ,(2011) , 10.1109/TSP.2011.2161982
Daniel Hsu, Sham Kakade, Tong Zhang, A tail inequality for quadratic forms of subgaussian random vectors Electronic Communications in Probability. ,vol. 17, pp. 1- 6 ,(2012) , 10.1214/ECP.V17-2079
Joel A. Tropp, User-Friendly Tail Bounds for Sums of Random Matrices Foundations of Computational Mathematics. ,vol. 12, pp. 389- 434 ,(2012) , 10.1007/S10208-011-9099-Z
Francis R. Bach, Consistency of the Group Lasso and Multiple Kernel Learning Journal of Machine Learning Research. ,vol. 9, pp. 1179- 1225 ,(2008) , 10.5555/1390681.1390721
Rodolphe Jenatton, Jean-Yves Audibert, Francis Bach, Structured Variable Selection with Sparsity-Inducing Norms Journal of Machine Learning Research. ,vol. 12, pp. 2777- 2824 ,(2011)
Richard G. Baraniuk, Volkan Cevher, Marco F. Duarte, Chinmay Hegde, Model-Based Compressive Sensing IEEE Transactions on Information Theory. ,vol. 56, pp. 1982- 2001 ,(2010) , 10.1109/TIT.2010.2040894