Skip to yearly menu bar Skip to main content


Poster

Generalized Linear Model Regression under Distance-to-set Penalties

Jason Xu · Eric Chi · Kenneth Lange

Pacific Ballroom #38

Keywords: [ Optimization ] [ Regression ]


Abstract:

Estimation in generalized linear models (GLM) is complicated by the presence of constraints. One can handle constraints by maximizing a penalized log-likelihood. Penalties such as the lasso are effective in high dimensions but often lead to severe shrinkage. This paper explores instead penalizing the squared distance to constraint sets. Distance penalties are more flexible than algebraic and regularization penalties, and avoid the drawback of shrinkage. To optimize distance penalized objectives, we make use of the majorization-minimization principle. Resulting algorithms constructed within this framework are amenable to acceleration and come with global convergence guarantees. Applications to shape constraints, sparse regression, and rank-restricted matrix regression on synthetic and real data showcase the strong empirical performance of distance penalization, even under non-convex constraints.

Live content is unavailable. Log in and register to view live content