Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

DOI10.1016/j.dam.2007.04.007zbMath1143.52010OpenAlexW2018166535MaRDI QIDQ2381815

Marcello Sanguineti, Vera Kurková

Publication date: 19 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.007

zbMATH Keywords

Minkowski functionalgeneralized Hadamard matriceslower bounds on covering numberspower-type covering numberssymmetric convex hulls

Mathematics Subject Classification ID

Statistical decision theory (62C99) General convexity (52A99)

Related Items (4)

Multivariate neural network operators with sigmoidal activation functions ⋮ Nonparametric nonlinear regression using polynomial and neural approximators: a numerical comparison ⋮ Geometric Rates of Approximation by Neural Networks ⋮ Stochastic separation theorems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Entropy of convex hulls -- some Lorentz norm results
• Fast rates for support vector machines using Gaussian kernels
• Estimating a density under order restrictions: Nonasymptotic minimax risk
• Entropy numbers of diagonal operators with an application to eigenvalue problems
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Approximation and learning of convex superpositions
• Entropy and the combinatorial dimension
• Entropy numbers of convex hulls and an application to learning algorithms
• Approximation, metric entropy and small ball estimates for Gaussian measures
• The covering number in learning theory
• Sharp asymptotics of the Kolmogorov entropy for Gaussian measures
• Random approximants and neural networks
• Regularization networks and support vector machines
• Quasiorthogonal dimension of Euclidean spaces
• Metric entropy of convex hulls in type $p$ spaces—The critical case
• On the mathematical foundations of learning
• 10.1162/153244302760185225
• Entropy Numbers and Approximation Numbers in Function Spaces, II
• Uniform Central Limit Theorems
• Feedforward Neural Network Methodology
• Universal approximation bounds for superpositions of a sigmoidal function
• Metric Entropy of Convex Hulls in Hilbert Spaces
• Scale-sensitive dimensions, uniform convergence, and learnability
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
• Metric Entropy of Convex Hulls in Banach Spaces
• Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
• Comparison of worst case errors in linear and neural network approximation
• ENTROPY OF ABSOLUTE CONVEX HULLS IN HILBERT SPACES
• Neural Network Learning
• Metric entropy and approximation
• Convergence of stochastic processes
• Combinatorial methods in density estimation
• Metric entropy of convex hulls

This page was built for publication: Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets