AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

On Coresets for Logistic Regression

NeurIPS 2018 · Learning theory and algorithms › Sample complexity · approach: Coresets and sublinear estimation · 20 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
sample by sqrt l2 leverage scores mixed with uniform instead of uniform samplingcoreset sampling for logistic regression · WEBB SPAM, COVERTYPE, KDD CUP '99mean relative log-likelihood errorHelped
QR sampling instead of k-means sensitivity samplingcoreset sampling for logistic regression · WEBB SPAM, COVERTYPE, KDD CUP '99mean relative log-likelihood errorHelped
QR sampling versus competitors at fixed time budget, large-error regimecoreset sampling for logistic regression · WEBB SPAM, COVERTYPEerror vs running time: QR better by a factor between 1.5-3 at larger budgetsMixed
QR sampling on KDD CUP '99 (high mu)coreset sampling for logistic regression · KDD CUP '99mean relative log-likelihood error: competitors above 15% vs QR never exceeds 22% and drops below 4%Helped
QR sampling running time versus uniform and k-meanscoreset sampling for logistic regression · all three datasetsrelative running timeNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy