Abstract
We study prediction with expert advice in the setting where the losses are accumulated with some discounting and the impact of old losses can gradually vanish. We generalize the Aggregating Algorithm and the Aggregating Algorithm for Regression, propose a new variant of exponentially weighted average algorithm, and prove bounds on the cumulative discounted loss.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beckenbach, E.F., Bellman, R.: Inequalities. Springer, Berlin (1961)
Cesa-Bianchi, N., Lugosi, G.: Prediction, learning, and games. Cambridge University Press, Cambridge (2006)
Chaudhuri, K., Freund, Y., Hsu, D.: A parameter-free hedging algorithm. In: Advances in Neural Information Processing Systems, vol. 22, pp. 297–305 (2009)
Chernov, A., Kalnishkan, Y., Zhdanov, F., Vovk, V.: Supermartingales in prediction with expert advice. Theoretical Computer Science 411, 2647–2669 (2010); See also: arXiv:1003.2218 [cs.LG]
Chernov, A., Vovk, V.: Prediction with advice of unknown number of experts. In: Proc. of 26th Conf. on Uncertainty in Artificial Intelligence, pp. 117–125 (2010)
Chernov, A., Zhdanov, F.: Prediction with expert advice under discounted loss. Technical report, arXiv:1005.1918v1 [cs.LG] (2010)
Freund, Y., Hsu, D.: A new hedging algorithm and its application to inferring latent random variables. Technical report, arXiv:0806.4802v1 [cs.GT] (2008)
Gammerman, A., Kalnishkan, Y., Vovk, V.: On-line prediction with kernels and the complexity approximation principle. In: Proc. of 20th Conf. on Uncertainty in Artificial Intelligence, pp. 170–176 (2004)
Gardner, E.S.: Exponential smoothing: The state of the art – part II. International Journal of Forecasting 22, 637–666 (2006)
Harville, D.A.: Matrix algebra from a statistician’s perspective. Springer, Heidelberg (1997)
Haussler, D., Kivinen, J., Warmuth, M.: Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory 44, 1906–1925 (1998)
Herbster, M., Warmuth, M.K.: Tracking the best expert. Machine Learning 32, 151–178 (1998)
Kalnishkan, Y., Vyugin, M.: The weak aggregating algorithm and weak mixability. Technical report, CLRC-TR-03-01 (2003)
Kalnishkan, Y., Vyugin, M.: The weak aggregating algorithm and weak mixability. Journal of Computer and System Sciences 74(8), 1228–1244 (2008)
Muth, J.F.: Optimal properties of exponentially weighted forecasts. Journal of the American Statistical Association 55, 299–306 (1960)
Schölkopf, B., Smola, A.J.: Learning with kernels: Support Vector Machines, regularization, optimization, and beyond. MIT Press, Cambridge (2002)
Sutton, R., Barto, A.: Reinforcement learning: An introduction. MIT Press, Cambridge (1998)
Vovk, V.: Aggregating strategies. In: Proc. of 3rd COLT, pp. 371–383 (1990)
Vovk, V.: A game of prediction with expert advice. Journal of Computer and System Sciences 56, 153–173 (1998)
Vovk, V.: Derandomizing stochastic prediction strategies. Machine Learning 35, 247–282 (1999)
Vovk, V.: Competitive on-line statistics. Int. Stat. Review 69, 213–248 (2001)
Vovk, V.: On-line regression competitive with reproducing kernel Hilbert spaces. Technical report, arXiv:cs/0511058 [cs.LG] (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chernov, A., Zhdanov, F. (2010). Prediction with Expert Advice under Discounted Loss. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 2010. Lecture Notes in Computer Science(), vol 6331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16108-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-16108-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16107-0
Online ISBN: 978-3-642-16108-7
eBook Packages: Computer ScienceComputer Science (R0)