Logistic regression: from art to science

DOI10.1214/16-STS602zbMath1442.62166OpenAlexW2751275235MaRDI QIDQ1750250

Angela King, Dimitris J. Bertsimas

Publication date: 18 May 2018

Published in: Statistical Science (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ss/1504253122

zbMATH Keywords

logistic regressioncomputational statisticsmixed integer linear optimization (MILO)mixed integer nonlinear optimization (MINLO)

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Generalized linear models (logistic models) (62J12)

Related Items

Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor ⋮ A penalty decomposition approach for multi-objective cardinality-constrained optimization problems ⋮ MIP-BOOST: Efficient and Effective L₀ Feature Selection for Linear Regression ⋮ Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines ⋮ Business analytics in service operations—Lessons from healthcare operations ⋮ Sparse convex optimization toolkit: a mixed-integer framework ⋮ Best subset selection via cross-validation criterion ⋮ LRBmat: a novel gut microbial interaction and individual heterogeneity inference method for colorectal cancer ⋮ Distributed primal outer approximation algorithm for sparse convex programming with separable structures ⋮ Mixed-integer quadratic programming reformulations of multi-task learning models ⋮ Fast and approximate exhaustive variable selection for generalised linear models with APES ⋮ Unnamed Item ⋮ Sparse regression: scalable algorithms and empirical performance ⋮ A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al. ⋮ Logistic regression: from art to science ⋮ Optimal classification trees ⋮ An effective procedure for feature subset selection in logistic regression based on information criteria ⋮ A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems ⋮ Sparse classification: a scalable discrete optimization perspective ⋮ Investigating consumers' store-choice behavior via hierarchical variable selection ⋮ Unnamed Item

Uses Software

• UCI-ml
• CPLEX
• Gurobi
• GLPK
• MINLP
• glmnet
• aplore3
• NEOS
• Julia
• covTest
• dobson

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Adaptive Lasso and Its Oracle Properties
• Best subset selection via a modern optimization lens
• Feature subset selection for logistic regression via mixed integer optimization
• Valid post-selection inference
• Local replicator dynamics: a simple link between deterministic and stochastic models of evolutionary game theory
• Implementing the Bianco and Yohai estimator for logistic regression
• The composite absolute penalties family for grouped and hierarchical variable selection
• Logistic regression diagnostics
• Bootstrap methods: another look at the jackknife
• Logistic regression: from art to science
• A significance test for the lasso
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Julia: A Fresh Approach to Numerical Computing
• Theory and Applications of Robust Optimization
• Best Subsets Logistic Regression
• Computing in Operations Research Using Julia
• The Group Lasso for Logistic Regression
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Regressions by Leaps and Bounds
• 10.1162/15324430152748236
• Applied Logistic Regression
• Model Selection and Estimation in Regression with Grouped Variables
• Robust Statistics
• Transformation of the Independent Variables