mlsanityData to 7 Oct 2026

Feature Space Sketching for Logistic Regression

arXiv 2303.14284 ↗First posted 24 Mar 2023cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

We present novel bounds for coreset construction, feature selection, and dimensionality reduction for logistic regression. All three approaches can be thought of as sketching the logistic regression inputs. On the coreset construction front, we resolve open problems from prior work and present novel bounds for the complexity of coreset construction methods. On the feature selection and dimensionality reduction front, we initiate the study of forward error bounds for logistic regression. Our bounds are tight up to constant factors and our forward error bounds can be extended to Generalized Linear Models.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 12 of its 41 references that are in the map. First posted on arXiv 24 Mar 2023.

Builds on

12 of 41 references.

References · 12

  1. 2014Sketching as a Tool for Numerical Linear Algebracited by 285
  2. 2013Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optimacited by 66
  3. 2018On Coresets for Logistic Regressioncited by 65
  4. 2016Restricted Strong Convexity Implies Weak Submodularitycited by 51
  5. 2020Determinantal Point Processes in Randomized Numerical Linear Algebracited by 41
  6. 2014Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squarescited by 34
  7. 2021Coresets for Classification -- Simplified and Strengthenedcited by 28
  8. 2014Randomized Sketches of Convex Programs with Sharp Guaranteescited by 25
  9. 2017Lectures on Randomized Numerical Linear Algebracited by 19
  10. 2021Oblivious sketching for logistic regressioncited by 18
  11. 2019Tight Bounds for the Subspace Sketch Problem with Applicationscited by 6
  12. 2017Subsampling for Ridge Regression via Regularized Volume Samplingcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 0; 2026: 1.

4 papers.