Online learning algorithms

Foundations of Computational Mathematics

Volumn 6, Issue 2, 2006, Pages 145-170

  Smale, Steve ^a   Yao, Yuan ^a,b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Online learning; Regularization; Reproducing Kernel Hilbert Spaces; Stochastic approximation

Indexed keywords

ONLINE LEARNING; ONLINE LEARNING ALGORITHMS; POTENTIAL FUNCTION; REGULARIZATION; REPRODUCING KERNEL HILBERT SPACES; STOCHASTIC APPROXIMATIONS; STOCHASTIC GRADIENT METHODS; UPPER BOUND;

GRADIENT METHODS;

LEARNING ALGORITHMS;

EID: 33744740175     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-004-0160-z     Document Type: Article

References (24)

1. M. Benaïm, Dynamics of stochastic approximations, in Le Seminaire de Probabilites, Lectures Notes in Mathematics, Vol. 1709, Springer-Verlag, New York, 1999, pp. 1-68.
2. D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Progmmming, Athena Scientific, Belmont, MA, 1996.
3. O. Bousquet and A. Elisseeff, Stability and generalization. J. Mach. Learn. Res. 2 (2002), 499-526.
4. N. Cesa-Bianchi, P. M. Long, andM. K. Warmuth, Worst-case quadratic loss bounds for prediction using linear functions and gradient descent, IEEE Trans. Neural Networks 7(3) (1996), 604-619.
5. N. Cristianini and J. Shawe-Taylor, An Introduction to Support Vector Machines and Other Kernel-based Learning Methods, Cambridge University Press, Cambridge, 2000.
6. F. Cucker and S. Smale, Best choices for regularization parameters in learning theory, Found. Comput. Math. 2(4) (2002), 413-428.
7. F. Cucker and S. Smale, On the mathematical foundations of learning, Bull. Amer. Math. Soc. 29(1) (2002), 1-49.
8. E. De Vito, A. Caponnetto, and L. Rosasco, Model selection for regularized least-squares algorithm in learning theory, Found. Comput. Math. 5(1), 59-85.
9. M. Duflo, Cibles atteignables avec une probabilité positive d'aprés M. Benaïm, Unpublished manuscript, 1997.
10. M. Duflo, Algorithmes Stochastiques, Springer-Verlag, Berlin, 1996.
11. T. Evgeniou, M. Pontil, and T. Poggio, Regularization networks and support vector machines, Adv. Comput. Math. 13(1) (1999), 1-50.
12. L. Györfi, Stochastic approximation from ergodic sample for linear regression, Z. Wahrsch. Verw. Gebiete 54 (1980), 47-55.
13. L. Györfi, M. Kohler, A. Krzyżak, and H. Walk, A Distribution-Free Theory of Nonparametric Regression, Springer-Verlag, New York, 2002.
14. J. Kiefer and J. Wolfowitz, Stochastic estimation of the maximum of a regression function, Ann. Math. Statist. 23 (1952), 462-466.
15. J. Kivinen, A. J. Smola, and R. C. Williamson, Online learning with kernels, IEEE Trans. Signal Process. 52(8) (2004), 2165-2176.
16. H. J. Kushner and G. G. Yin, Stochastic Approximations and Recursive Algorithms and Applications, Springer-Verlag, Berlin, 2003.
17. I. F. Pinelis and A. I. Sakhanenko, Remarks on inequalities for probabilities of large deviations, Theory Probab. Appl. 30(1) (1985), 143-148.
18. H. Robbins and S. Monro, A stochastic approximation method, Ann. Math. Statist. 22(3) (1951), 400-407.
19. H. Robbins and D. Siegmund, A convergence theorem for nonnegative almost supermartingales and some applications, in (J. S. Rustagi, editor), Optimizing Methods in Statistics, Academic Press, New York, 1971, pp. 233-257.
20. S. Smale and D.-X. Zhou, Shannon sampling ii. connections to learning theory, Appl. Comput. Harmonic Anal. (2005), submitted.
21. V. B. Tadic, On the almost sure rate of convergence of linear stochastic approximation algorithms, IEEE Trans. Inform. Theory 50 (2004), 401-409.
22. Y Yurinsky, Sums and Gaussian Vectors, Lecture Notes in Mathematics, Vol. 1617, Springer-Verlag, Berlin, 1995.
23. T. Zhang, Leave-one-out bounds for kernel methods, Neural Comput. 15 (2003), 1397-1437.
24. M. Zinkevich, Online convex programming and generalized infinitesimal gradient ascent, Technical report, CMU-CS-03-110, School of Computer Science, Carnegie Mellon University, 2003.