atlas

Research map / Learning theory and algorithms / Sample complexity

Besov Function Approximation and Binary Classification on Low-Dimensional Manifolds Using Convolutional Residual Networks

ICML 2021 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 4 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
Design the ConvResNet to exploit the data’s intrinsic manifold dimensionConvResNet approximation of Besov functions · Besov functions on a d-dimensional manifoldNetwork size scaling with approximation accuracy: M=O\left(\varepsilon^{-d/s}\right)Helped
Use a properly chosen ConvResNet and empirical logistic risk minimizationBinary classification on a d-dimensional manifold · Binary classification on a d-dimensional manifoldExpected excess logistic risk: Cn^{-\frac{s}{2s+2(s\vee d)}}\log^4 nHelped

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