Complexity of Lasso with Normalized Data, Geometry and Combinatorics

Vladimir Dragović, Borislav Gajić

We observe and prove that the complexity of lasso for normalized data is smaller than for nonnormalized ones by relating this question to extremal combinatorics and algebraic graph…