Pith. sign in

REVIEW

Optimal Convergence Rates of Deep Convolutional Neural Networks: Additive Ridge Functions

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 2202.12119 v2 pith:M3VMS7SI submitted 2022-02-24 cs.LG math.STstat.TH

classification cs.LGmath.STstat.TH
keywords convolutionalnetworksneuralfunctionsratesabilitiesadditiveconvergence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Convolutional neural networks have shown impressive abilities in many applications, especially those related to the classification tasks. However, for the regression problem, the abilities of convolutional structures have not been fully understood, and further investigation is needed. In this paper, we consider the mean squared error analysis for deep convolutional neural networks. We show that, for additive ridge functions, convolutional neural networks followed by one fully connected layer with ReLU activation functions can reach optimal mini-max rates (up to a log factor). The input dimension only appears in the constant of convergence rates. This work shows the statistical optimality of convolutional neural networks and may shed light on why convolutional neural networks are able to behave well for high dimensional input.

Discussion (0). Sign in to comment.

Pith tools