Universal approximations of invariant maps by neural networks (Q2117338): Difference between revisions

From MaRDI portal
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:56, 5 March 2024

scientific article
Language Label Description Also known as
English
Universal approximations of invariant maps by neural networks
scientific article

    Statements

    Universal approximations of invariant maps by neural networks (English)
    0 references
    0 references
    21 March 2022
    0 references
    Neural networks are currently one of the most-investigated methods in applied mathematics. The author of this paper puts the approach in a new, more general context in mathematics, namely the universal approximations of invariant or equivariant or permutation invariant maps (there are several new versions of the universal approximation theorem). This is carried out in one instance with the help of constructing intermediate layers of the shallow networks by polynomials. The latter allows the approximations to be invariant or equivariant and complete. The construction with polynomials can then be extended by using polarisation. The groups on which the maps are formed are for example general compact groups or special translation-invariant groups. The inputs that are admitted to the network include continuous multivariable signals from infinite dimensional spaces. Both shallow and deep neural networks are addressed.
    0 references
    neural network
    0 references
    approximation
    0 references
    linear representation
    0 references
    invariance
    0 references
    equivariance
    0 references
    polynomial
    0 references
    polarization
    0 references
    convnet
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references