Put and . With objective , ridge regression givesFor the duplicated design, the objective depends on through the loss and symmetry makes the minimum-penalty decomposition equal:Duplicating a predictor therefore halves its effective ridge penalty.
The one-variable constraint is , an interval whose endpoints expand as . The duplicated constraint is the disk ; the loss contours are parallel strips perpendicular to . Their first contact with the disk lies on . Equivalently, the fitted total coefficient is the least-squares coefficient clipped to , compared with for one copy.
The two Lasso problems areandIf solves the first problem, the complete solution set of the second isIndeed, the feasible totals are exactly , the same as in the first problem.
The duplicated feasible set is the diamond . A loss contour first touches an entire line segment of the diamond whenever the optimal total has the sign of a sloping face; all points on that segment give the same fit. As passes the unconstrained optimum, the solution set becomes the intersection of the interior diamond with the line .
For prediction at covariate value , the intercept contributes variance in every case because is centered. The one-copy ridge shrinkage is , while the duplicated-design total has . ThusandSince , duplication reduces ridge bias and increases variance.
For constrained Lasso, let and . Both designs have the identical fitted total , so both haveDuplicating the predictor has no effect on Lasso predictions, despite making the coefficient vector nonunique.
Articles by others on the same topic
There are currently no matching articles.