Abstract
As it was pointed out in the Introduction, many important sparse recovery methods 3 are based on empirical risk minimization with convex loss and convex complexity 4 penalty. Some interesting algorithms, for instance, the Dantzig selector by Candes 5 and Tao [44] can be formulated as linear programs. In this chapter, we develop 6 error bounds for such algorithms that require certain geometric assumptions on 7 the dictionary. They are expressed in terms of restricted isometry constants and 8 other related characteristics that depend both on the dictionary and on the design 9 distribution. Based on these geometric characteristics, we describe the conditions of 10 exact sparse recovery in the noiseless case as well as sparsity oracle inequalities for 11 the Dantzig selector in regression problems with random noise. These results rely 12 on comparison inequalities and exponential bounds for empirical and Rademacher 13 processes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Koltchinskii, V. (2011). Linear Programming in Sparse Recovery. In: Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems. Lecture Notes in Mathematics(), vol 2033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22147-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-22147-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22146-0
Online ISBN: 978-3-642-22147-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)