Learning Volatility of Discrete Time Series Using Prediction with Expert Advice

  • Vladimir V. V’yugin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5792)


In this paper the method of prediction with expert advice is applied for learning volatility of discrete time series. We construct arbitrage strategies (or experts) which suffer gain when “micro” and “macro” volatilities of a time series differ. For merging different expert strategies in a strategy of the learner, we use some modification of Kalai and Vempala algorithm of following the perturbed leader where weights depend on current gains of the experts. We consider the case when experts one-step gains can be unbounded. New notion of a volume of a game v t is introduced. We show that our algorithm has optimal performance in the case when the one-step increments \({\it \Delta} v_t=v_t-v_{t-1}\) of the volume satisfy \({\it \Delta} v_t=o(v_t)\) as t → ∞.


Fractional Brownian Motion Expert Advice Probabilistic Algorithm Adaptive Weight Arbitrary Positive Constant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allenberg, C., Auer, P., Gyorfi, L., Ottucsak, G.: Hannan consistency in on-Line learning in case of unbounded losses under partial monitoring. In: Balcázar, J.L., Long, P.M., Stephan, F. (eds.) ALT 2006. LNCS (LNAI), vol. 4264, pp. 229–243. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Cheredito, P.: Arbitrage in fractional Brownian motion. Finance and Statistics 7, 533 (2003)MathSciNetGoogle Scholar
  3. 3.
    Delbaen, F., Schachermayer, W.: A general version of the fundamental theorem of asset pricing. Mathematische Annalen 300, 463–520 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences 55, 119–139 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Hannan, J.: Approximation to Bayes risk in repeated plays. In: Dresher, M., Tucker, A.W., Wolfe, P. (eds.) Contributions to the Theory of Games 3, pp. 97–139. Princeton University Press, Princeton (1957)Google Scholar
  6. 6.
    Hutter, M., Poland, J.: Prediction with expert advice by following the perturbed leader for general weights. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol. 3244, pp. 279–293. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Kalai, A., Vempala, S.: Efficient algorithms for online decisions. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, pp. 26–40. Springer, Heidelberg (2003); Extended version in Journal of Computer and System Sciences 71, 291–307 (2005)CrossRefGoogle Scholar
  8. 8.
    Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Information and Computation 108, 212–261 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Lugosi, G., Cesa-Bianchi, N.: Prediction, Learning and Games. Cambridge University Press, New York (2006)zbMATHGoogle Scholar
  10. 10.
    Poland, J., Hutter, M.: Defensive universal learning with experts for general weight. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol. 3734, pp. 356–370. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Rogers, C.: Arbitrage with fractional Brownian motion. Mathematical Finance 7, 95–105 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Shafer, G., Vovk, V.: Probability and Finance. It’s Only a Game! Wiley, New York (2001)CrossRefzbMATHGoogle Scholar
  13. 13.
    Shiryaev, A.N.: Probability. Springer, Berlin (1980)zbMATHGoogle Scholar
  14. 14.
    Vovk, V.: A game-theoretic explanation of the \(\sqrt{dt}\) effect, Working paper #5 (2003),

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Vladimir V. V’yugin
    • 1
  1. 1.Institute for Information Transmission ProblemsRussian Academy of SciencesMoscowRussia

Personalised recommendations