atlas

Research map / Learning theory and algorithms / Sample complexity

L1-regularized Neural Networks are Improperly Learnable in Polynomial Time

ICML 2016 · Learning theory and algorithms › Sample complexity · approach: Neural network approximation theory · 61 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
increase depth from k=1 to k=4 in the recursive kernel method (ablation)recursive kernel method · MNIST basic and variationsclassification error rate: small gains on all four datasets (e.g., Basic 3.31% to 3.08%)Helped
use recursive kernel method instead of multilayer perceptronMNIST variations · MNIST Basic, Rotation, Background, Background+Rotationclassification error rate: consistently lower error than MLP on all four datasetsHelped
use recursive kernel method instead of LeNet5 convolutional networkMNIST variations · MNIST Background and Background+Rotationclassification error rate: 22.13% vs 9.35% on Background; 52.94% vs 32.36% on Background+RotationHurt
recursive kernel method (k=4) vs LeNet5 on rotated digitsMNIST Rotation · MNIST Rotationclassification error rate: 8.78% vs 9.27%, best of all methods on RotationMixed

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