Online Learning Algorithms

Authors:
Steve Smale;Yuan Yao
Affiliations:
Toyota Technological Institute at Chicago, 1427 East 60th Street, Chicago, IL 60637, USA;Department of Mathematics, University of California at Berkeley, Berkeley, CA 94720, USA/ Current address: Toyota Technological Institute at Chicago, 1427 East 60th Street, Chicago, IL 60637, USA
Venue:
Foundations of Computational Mathematics
Year:
2006

Citing 0
Cited 10

Learning rates of gradient descent algorithm for classification

Journal of Computational and Applied Mathematics
On Stochastic Optimization and Statistical Learning in Reproducing Kernel Hilbert Spaces by Support Vector Machines (SVM)

Informatica
Limited stochastic meta-descent for kernel-based online learning

Neural Computation
Asymptotic efficiency of kernel support vector machines (SVM)

Cybernetics and Systems Analysis
Gradient learning in a classification setting by gradient descent

Journal of Approximation Theory
Online Learning with Samples Drawn from Non-identical Distributions

The Journal of Machine Learning Research
Learning theory viewpoint of approximation by positive linear operators

Computers & Mathematics with Applications
On complexity issues of online learning algorithms

IEEE Transactions on Information Theory
On Convergence of Kernel Learning Estimators

SIAM Journal on Optimization
Online crowdsourcing subjective image quality assessment

Proceedings of the 20th ACM international conference on Multimedia

Quantified Score

Hi-index	0.06

Visualization

Abstract

In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHSs) and general Hilbert spaces. We present a general form of the stochastic gradient method to minimize a quadratic potential function by an independent identically distributed (i.i.d.) sample sequence, and show a probabilistic upper bound for its convergence.