On-line regression competitive with reproducing Kernel Hilbert spaces (extended abstract)

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

Volumn 3959 LNCS, Issue , 2006, Pages 452-463

  Vovk, Ladimir ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; PROBLEM SOLVING; REGRESSION ANALYSIS; STOCHASTIC PROGRAMMING;

AGGREGATING ALGORITHM; DEFENSIVE FORECASTING; KERNEL HILBERT SPACES; PARAMETRIC STATISTICS;

ONLINE SYSTEMS;

EID: 33745843727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11750321_43     Document Type: Conference Paper

References (38)

1. Milton Abramowitz and Irene A. Stegun, editors. Handbook of Mathematical Functions: with Formulas, Graphs, and Mathematical Tables, volume 55 of National Bureau of Standards Applied Mathematics Series. US Government Printing Oce, Washington, DC, 1964. Republished many times by Dover, New York, starting from 1965.
2. Robert A. Adams and John J. F. Fournier. Sobolev Spaces, volume 140 of Pure and Applied Mathematics. Academic Press, Amsterdam, second edition, 2003.
3. Nachman Aronszajn. Theory of reproducing kernels. Transactions of the American Mathematical Society, 68:337-404, 1950.
4. Peter Auer, Nicolò Cesa-Bianchi, and Claudio Gentile. Adaptive and self-condent on-line learning algorithms. Journal of Computer and System Sciences, 64:48-75, 2002.
5. Nicolò Cesa-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. Luc Devroye, Lászl/'o Györfi, and Gábor Lugosi. A Probabilistic Theory of Pattern Recognition, volume 31 of Applications of Mathematics. Springer, New York, 1996.
7. Richard M. Dudley. Real Analysis and Probability. Cambridge University Press, Cambridge, England, 2002. Originally published in 1989.
8. Ryszard Engelking. General Topology, volume 6 of Sigma Series in Pure Mathematics. Heldermann, Berlin, second edition, 1989. First edition: 1977 (Państwowe Wydawnictwo Naukowe, Warsaw).
9. Dean P. Foster. Prediction in the worst case. Annals of Statistics, 19:1084-1090, 1991.
10. Dean P. Foster and Rakesh V. Vohra. Asymptotic calibration. Biometrika, 85:379-390, 1998.
11. Drew Fudenberg and David K. Levine. Conditional universal consistency. Games and Economic Behavior, 29:104-130, 1999.
12. Peter Gács. Uniform test of algorithmic randomness over a general space. Theoretical Computer Science, 341:91-137, 2005.
13. Alex Gammerman, Yuri Kalnishkan, and Vladimir Vovk. On-line prediction with kernels and the Complexity Approximation Principle. In Max Chickering and Joseph Halpern, editors, Proceedings of the Twentieth Annual Conference on Uncertainty in Artificial Intelligence, pages 170-176, Arlington, VA, 2004. AUAI Press.
14. Lászl/'o Györfi, Michael Kohler, Adam Krzyz̈ak, and Harro Walk. A Distribution-Free Theory of Nonparametric Regression. Springer Series in Statistics. Springer, New York, 2002.
15. David Haussler, Jyrki Kivinen, and Manfred K. Warmuth. Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory, 44:1906-1925, 1998.
16. Sham M. Kakade and Dean P. Foster. Deterministic calibration and Nash equilibrium. In John Shawe-Taylor and Yoram Singer, editors, Proceedings of the Seventeenth Annual Conference on Learning Theory, volume 3120 of Lecture Notes in Computer Science, pages 33-48, Heidelberg, 2004. Springer.
17. Don Kimber and Philip M. Long. On-line learning of smooth functions of a single variable. Theoretical Computer Science, 148:141-156, 1995.
18. Jyrki Kivinen and Manfred K. Warmuth. Exponential Gradient versus Gradient Descent for linear predictors. Information and Computation, 132:1-63, 1997.
19. Ehud Lehrer. Any inspection is manipulable. Econometrica, 69:1333-1347, 2001.
20. Leonid A. Levin. Uniform tests of randomness. Soviet Mathematics Doklady, 17:337-340, 1976.
21. Philip M. Long. Improved bounds about on-line learning of smooth functions of a single variable. Theoretical Computer Science, 241:25-35, 2000.
22. Alvaro Sandroni. The reproducible properties of correct forecasts. International Journal of Game Theory, 32:151-159, 2003.
23. Alvaro Sandroni, Rann Smorodinsky, and Rakesh V. Vohra. Calibration with many checking rules. Mathematics of Operations Research, 28:141-153, 2003.
24. Bernhard Schölkopf and Alexander J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
25. Glenn Shafer and Vladimir Vovk. Probability and Finance: It's Only a Game! Wiley, New York, 2001.
26. John Shawe-Taylor and Nello Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge, 2004.
27. Ingo Steinwart. On the influence of the kernel on the consistency of support vector machines. Journal of Machine Learning Research, 2:67-93, 2001.
28. Charles J. Stone. Consistent nonparametric regression (with discussion). Annals of Statistics, 5:595-645, 1977.
29. Vladimir N. Vapnik. Statistical Learning Theory. Wiley, New York, 1998.
30. Vladimir Vovk. Aggregating strategies. In Mark Fulk and John Case, editors, Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 371-383, San Mateo, CA, 1990. Morgan Kaufmann.
31. Vladimir Vovk. Competitive on-line statistics. International Statistical Review, 69:213-248, 2001.
32. Vladimir Vovk. Defensive prediction with expert advice. In Sanjay Jain, Hans Ulrich Simon, and Etsuji Tomita, editors, Proceedings of the Sixteenth International Conference on Algorithmic Learning Theory, volume 3734 of Lecture Notes in Artificial Intelligence, pages 444-458, Berlin, 2005. Springer. A version of this paper can be downloaded from the arXiv.org e-Print archive (arXiv:cs.LG/0506041).
33. Vladimir Vovk. Non-asymptotic calibration and resolution. In Sanjay Jain, Hans Ulrich Simon, and Etsuji Tomita, editors, Proceedings of the Sixteenth International Conference on Algorithmic Learning Theory, volume 3734 of Lecture Notes in Artificial Intelligence, pages 429-443, Berlin, 2005. Springer. A version of this paper can be downloaded from the arXiv.org e-Print archive (arXiv:cs.LG/0506004).
34. Vladimir Vovk. Competiting with wild prediction rules. Technical Report arXiv:cs.LG/0512059 (version 2), arXiv.org e-Print archive, January 2006.
35. Vladimir Vovk. On-line regression competitive with reproducing kernel Hilbert spaces. Technical Report arXiv:cs.LG/0511058 (version 2), arXiv.org e-Print archive, January 2006.
36. Vladimir Vovk and Glenn Shafer. Good randomized sequential probability forecasting is always possible. Journal of the Royal Statistical Society B, 67:747-763, 2005.
37. Vladimir Vovk, Akimichi Takemura, and Glenn Shafer. Defensive forecasting. In Robert G. Cowell and Zoubin Ghahramani, editors, Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, pages 365-372. Society for Artificial Intelligence and Statistics, 2005. Available electronically at http://www.gatsby.ucl.ac.uk/aistats/.
38. Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Tom Fawcett and Nina Mishra, editors, Proceedings of the Twentieth International Conference on Machine Learning, pages 768-775, Menlo Park, CA, 2003. AAAI Press.