Linear Probability Forecasting
In this paper we consider two online multi-class classification problems: classification with linear models and with kernelized models. The predictions can be thought of as probability distributions. The quality of predictions is measured by the Brier loss function. We suggest two computationally efficient algorithms to work with these problems, the second algorithm is derived by considering a new class of linear prediction models. We prove theoretical guarantees on the cumulative losses of the algorithms. We kernelize one of the algorithms and prove theoretical guarantees on the loss of the kernelized version. We perform experiments and compare our algorithms with logistic regression.
KeywordsOnline prediction classification linear regression Aggregating Algorithm
- 3.Zhdanov, F., Kalnishkan, Y.: Linear probability forecasting. Technical report, arXiv:1001.0879 [cs.LG], arXiv.org e-Print archive (2009)Google Scholar
- 6.Vovk, V.: Aggregating strategies. In: Proceedings of COLT 1990, pp. 371–383 (1990)Google Scholar
- 7.Vovk, V., Zhdanov, F.: Prediction with expert advice for the Brier game. In: Proceedings of ICML 2008, pp. 1104–1111 (2008)Google Scholar
- 8.Gammerman, A., Kalnishkan, Y., Vovk, V.: On-line prediction with kernels and the complexity approximation principle. In: Proceedings of UAI 2004, pp. 170–176 (2004)Google Scholar