Projects per year
Abstract
We study the problem of online regression. We prove a theoretical bound on the square loss of Ridge Regression. We do not make any assumptions about input vectors or outcomes. We also show that Bayesian Ridge Regression can be thought of as an online algorithm competing with all the Gaussian linear experts.
Original language | English |
---|---|
Publication status | Published - 24 Oct 2009 |
Keywords
- cs.LG
Projects
- 1 Finished
-
PCP: Practical Competitive Prediction
Vovk, V. (PI), Gammerman, A. (CoI), Kalnishkan, Y. (CoI), Chernov, A. (CoI) & Zhdanov, F. (CoI)
Eng & Phys Sci Res Council EPSRC
10/10/07 → 22/11/10
Project: Research