p-Generalized Probit Regression and Scalable Maximum Likelihood Estimation via Sketching and Coresets
Not on the map. Why?
Abstract (arXiv)
We study the p-generalized probit regression model, which is a generalized linear model for binary responses. It extends the standard probit model by replacing its link function, the standard normal cdf, by a p-generalized normal distribution for p∈[1, ∞). The p-generalized normal distributions citepSub23 are of special interest in statistical modeling because they fit much more flexibly to data. Their tail behavior can be controlled by choice of the parameter p, which influences the model's sensitivity to outliers. Special cases include the Laplace, the Gaussian, and the uniform distributions. We further show how the maximum likelihood estimator for p-generalized probit regression can be approximated efficiently up to a factor of (1+varepsilon) on large data by combining sketching techniques with importance subsampling to obtain a small data summary called coreset.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 12 of its 58 references that are in the map. First posted on arXiv 25 Mar 2022.
Builds on
12 of 58 references.
References · 12
- 2014Sketching as a Tool for Numerical Linear Algebracited by 285
- 2018Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clusteringcited by 94
- 2016Coresets for Scalable Bayesian Logistic Regressioncited by 79
- 2018On Coresets for Logistic Regressioncited by 65
- 2016Coresets and Sketchescited by 63
- 2020Coresets for Near-Convex Functionscited by 38
- 2016New Frameworks for Offline and Streaming Coreset Constructionscited by 37
- 2021Coresets for Classification -- Simplified and Strengthenedcited by 28
- 2021Oblivious sketching for logistic regressioncited by 18
- 2016Online Row Samplingcited by 15
- 2020Streaming Coresets for Symmetric Tensor Factorizationcited by 9
- 2013Tight Lower Bound for Linear Sketches of Momentscited by 2
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 5; 2025: 1; 2026: 1.
11 papers.
- 2022Online Lewis Weight Samplingcited by 15
- 2023Almost Linear Constant-Factor Sketching for ℓ1 and Logistic Regressioncited by 8
- 2023Optimal Sketching Bounds for Sparse Linear Regressioncited by 6
- 2024Scalable Learning of Item Response Theory Modelscited by 6
- 2024Optimal bounds for ℓp sensitivity sampling via ℓ2 augmentationcited by 3
- 2024Turnstile ℓp leverage score sampling with applicationscited by 3
- 2024Ridge Leverage Score Sampling for ℓp Subspace Approximationcited by 2
- 2025Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curvescited by 2
- 2024Data subsampling for Poisson regression with pth-root-linkcited by 1
- 2023Sharper Bounds for ℓp Sensitivity Samplingcited by 0
- 2026Scalable Learning of Multivariate Distributions via Coresetscited by 0
- 2026Scalable Learning of Multivariate Distributions via Coresets20 Mar 2026
- 2025Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves29 May 2025
- 2024Data subsampling for Poisson regression with pth-root-link30 Oct 2024
- 2024Ridge Leverage Score Sampling for ℓp Subspace Approximation3 Jul 2024
- 2024Turnstile ℓp leverage score sampling with applications1 Jun 2024
- 2024Optimal bounds for ℓp sensitivity sampling via ℓ2 augmentation1 Jun 2024
- 2024Scalable Learning of Item Response Theory Models1 Mar 2024
- 2023Sharper Bounds for ℓp Sensitivity Sampling1 Jun 2023
- 2023Optimal Sketching Bounds for Sparse Linear Regression5 Apr 2023
- 2023Almost Linear Constant-Factor Sketching for ℓ1 and Logistic Regression31 Mar 2023
- 2022Online Lewis Weight Sampling17 Jul 2022