Convergence analysis of online algorithms

DOI10.1007/S10444-005-9002-ZMaRDI QIDQ2454719zbMATH OpenOpenAlexWikidataFDO

Authors 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

general loss functiononline learning algorithmregularized sample errorreproducing kernel Hilbert space

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Online Regularized Classification Algorithms
• Fast and strong convergence of online learning algorithms
• Convergence of unregularized online learning algorithms
• Online learning algorithms
• Unregularized online learning algorithms with general loss functions

Cites work

• 10.1162/1532443041424319
• An introduction to support vector machines and other kernel-based learning methods.
• Capacity of reproducing kernel spaces in learning theory
• Convexity, Classification, and Risk Bounds
• ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Learnability of Gaussians with flexible variances
• Learning Theory
• Multi-kernel regularized classifiers
• On the mathematical foundations of learning
• Online learning algorithms
• Online Learning with Kernels
• Online Regularized Classification Algorithms
• Regularization networks and support vector machines
• Shannon sampling and function reconstruction from point values
• Shannon sampling. II: Connections to learning theory
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Support vector machine soft margin classifiers: error analysis
• The covering number in learning theory
• Theory of Reproducing Kernels

Cited in

(26)

• Online gradient descent learning algorithms
• Gradient learning in a classification setting by gradient descent
• Conditional quantiles with varying Gaussians
• Convergence of online mirror descent
• Fast and strong convergence of online learning algorithms
• Fully online classification by regularization
• Online learning algorithms
• Convergence analysis of online learning algorithm with two-stage step size
• Online regularized generalized gradient classification algorithms
• Formal Analysis of Online Algorithms
• Online Regularized Classification Algorithms
• ERM scheme for quantile regression
• Approximation analysis of learning algorithms for support vector regression and quantile regression
• Convergence of unregularized online learning algorithms
• Error analysis of the kernel regularized regression based on refined convex losses and RKBSs
• Unregularized online learning algorithms with general loss functions
• Analysis of Online Composite Mirror Descent Algorithm
• Learning from non-identical sampling for classification
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
• Capacity dependent analysis for functional online learning algorithms
• Convergence analysis for kernel-regularized online regression associated with an RRKHS
• Online regularized learning algorithm for functional data
• The convergence rate of a regularized ranking algorithm
• Convergence analysis of an online approach to parameter estimation problems based on binary observations
• Derivative reproducing properties for kernel methods in learning theory
• Mean analysis of an online algorithm for the vertex cover problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454719)