Convergence analysis of online algorithms

DOI10.1007/s10444-005-9002-zzbMath1129.68070OpenAlexW2150450267WikidataQ58759011 ScholiaQ58759011MaRDI QIDQ2454719

Yiming Ying

Publication date: 16 October 2007

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-005-9002-z

zbMATH Keywords

reproducing kernel Hilbert spacegeneral loss functiononline learning algorithmregularized sample error

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (10)

ERM scheme for quantile regression ⋮ Approximation analysis of learning algorithms for support vector regression and quantile regression ⋮ Convergence analysis for kernel-regularized online regression associated with an RRKHS ⋮ Conditional quantiles with varying Gaussians ⋮ Derivative reproducing properties for kernel methods in learning theory ⋮ Learning from non-identical sampling for classification ⋮ Fast and strong convergence of online learning algorithms ⋮ Online regularized generalized gradient classification algorithms ⋮ Gradient learning in a classification setting by gradient descent ⋮ Error analysis of the kernel regularized regression based on refined convex losses and RKBSs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-kernel regularized classifiers
• The covering number in learning theory
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Regularization networks and support vector machines
• Online learning algorithms
• Shannon sampling. II: Connections to learning theory
• On the mathematical foundations of learning
• Capacity of reproducing kernel spaces in learning theory
• Online Regularized Classification Algorithms
• ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
• Shannon sampling and function reconstruction from point values
• 10.1162/1532443041424319
• Online Learning with Kernels
• Learning Theory
• Convexity, Classification, and Risk Bounds
• Theory of Reproducing Kernels

This page was built for publication: Convergence analysis of online algorithms