The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Optimal Subsampling for Large Sample Logistic Regression
Open accessAbstract
For massive data, the family of subsampling algorithms is popular to downsize the data volume and reduce computational burden. Existing studies focus on approximating the ordinary least squares estimate in linear regression, where statistical leverage scores are often used to define subsampling probabilities. In this paper, we propose fast subsampling algorithms to efficiently approximate the maximum likelihood estimate in logistic regression. We first establish consistency and asymptotic normality of the estimator from a general subsampling algorithm, and then derive optimal subsampling probabilities that minimize the asymptotic mean squared error of the resultant estimator. An alternative minimization criterion is also proposed to further reduce the computational cost. The optimal subsampling probabilities depend on the full data estimate, so we develop a two-step algorithm to approximate the optimal subsampling procedure. This algorithm is computationally efficient and has a significant reduction in computing time compared to the full data approach. Consistency and asymptotic normality of the estimator from a two-step algorithm are also established. Synthetic and real data sets are used to evaluate the practical performance of the proposed method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
Bootstrap methods: another look at the jackknife
Efron, B. (1979) · The Annals of Statistics · doi:10.1214/aos/1176344552 · Cited by 17,602
Hosmer, D. W., Lemeshow, S., & Sturdivant, R. X. (2013) · Wiley Series in Probability and Statistics · doi:10.1002/9781118548387 · Cited by 13,861
Logistic Regression in Rare Events Data
King, G., & Zeng, L. (2001) · Political Analysis · doi:10.1093/oxfordjournals.pan.a004868 · Cited by 4,316 · cited 3×
“From (S.14) and (S.15), by the Lindeberg-Feller central limit theorem (Proposition 2.27 of van der Vaart, 1998), conditionally on F n ,”
BackgroundMethodInfluentialOptimum Experimental Designs, with SAS
Atkinson, A. C., Donev, A. N., & Tobias, R. D. (2007) · doi:10.1093/oso/9780199296590.001.0001 · Cited by 1,244
Searching for exotic particles in high-energy physics with deep learning
Baldi, P., Sadowski, P., & Whiteson, D. (2014) · Nature Communications · doi:10.1038/ncomms5308 · Cited by 1,164
Kiefer, J. (1959) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1959.tb00338.x · Cited by 790
CUR matrix decompositions for improved data analysis
Mahoney, M. W., & Drineas, P. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0803205106 · Cited by 773
Faster least squares approximation
Petros Drineas, B., Mahoney, M. W., Muthukrishnan, S., & Sarlós, T. (2010) · Numerische Mathematik · doi:10.1007/s00211-010-0331-6 · Cited by 429
Fitting Logistic Models Under Case-Control or Choice Based Sampling
Scott, A. J., & Wild, C. J. (1986) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1986.tb01400.x · Cited by 211
Metadata
- Authors
- Wang, H., Zhu, R., & Ma, P.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 2018-04-03
- Volume
- 113
- Issue
- 522
- Pages
- 829-844
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W2596535828
- Cited by
- 272
- References
- 14
- FWCI
- 4.71
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal Subsampling for Large Sample Logistic Regression. https://app.cochat.ai/papers/10.1080/01621459.2017.1292914
- The paper
- Wang, H., Zhu, R., & Ma, P. (2018). Optimal Subsampling for Large Sample Logistic Regression. Journal of the American Statistical Association. https://doi.org/10.1080/01621459.2017.1292914
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.