atlas

Research map / Learning theory and algorithms / Kernels and regression theory

Random features models: a way to study the success of naive imputation

ICML 2024 · Learning theory and algorithms › Kernels and regression theory · approach: High-dimensional linear regression theory · 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.

Studies zero (naive) imputation for linear prediction under MCAR missingness using a random features model, showing its bias is negligible in both very low and high dimensions, and gives finite-sample SGD bounds.

Problem

Constant (naive) imputation is widely used despite expected large prediction bias; prior theory showed low bias only in high-dimensional linear settings under MCAR. The paper asks whether naive imputation is also competitive in low dimension, and how SGD on zero-imputed data performs.

Approach

Model inputs as random features of a latent variable (finite p, then infinite-dimensional latent space), with MCAR masks; derive exact Bayes risks for zero-imputed linear predictors as a function of input dimension d, and bound the excess risk of averaged SGD on zero-imputed data.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use zero imputation before linear prediction when ρd ≪ pLinear random features under MCAR · Low-dimensional regime (ρd ≪ p)imputation excess risk over the best predictor using missing data: Δ_imp/miss(d)≤[ρ(d-1)/(p-ρ(d-1)-2)]Δ_miss(d)No clear effect
Use zero imputation with many random featuresLinear random features under MCAR · High-dimensional regime (d ≫ p)excess risk over the complete-data Bayes risk: p/[ρd+(1-ρ)p]‖β⋆‖₂²No clear effect
Use zero imputation with an increasing number of random featuresGeneral random features under MCAR · Infinite-dimensional latent spaceBayes excess risk over R⋆(∞): λ_imp/d‖f⋆‖_ν²Helped
Use zero imputation as the number of features increasesRandom features with MNAR missingness · MNAR, d → +∞Bayes excess risk over R⋆(∞): lim_{d→ +∞} R⋆_imp(d)= R⋆(∞)Helped
Train with Polyak-Ruppert averaged SGD on zero-imputed dataLinear random features under MCAR · d<p-1excess risk over the missing-data Bayes risk: ρ(1-ρ)d(d-1)/[p(p-ρ(d-1)-2)]‖β⋆‖₂²; [d/(ρn)] [d/(p-ρ(d-1)-2)]‖β⋆‖₂² + ρd/n(σ²+‖β⋆‖₂²)Mixed
Train with Polyak-Ruppert averaged SGD on zero-imputed dataLinear random features under MCAR · d ≥ pexcess risk over R⋆(d): (1/ρ)(p/d)‖β⋆‖₂² + [p/(ρ²(1-ρ)√n)]‖β⋆‖₂² + (σ²+‖β⋆‖₂²)/√nHelped

Surprising findings

Limitations

Experimental setup

Metrics: Bayes risk excess risk bias from imputation

Baselines: pattern-by-pattern Bayes predictor Bayes risk on complete random features

Builds on: random features (Rahimi and Recht) impute-then-regress consistency results Ayme et al. zero-imputation linear model analysis averaged SGD (Bach and Moulines)

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