Chunk #31 — 3 Regularized Logistic Regression
Text
Our approach is similar. For each value of λ, we create an outer loop which computes the quadratic approximation ℓQ about the current parameters (β̃0, β̃). Then we use coordinate descent to solve the penalized weighted least-squares problem (18)min(β0,β)∈ℝp+1{−ℓQ(β0,β)+λPα(β)}.