Deep neural network approximation of composite functions without the curse of dimensionality

Adrian Riekert
4/12/2023
math.NAcs.LG

No confident code implementation found for this paper.

Abstract

In this article we identify a general class of high-dimensional continuous functions that can be approximated by deep neural networks (DNNs) with the rectified linear unit (ReLU) activation without the curse of dimensionality. In other words, the number of DNN parameters grows at most polynomially in the input dimension and the approximation error. The functions in our class can be expressed as a potentially unbounded number of compositions of special functions which include products, maxima, and certain parallelized Lipschitz continuous functions.

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{riekert2023deep,
  title  = {Deep neural network approximation of composite functions without the curse of dimensionality},
  author = {Adrian Riekert},
  year   = {2023},
  eprint = {2304.05790},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.05790v1}
}

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/2304.05790.svg)](https://codeofpaper.com/paper/2304.05790)

Discussion