Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
From MaRDI portal
(Redirected from Publication:2381815)
Recommendations
Cites work
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Advances in large-margin classifiers
- Approximation and learning of convex superpositions
- Approximation, metric entropy and small ball estimates for Gaussian measures
- Combinatorial methods in density estimation
- Comparison of worst case errors in linear and neural network approximation
- Convergence of stochastic processes
- Entropy and the combinatorial dimension
- Entropy Numbers and Approximation Numbers in Function Spaces, II
- Entropy numbers of convex hulls and an application to learning algorithms
- Entropy numbers of diagonal operators with an application to eigenvalue problems
- ENTROPY OF ABSOLUTE CONVEX HULLS IN HILBERT SPACES
- Entropy of convex hulls -- some Lorentz norm results
- Estimating a density under order restrictions: Nonasymptotic minimax risk
- Fast rates for support vector machines using Gaussian kernels
- Feedforward Neural Network Methodology
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- scientific article; zbMATH DE number 2089354 (Why is no real title available?)
- scientific article; zbMATH DE number 3116960 (Why is no real title available?)
- scientific article; zbMATH DE number 44592 (Why is no real title available?)
- scientific article; zbMATH DE number 1322222 (Why is no real title available?)
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- scientific article; zbMATH DE number 1182753 (Why is no real title available?)
- scientific article; zbMATH DE number 1485105 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- Metric entropy and approximation
- Metric entropy of convex hulls
- Metric Entropy of Convex Hulls in Banach Spaces
- Metric Entropy of Convex Hulls in Hilbert Spaces
- Metric entropy of convex hulls in type p spaces--the critical case
- Neural Network Learning
- On the mathematical foundations of learning
- On the size of convex hulls of small sets
- Quasiorthogonal dimension of Euclidean spaces
- Random approximants and neural networks
- Regularization networks and support vector machines
- Scale-sensitive dimensions, uniform convergence, and learnability
- Sharp asymptotics of the Kolmogorov entropy for Gaussian measures
- The covering number in learning theory
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
- Uniform Central Limit Theorems
- Universal approximation bounds for superpositions of a sigmoidal function
Cited in
(7)- Fractional covers for convolution products
- Nonparametric nonlinear regression using polynomial and neural approximators: a numerical comparison
- Stochastic separation theorems
- A new estimate of covering number for set in Banach space
- Multivariate neural network operators with sigmoidal activation functions
- Geometric Rates of Approximation by Neural Networks
- Covering numbers of \(L_{p}\)-balls of convex functions and sets
This page was built for publication: Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2381815)
