Pith. sign in

REVIEW

Nonparametric Classification on Low Dimensional Manifolds using Overparameterized Convolutional Residual Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.01649 v3 pith:3UJZHTW3 submitted 2023-07-04 cs.LG

classification cs.LG
keywords convresnextsfunctionoverparameterizedblocksclassificationconventionalconvolutionalconvresnets
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Convolutional residual neural networks (ConvResNets), though overparameterized, can achieve remarkable prediction performance in practice, which cannot be well explained by conventional wisdom. To bridge this gap, we study the performance of ConvResNeXts, which cover ConvResNets as a special case, trained with weight decay from the perspective of nonparametric classification. Our analysis allows for infinitely many building blocks in ConvResNeXts, and shows that weight decay implicitly enforces sparsity on these blocks. Specifically, we consider a smooth target function supported on a low-dimensional manifold, then prove that ConvResNeXts can adapt to the function smoothness and low-dimensional structures and efficiently learn the function without suffering from the curse of dimensionality. Our findings partially justify the advantage of overparameterized ConvResNeXts over conventional machine learning models.

Discussion (0). Sign in to comment.

Pith tools