atlas

Research map / Learning theory and algorithms / Sample complexity

Approximation and non-parametric estimation of ResNet-type convolutional neural networks

ICML 2019 · Learning theory and algorithms › Sample complexity · approach: Statistical analysis of GAN estimators · 28 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
Realize a block-sparse FNN with M blocks by a ResNet-type CNN with constant width/channels and O(M) additional parametersResNet-type CNN (general block-sparse FNN approximation) · general function classes realizable by block-sparse FNNsapproximation rateNo clear effect
Use dense, constant-width ResNet-type CNN (fixed channel size and filter size) trained by clipped ERM instead of sparse optimal networksbeta-Holder regression · beta-Holder classestimation error rateHelped
Introduce scaling of identity mappings via channel masks (masked CNN) so residual block depth is constantbeta-Holder ResNet-type CNN · beta-Holder classapproximation/estimation rate with constant block depthNo clear effect
Rescale block-sparse FNN parameters (exploiting ReLU homogeneity) so that log of Lipschitz constant is O(1) in MBarron and beta-Holder CNN estimation · Barron (s=2) and beta-Holder classesestimation error rateHelped

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