atlas

Research map / Learning theory and algorithms / Sample complexity

Data subsampling for Poisson regression with pth-root-link

NeurIPS 2024 · Learning theory and algorithms › Sample complexity · approach: Learning under log-concave distributions · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Derives coreset bounds for Poisson regression with ID- and square-root link via a novel balancing complexity parameter rho and domain shifting, showing Omega(n) lower bounds for coresets and sublinear coresets when rho is small.

Problem

Data subsampling (coresets) with (1±ε) guarantees for Poisson regression with pth-root links (ID and square-root), where classical sensitivity-based coresets fail due to the negative-log asymptote and the loss' translation with y.

Approach

Introduces a balancing complexity parameter rho bounding the ratio of sum |x_j beta|^p to sum |x_j beta - y_j^{1/p}|^p, and a domain-shifting approach restricting solutions to x_i beta > eta so sensitivity sampling yields sublinear coresets with (1+eps) guarantees; also a tight sqrt bound on Lambert W_0 for lower bounds.

Key results

Surprising findings

Limitations

Experimental setup

Metrics: approximation factor (1±ε) coreset size

Builds on: sensitivity framework well-conditioned basis l_p regression coresets

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