On universal estimators in learning theory

DOI10.1134/S0081543806040201zbMath1351.68238OpenAlexW1979075812MaRDI QIDQ2342272

Vladimir N. Temlyakov

Publication date: 11 May 2015

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543806040201

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Universal discretization, Learning with sample dependent hypothesis spaces, Connections between numerical integration, discrepancy, dispersion, and universal discretization, On universal sampling recovery in the uniform norm, Smooth fixed volume discrepancy, dispersion, and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• The entropy in learning theory. Error estimates
• Projection pursuit
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• Entropy numbers, s-numbers, and eigenvalue problems
• Nonlinear methods of approximation
• A distribution-free theory of nonparametric regression
• Some remarks on greedy algorithms
• Approximation methods for supervised learning
• Approximation and learning by greedy algorithms
• Approximation in learning theory
• Thresholding in learning theory
• On the mathematical foundations of learning
• Universal approximation bounds for superpositions of a sigmoidal function
• The importance of convexity in learning with squared loss
• Asymptotic distribution of the errors in scalar and vector quantizers
• Greedy algorithms in Banach spaces