The Impact of Regularization on High-dimensional Logistic Regression
Fariborz Salehi Affiliation: Department of Electrical Engineering California Institute of Technology Pasadena, CA 91125 Ehsan Abbasi Affiliation: Department of Electrical Engineering California Institute of Technology Pasadena, CA 91125 Babak Hassibi Affiliation: Department of Electrical Engineering California Institute of Technology Pasadena, CA 91125
Abstract
Logistic regression is commonly used for modeling dichotomous outcomes. In the classical setting, where the number of observations is much larger than the number of parameters, properties of the maximum likelihood estimator in logistic regression are well understood. Recently, Sur and Candes [27] have studied logistic regression in the high-dimensional regime, where the number of observations and parameters are comparable, and show, among other things, that the maximum likelihood estimator is biased. In the high-dimensional regime the underlying parameter vector is often structured (sparse, block-sparse, finite-alphabet, etc.) and so in this paper we study regularized logistic regression (RLR), where a convex regularizer that encourages the desired structure is added to the negative of the log-likelihood function. An advantage of RLR is that it allows parameter recovery even for instances where the (unconstrained) maximum likelihood estimate does not exist. We provide a precise analysis of the performance of RLR via the solution of a system of six nonlinear equations, through which any performance metric of interest (mean, mean-squared error, probability of support recovery, etc.)
原文 arXiv:1906.03761;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1906.03761v4