Optimal Approximation and Learning Rates for Deep Convolutional Neural Networks

Shao-Bo Lin
8/7/2023
cs.LGmath.ST

No confident code implementation found for this paper.

Abstract

This paper focuses on approximation and learning performance analysis for deep convolutional neural networks with zero-padding and max-pooling. We prove that, to approximate $r$-smooth function, the approximation rates of deep convolutional neural networks with depth $L$ are of order $ (L^2/\log L)^{-2r/d} $, which is optimal up to a logarithmic factor. Furthermore, we deduce almost optimal learning rates for implementing empirical risk minimization over deep convolutional neural networks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lin2023optimal,
  title  = {Optimal Approximation and Learning Rates for Deep Convolutional Neural Networks},
  author = {Shao-Bo Lin},
  year   = {2023},
  eprint = {2308.03259},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.03259v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.03259.svg)](https://codeofpaper.com/paper/2308.03259)

Discussion