atlas

Research map / Learning theory and algorithms / Sample complexity

Minimax-Optimal Univariate Function Selection in Sparse Additive Models: Rates, Adaptation, and the Estimation-Selection Gap

NeurIPS 2025 · Learning theory and algorithms › Sample complexity · approach: Minimax estimation rates · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

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

Establishes minimax separation rates for univariate function selection in sparse additive models, covering FDR/FNR control and support recovery, and studies adaptation and an estimation-selection gap.

Problem

Variable (univariate function) selection in sparse additive models (SpAM) in high-dimensional settings, where the goal is to identify which component functions are non-zero.

Approach

Derives minimax separation rates for univariate function selection in SpAM from two perspectives, sparse multiple testing (FDR and FNR control) and support recovery (wrong recovery probability), and characterizes a gap between estimation and selection difficulty.

Surprising findings

Experimental setup

Metrics: FDR FNR wrong recovery probability

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