The Group Lasso for Logistic Regression

Summary The group lasso is an extension of the lasso to do variable selection on (predefined) groups of variables in linear regression models. The estimates have the attractive property of being invariant under groupwise orthogonal reparameterizations. We extend the group lasso to logistic regression models and present an efficient algorithm, that is especially suitable for high dimensional problems, which can also be applied to generalized linear models to solve the corresponding convex optimization problem. The group lasso estimator for logistic regression is shown to be statistically consistent even if the number of predictors is much larger than sample size but with sparse true underlying structure. We further use a two-stage procedure which aims for sparser models than the group lasso, leading to improved prediction performance for some cases. Moreover, owing to the two-stage nature, the estimates can be constructed to be hierarchical. The methods are used on simulated and real data sets about splice site detection in DNA sequences.

Regression Shrinkage andSelection Via the LassoRegression Shrinkage and Selection Via the LassoTHE LASSO METHOD FORVARIABLE SELECTION IN…THE LASSO METHOD FOR VARIABLE SELECTION IN THE COX MODELA new approach tovariable selection in…A new approach to variable selection in least squares problemsA simple and efficientalgorithm for gene…A simple and efficient algorithm for gene selection using sparse logistic regressionLeast angle regressionLeast angle regressionModel Selection andEstimation in Regressio…Model Selection and Estimation in Regression with Grouped VariablesSparse MultinomialLogistic Regression…Sparse Multinomial Logistic Regression: Fast Algorithms and Generalization BoundsL1-Regularization PathAlgorithm for…L1-Regularization Path Algorithm for Generalized Linear ModelsLarge-Scale BayesianLogistic Regression for…Large-Scale Bayesian Logistic Regression for Text CategorizationA coordinate gradientdescent method for…A coordinate gradient descent method for nonsmooth separable minimizationHigh-dimensionalgeneralized linear…High-dimensional generalized linear models and the lassoRegularization Paths forGeneralized Linear…Regularization Paths for Generalized Linear Models via Coordinate Descent.Sure IndependenceScreening for Ultrahigh…Sure Independence Screening for Ultrahigh Dimensional Feature SpaceSparse reconstruction byseparable approximationSparse reconstruction by separable approximationGene selection andprediction for cancer…Gene selection and prediction for cancer classification using support vector machines with a reject optionSimultaneous multipleresponse regression and…Simultaneous multiple response regression and inverse covariance matrix estimation via penalized Gaussian maximum likelihoodVariable selection forsparse…Variable selection for sparse Dirichlet-multinomial regression with an application to microbiome data analysisOn asymptoticallyoptimal confidence…On asymptotically optimal confidence regions and tests for high-dimensional modelsUsing Lasso forPredictor Selection and…Using Lasso for Predictor Selection and to Assuage Overfitting: A Method Long Overlooked in Behavioral SciencesQuantile regression withgroup lasso for…Quantile regression with group lasso for classificationGroup-sparse regressionusing the covariance…Group-sparse regression using the covariance fitting criterionPathwise CoordinateOptimization for Sparse…Pathwise Coordinate Optimization for Sparse Learning: Algorithm and TheoryThe Bayesian adaptivelasso regressionThe Bayesian adaptive lasso regressionGroup PenalizedMultinomial Logit Model…Group Penalized Multinomial Logit Models and Stock Return Direction PredictionThe Group Lasso forLogistic RegressionThe Group Lasso for Logistic Regression過去の参考文献中心の論文この論文を引用する論文古い新しい

ノードをクリックするとフォーカスを固定、空白をクリックすると本論文に戻ります。ホバーで一時的にプレビューできます。各ノードのページはタイトルから開けます。