The Lasso minimizes
Its Karush-Kuhn-Tucker conditions are
Since the columns of are centered, . Taking the inner product of the KKT equation with and using
gives
Put . On ,
Using and
in the basic inequality yields
In particular lies in the Lasso cone condition.
The assumed restricted eigenvalue condition and give
Canceling one prediction-norm factor and applying the restricted eigenvalue condition again gives
Choose
Every null coordinate satisfies . For ,
Thus on .
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 .
Slow-rate prediction bound for the Lasso Created 2026-10-05 Updated 2026-10-06
For , the Lasso objective has this prediction bound whenever . Compare its value at and , apply Holder inequality to the score, and use the triangle inequality. No restricted eigenvalue condition is required.