Approximation and learning of convex superpositions
From MaRDI portal
(Redirected from Publication:1370865)
Recommendations
- Approximation methods for supervised learning
- Approximation, dimension reduction, and nonconvex optimization using linear superpositions of Gaussians
- scientific article; zbMATH DE number 3946831
- Approximation in learning theory
- From inexact optimization to learning via gradient concentration
- Computational and statistical tradeoffs via convex relaxation
- scientific article; zbMATH DE number 125259
- scientific article; zbMATH DE number 1215260
- Convex optimization with an interpolation-based projection and its application to deep learning
Cites work
- Central limit theorems for empirical measures
- Characterization of the law of the iterated logarithm in Banach spaces
- Convergence of stochastic processes
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Discrepancy and approximations for bounded VC-dimension
- Efficient distribution-free learning of probabilistic concepts
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Fat-shattering and the learnability of real-valued functions
- scientific article; zbMATH DE number 3121911 (Why is no real title available?)
- scientific article; zbMATH DE number 3219970 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Real Analysis and Probability
- Scale-sensitive dimensions, uniform convergence, and learnability
- U-processes: Rates of convergence
- Universal approximation bounds for superpositions of a sigmoidal function
- Universal Donsker classes and metric entropy
- Vapnik-Chervonenkis Classes of Definable Sets
Cited in
(15)- Best approximation by linear combinations of characteristic functions of half-spaces.
- Complexity estimates based on integral transforms induced by computational units
- Depth separations in neural networks: what is actually being separated?
- Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
- Approximation methods for supervised learning
- Rates of minimization of error functionals over Boolean variable-basis functions
- A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves
- An Integral Upper Bound for Neural Network Approximation
- Integral combinations of Heavisides
- Accuracy of approximations of solutions to Fredholm equations by kernel methods
- scientific article; zbMATH DE number 1104355 (Why is no real title available?)
- Inducing Super-Approximation
- A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces
- Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality
- Approximative compactness of linear combinations of characteristic functions
This page was built for publication: Approximation and learning of convex superpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370865)
