Metric Entropy, Widths, and Superpositions of Functions

Cited in

(26)

Approximate functional complexity
Sharp estimates for the covering numbers of the Weierstrass fractal kernel
On the uniqueness of representation by linear superpositions
Metric entropy and approximation
Controllable processes and the fuzzy controller
On the representation by linear superpositions
Optical approximating manifolds in \(L_ 2\)-spaces
Approximative versions of Kolmogorov's superposition theorem, proved constructively
A survey of solved and unsolved problems on superpositions of functions
On the approximation by neural networks with bounded number of neurons in hidden layers
On interpolation properties of exterior functions in Kolmogorov superpositions
On the \({\mathcal L}_ 2 n\)-width of certain classes of functions of several variables
Topological entropy of Chebyshev polynomials and related real mappings
Error bounds for deep ReLU networks using the Kolmogorov-Arnold superposition theorem
Hausdorffsche Metrik und Approximationen
Approximate complexity and functional representation
Dispersion mapping theorems
The use of signal properties for signal representation
On the Structure of Continuous Functions of Several Variables
Chebyshev approximation by discrete superposition. Application to neural networks
Trigonometric approximation with exponential error orders. I: Construction of asymptotically optimal processes; generalized de la Vallee Poussin sums
Approximation by sums of ridge functions with fixed directions
ARE FUZZY SYSTEMS UNIVERSAL APPROXIMATORS?
Metric Entropy of Certain Classes of Lipschitz Functions
On n-widths in Sobolev spaces and applications to elliptic boundary value problems
Entropy-based convergence rates of greedy algorithms

This page was built for publication: Metric Entropy, Widths, and Superpositions of Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5328258)