Online Regression Competitive with Changing Predictors

This paper deals with the problem of making predictions in the online mode of learning where the dependence of the outcome yt on the signal xt can change with time. The Aggregating Algorithm (AA) is a technique that optimally merges experts from a pool, so that the resulting strategy suffers a cumulative loss that is almost as good as that of the best expert in the pool. We apply the AA to the case where the experts are all the linear predictors that can change with time. KAARCh is the kernel version of the resulting algorithm. In the kernel case, the experts are all the decision rules in some reproducing kernel Hilbert space that can change over time. We show that KAARCh suffers a cumulative square loss that is almost as good as that of any expert that does not change very rapidly.

• Type: Conference
• Year: 2007
• Where: ALT
• Authors: Steven Busuttil, Yuri Kalnishkan
• Keywords: ALT 2007, Cumulative Loss, Expert, Machine Learning, Reproducing Kernel Hilbert Space