With the normalization used here, the Lasso estimator minimizes
Optimality at relative to the feasible point gives
The columns of are centered, so and the centered noise produces the same score function as . Expanding the two squared norms and cancelling the noise norm yields the standard Basic inequality for the Lasso
Thus the displayed inequality in the question has a factor-of-two typo: its left side should be , or both terms on its right should be doubled. No scaling of the usual squared-error Lasso objective produces the three displayed coefficients simultaneously. Parts b and d explicitly ask us to use the stated inequality, so their requested constants follow from that stated version.
Write . On , Hölder's inequality gives
Since , the triangle inequality gives
Substitution in the Basic inequality for the Lasso, followed by discarding the nonnegative prediction-error term, yields
Therefore , the Lasso cone condition.
For each column , the normalized score is
The errors are independent Rademacher random variables, and . The Hoeffding lemma therefore makes a sub-Gaussian random variable with variance proxy , so
The union bound with gives
For this becomes
In particular, if , the lower bound tends to one as .
Part b places in the Lasso cone condition. Keeping the prediction-error term in the same argument gives
where the second step is the Cauchy-Schwarz inequality. The restricted eigenvalue condition gives
for nonzero in this cone. Division by proves
The result is immediate when .

Articles by others on the same topic (0)

There are currently no matching articles.