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

DOI10.1016/J.DAM.2007.04.007zbMATH Open1143.52010OpenAlexW2018166535MaRDI QIDQ2381815FDOQ2381815

Authors: Marcello Sanguineti, Věra Kůrková 

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

Recommendations

• Covering numbers of \(L_{p}\)-balls of convex functions and sets
• Gelfand numbers and metric entropy of convex hulls in Hilbert spaces
• On the size of convex hulls of small sets
• ENTROPY OF ABSOLUTE CONVEX HULLS IN HILBERT SPACES
• Metric Entropy of Convex Hulls in Hilbert Spaces

zbMATH Keywords

generalized Hadamard matricesMinkowski functionallower bounds on covering numberspower-type covering numberssymmetric convex hulls

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Geometric Rates of Approximation by Neural Networks
• Multivariate neural network operators with sigmoidal activation functions
• Nonparametric nonlinear regression using polynomial and neural approximators: a numerical comparison
• Covering numbers of \(L_{p}\)-balls of convex functions and sets
• A new estimate of covering number for set in Banach space
• Stochastic separation theorems

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)