Competing with wild prediction rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4005 LNAI, Issue , 2006, Pages 559-573

  Vovk, Vladimir ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; LEARNING SYSTEMS;

BANACH-SPACE METHODS; KERNEL HUBERT SPACE; ON-LINE PREDICTION;

PROBLEM SOLVING;

EID: 33746063203     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_41     Document Type: Conference Paper

References (23)

1. Robert A. Adams and John J. F. Fournier. Sobolev Spaces, volume 140 of Pure and Applied Mathematics. Academic Press, Amsterdam, second edition, 2003.
2. Nachman Aronszajn. Theory of reproducing kernels. Transactions of the American Mathematical Society, 68:337-404, 1950.
3. Peter Auer, Nicolò Cesa-Bianchi, and Claudio Gentile. Adaptive and self-confident on-line learning algorithms. Journal of Computer and System Sciences, 64:48-75, 2002.
4. Nicolò Cesa-Bianchi, Alex Conconi, and Claudio Gentile. On the generalization ability of on-line learning algorithms. IEEE Transactions on Information Theory, 50:2050-2057, 2004.
5. Nicolò Cesar-Bianchi, Philip M. Long, and Manfred K. Warmuth. Worst-case quadratic loss bounds for on-line prediction of linear functions by gradient descent. IEEE Transactions on Neural Networks, 7:604-619, 1996.
6. James A. Clarkson. Uniformly convex spaces. Transactions of the American Mathematical Society, 40:396-414, 1936.
7. T. Figiel. On the moduli of convexity and smoothness. Studia Mathematica, 56:121-155, 1976. Available free of charge at http://matwbn.icm.edu.pl.
8. p. Arkiv för Matematik, 3:239-244, 1956.
9. Ioannis Karatzas and Steven E. Shreve. Brownian Motion and Stochastic Calculus. Springer, New York, second edition, 1991.
10. Jyrki Kivinen and Manfred K. Warmuth. Exponential Gradient versus Gradient Descent for linear predictors. Information and Computation, 132:1-63, 1997.
11. Andrei N. Kolmogorov. Grundbegriffe der Wahrscheinlichkeitsrechnung. Springer, Berlin, 1933.
12. English translation: Foundations of the theory of probability. Chelsea, New York, 1950.
13. Joram Lindenstrauss. On the modulus of smoothness and divergent series in Banach spaces. Michigan Mathematical Journal, 10:241-252, 1963.
14. V. I. Liokumovich. The existence of B-spaces with non-convex modulus of convexity (in Russian). 12:43-50, 1973.
15. Sergei M. Nikolsky. On imbedding, continuation and approximation theorems for differentiable functions of several variables. Russian Mathematical Surveys, 16(5):55-104, 1961.
16. R. Tyrrell Rockafellar. Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
17. Walter Rudin. Functional Analysis. McGraw-Hill, Boston, second edition, 1991.
18. Glenn Shafer and Vladimir Vovk. Probability and Finance: It's Only a Game! Wiley, New York, 2001.
19. H. W. Sorenson. Least-squares estimation: from Gauss to Kalman. IEEE Spectrum, 7:63-68, 1970.
20. Ingo Steinwart. On the influence of the kernel on the consistency of support vector machines. Journal of Machine Learning Research, 2:67-93, 2001.
21. Vladimir Vovk. Competing with wild prediction rules. Technical Report arXiv:cs.LG/0512059, arXiv.org e-Print archive, January 2006.
22. Vladimir Vovk. On-line regression competitive with reproducing kernel Hilbert spaces. In Jin-Yi Cai, S. Barry Cooper, and Angsheng Li, editors, Theory and Applications of Models of Computation. Proceedings of the Third Annual Conference on Computation and Logic, volume 3959 of Lecture Notes in Computer Science, pages 452-463, Berlin, 2006. Springer. Full version: Technical Report arXiv: cs.LG/0511058, arXiv.org e-Print archive, January 2006.