REVIEW 3 cited by
The Barron Space and the Flow-induced Function Spaces for Neural Network Models
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
read the original abstract
One of the key issues in the analysis of machine learning models is to identify the appropriate function space and norm for the model. This is the set of functions endowed with a quantity which can control the approximation and estimation errors by a particular machine learning model. In this paper, we address this issue for two representative neural network models: the two-layer networks and the residual neural networks. We define the Barron space and show that it is the right space for two-layer neural network models in the sense that optimal direct and inverse approximation theorems hold for functions in the Barron space. For residual neural network models, we construct the so-called flow-induced function space, and prove direct and inverse approximation theorems for this space. In addition, we show that the Rademacher complexity for bounded sets under these norms has the optimal upper bounds.
Forward citations
Cited by 3 Pith papers
-
Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations
An abstract framework for neural flows with composition and separation structures is proven to universally approximate any operator, recovering ResNet and plain architectures via discretization.
-
Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations
Neural flow operators with composition and separation structures are proven to universally approximate any operator in finite and infinite dimensions, recovering ResNet-type and plain architectures via time discretizations.
-
Shallow neural network yields regularization for ill-posed inverse problems
The number of neurons in a shallow ReLU network can serve as a regularization parameter for ill-posed inverse problems, with theoretically derived scaling n(δ)=O(δ^{-2/θ}).
Discussion (0). Sign in to comment.