mlsanityData to 14 Oct 2026

A modern maximum-likelihood theory for high-dimensional logistic regression

arXiv 1803.06964 ↗First posted 19 Mar 2018math.ST stat.ME stat.THcited by 81

Not on the map. Why?

Abstract (arXiv)

Every student in statistics or data science learns early on that when the sample size largely exceeds the number of variables, fitting a logistic model produces estimates that are approximately unbiased. Every student also learns that there are formulas to predict the variability of these estimates which are used for the purpose of statistical inference; for instance, to produce p-values for testing the significance of regression coefficients. Although these formulas come from large sample asymptotics, we are often told that we are on reasonably safe grounds when n is large in such a way that n ≥ 5p or n ≥ 10p. This paper shows that this is far from the case, and consequently, inferences routinely produced by common software packages are often unreliable. Consider a logistic model with independent features in which n and p become increasingly large in a fixed ratio. Then we show that (1) the MLE is biased, (2) the variability of the MLE is far greater than classically predicted, and (3) the commonly used likelihood-ratio test (LRT) is not distributed as a chi-square. The bias of the MLE is extremely problematic as it yields completely wrong predictions for the probability of a case based on observed values of the covariates. We develop a new theory, which asymptotically predicts (1) the bias of the MLE, (2) the variability of the MLE, and (3) the distribution of the LRT. We empirically also demonstrate that these predictions are extremely accurate in finite samples. Further, an appealing feature is that these novel predictions depend on the unknown sequence of regression coefficients only through a single scalar, the overall strength of the signal. This suggests very concrete procedures to adjust inference; we describe one such procedure learning a single parameter from data and producing accurate inference

Key facts. Cited by 81 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Mar 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 16; 2022: 13; 2023: 18; 2024: 16; 2025: 8; 2026: 10.

81 papers.

Sort:

By area:

  1. 2021Label-Imbalanced and Group-Sensitive Classification under Overparameterizationcited by 74
  2. 2021A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learningcited by 57
  3. 2021Benign Overfitting in Multiclass Classification: All Roads Lead to Interpolationcited by 42
  4. 2021Don't Just Blame Over-parametrization for Over-confidence: Theoretical Analysis of Calibration in Binary Classificationcited by 39
  5. 2021Uncertainty quantification in the Bradley-Terry-Luce modelcited by 29
  6. 2023Beyond Confidence: Reliable Models Should Also Consider Atypicalitycited by 25
  7. 2021Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passingcited by 18
  8. 2022Theoretical characterization of uncertainty in high-dimensional linear classificationcited by 18
  9. 2022On double-descent in uncertainty quantification in overparametrized modelscited by 16
  10. 2021Interpolation can hurt robust generalization even when there is no noisecited by 15
  11. 2023High-dimensional robust regression under heavy-tailed data: Asymptotics and Universalitycited by 15
  12. 2021PCA Initialization for Approximate Message Passing in Rotationally Invariant Modelscited by 14
38 more
  1. 2024Implicit Optimization Bias of Next-Token Prediction in Linear Modelscited by 14
  2. 2025Asymptotics of Non-Convex Generalized Linear Models in High-Dimensions: A proof of the replica formulacited by 14
  3. 2023On the sample complexity of parameter estimation in logistic regression with normal designcited by 13
  4. 2021Tractability from overparametrization: The example of the negative perceptroncited by 12
  5. 2022A Non-Asymptotic Moreau Envelope Theory for High-Dimensional Generalized Linear Modelscited by 11
  6. 2023Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approachcited by 11
  7. 2021Understanding the Under-Coverage Bias in Uncertainty Estimationcited by 10
  8. 2023Expectation consistency for calibration of neural networkscited by 10
  9. 2022The price of ignorance: how much does it cost to forget noise structure in low-rank matrix estimation?cited by 9
  10. 2023Approximate message passing from random initialization with applications to mathbbZ2 synchronizationcited by 9
  11. 2025Benefits of Early Stopping in Gradient Descent for Overparameterized Logistic Regressioncited by 9
  12. 2025Preventing Model Collapse Under Overparametrization: Optimal Mixing Ratios for Interpolation Learning and Ridge Regressioncited by 9
  13. 2021On the benefits of maximum likelihood estimation for Regression and Forecastingcited by 8
  14. 2022How many labelers do you have? A closer look at gold-standard labelscited by 8
  15. 2024No Free Prune: Information-Theoretic Barriers to Pruning at Initializationcited by 8
  16. 2023Regularized Linear Regression for Binary Classificationcited by 7
  17. 2024A High Dimensional Statistical Model for Adversarial Training: Geometry and Trade-Offscited by 7
  18. 2021Performance of Bayesian linear regression in a model with mismatchcited by 6
  19. 2023Universality of max-margin classifierscited by 6
  20. 2024Information limits and Thouless-Anderson-Palmer equations for spiked matrix models with structured noisecited by 6
  21. 2022Observable adjustments in single-index models for regularized M-estimatorscited by 5
  22. 2022Benign Overfitting in Classification: Provably Counter Label Noise with Larger Modelscited by 5
  23. 2023Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passingcited by 5
  24. 2021SLOE: A Faster Method for Statistical Inference in High-Dimensional Logistic Regressioncited by 4
  25. 2023General Loss Functions Lead to (Approximate) Interpolation in High Dimensionscited by 4
  26. 2023Least Squares Regression Can Exhibit Under-Parameterized Double Descentcited by 4
  27. 2024Analysis of Bootstrap and Subsampling in High-dimensional Regularized Regressioncited by 4
  28. 2024A replica analysis of under-baggingcited by 4
  29. 2024ROTI-GCV: Generalized Cross-Validation for right-ROTationally Invariant Datacited by 4
  30. 2024The Breakdown of Gaussian Universality in Classification of High-dimensional Linear Factor Mixturescited by 4
  31. 2024Unifying AMP Algorithms for Rotationally-Invariant Modelscited by 4
  32. 2021Estimation and Applications of Quantiles in Deep Binary Classificationcited by 3
  33. 2022Bayes-optimal limits in structured PCA, and how to reach themcited by 3
  34. 2023Mixed Regression via Approximate Message Passingcited by 3
  35. 2023Multinomial Logistic Regression: Asymptotic Normality on Null Covariates in High-Dimensionscited by 3
  36. 2023On the Variance, Admissibility, and Stability of Empirical Risk Minimizationcited by 3
  37. 2023Selective inference using randomized group lasso estimators for general modelscited by 3
  38. 2024Asymptotic generalization error of a single-layer graph convolutional networkcited by 3

50 most cited of 81 All 81 (JSON)