• DocumentCode
    640116
  • Title

    A universal probability assignment for prediction of individual sequences

  • Author

    Lomnitz, Yuval ; Feder, Meir

  • Author_Institution
    Dept. of EE-Syst., Tel Aviv Univ., Tel Aviv, Israel
  • fYear
    2013
  • fDate
    7-12 July 2013
  • Firstpage
    1387
  • Lastpage
    1391
  • Abstract
    Is it a good idea to use the frequency of events in the past, as a guide to their frequency in the future (as we all do anyway)? In this paper the question is attacked from the perspective of universal prediction of individual sequences. It is shown that there is a universal sequential probability assignment, such that for a large class loss functions (optimization goals), the predictor minimizing the expected loss under this probability, is a good universal predictor. The proposed probability assignment is based on randomly dithering the empirical frequencies of states in the past, and it is easy to show that randomization is essential. This yields a very simple universal prediction scheme which is similar to Follow-the-Perturbed-Leader (FPL) and works for a large class of loss functions, as well as a partial justification for using probabilistic assumptions.
  • Keywords
    optimisation; prediction theory; probability; FPL; event frequency; follow-the-perturbed-leader; individual sequences prediction; loss functions; loss minimization; optimization goals; probabilistic assumptions; randomly dithering; universal prediction; universal sequential probability assignment; Educational institutions; Games; Information theory; Probabilistic logic; Probability distribution; Redundancy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
  • Conference_Location
    Istanbul
  • ISSN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2013.6620454
  • Filename
    6620454