AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Linear and Kernel Classification in the Streaming Model: Improved Bounds for Heavy Hitters

Arvind V. Mahankali, David Woodruff

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Learning halfspaces under noise · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
keep only the top K=400 weights instead of the full weight vector (ablation)online logistic regression classifier · RCV1 test halfaccuracy: 95.7% -> 93.9%Hurt
Algorithm 2 (JL point query) instead of WM-Sketch, 16 KB, K=120l2 point query sketch · RCV1, lambda=1e-5relative error of top-weight recovery: roughly 15% improvementImproved
WM-Sketch instead of Algorithm 1 at 16 KB, K=120l2 point query sketch · RCV1, lambda=1e-5relative error of top-weight recoveryImproved
Algorithm 1 instead of WM-Sketch at small memory (2 KB and 4 KB)l2 point query sketch · RCV1, lambda=1e-5relative error of top-weight recoveryImproved
increase memory budget (JL/point query sketch vs WM-Sketch)combined JL/point query sketch · RCV1weight estimation errorImproved

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