atlas

Research map / Learning theory and algorithms / Sample complexity

The Limits of Learning with Missing Data

NeurIPS 2016 · Learning theory and algorithms › Sample complexity · approach: Generalization and limits under data constraints · 7 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
Restrict learner to observe at most one attribute per example (vs. two) for squared-loss Lasso/Ridge regressionLinear regression with squared loss (Lasso/Ridge) · Limited attribute observation model, theoretical lower boundachievable precision (epsilon-optimality)Hurt
Restrict learner to observe at most d-1 attributes per example (vs. all d) for absolute-loss regressionLinear regression with absolute loss · Limited attribute observation model, theoretical lower bound with d >= 4achievable precision (epsilon-optimality)Hurt
Restrict learner to observe at most d-1 attributes per example for hinge-loss classification (SVM)Soft-margin SVM (hinge loss) · Limited attribute observation model, theoretical lower boundachievable precision (epsilon-optimality)Hurt
Use general algorithm (Algorithm 1) observing k attributes per example, with m = d/(d-k) samplesRegression/classification with missing attributes · Theoretical upper boundexpected excess lossNo 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