AI Paper Atlas

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

Information theoretic limits of learning a sparse rule

Clément Luneau, jean barbier, Nicolas Macris

NeurIPS 2020 · Learning theory and algorithms › Kernels and regression theory · approach: High-dimensional asymptotic generalization

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
use ReLU instead of linear activation at small noise variancesparse generalized linear model · Delta in [0,0.5]gamma_c (samples needed)Improved
use ReLU instead of linear activation at large noise variancesparse generalized linear model · large Deltagamma_c (samples needed): a ≈ 5.87 vs 2Hurt
make sparsity and sampling rate vanishing instead of linearasymptotic MMSE · Bernoulli and Bernoulli-Rademacher priorsMMSEImproved
use GAMP algorithm instead of the Bayes-optimal estimatorsparse linear-sparsity regime · linear sparsity and sampling rateMSE thresholdHurt

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