On pde characterization of smooth hierarchical functions computed by neural networks
Neural networks are versatile tools for computation, having the ability to approximate a broad range of functions. An important problem in the theory of deep neural networks is expressivity; that is, we want to understand the functions that are computable by a given network. We study real, infinitel...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MIT Press Journals
2021
|
Subjects: | |
Online Access: | View Fulltext in Publisher |