A compatibility condition lower-bounds prediction norm by a scaled norm on a Lasso cone condition. One convention requires throughout the cone.
Let , and . On the score event with , the prediction inequality from Lasso stationarity gives . If the Compatibility condition for the Lasso with constant holds on this cone, then . Here and is the true support of a vector.
With objective , the Gaussian score event for the Lasso gives , where . The Lasso cone condition activates the Compatibility condition for the Lasso. Then . Thus even . This controls prediction and coefficient error together, including a design with correlated columns.
The fast-rate Lasso prediction bound under compatibility implies . Each true coefficient larger in absolute value than this bound has the correct estimated sign. This conclusion alone does not ensure absence of false positives.
For a positive-semidefinite matrix , an active set of size , and cone factor three, one compatibility constant is defined byIt measures how strongly the quadratic form controls active-coordinate error on the Lasso cone condition.
Suppose every in the Lasso cone condition satisfies . On the usual score event, the Karush-Kuhn-Tucker conditions give . Hence every active-coordinate error is at most , and a larger minimum nonzero signal guarantees coordinatewise sign recovery.
Articles by others on the same topic
There are currently no matching articles.