Prediction with expert advice by following the perturbed leader for general weights

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3244, Issue , 2004, Pages 279-293

  Hutter, Marcus ^a   Poland, Jan ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; EXPERT SYSTEMS; FORECASTING; LEARNING SYSTEMS; PERTURBATION TECHNIQUES; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; ADAPTIVE SYSTEMS; LEARNING ALGORITHMS;

ADAPTIVE LEARNING RATE; PREDICTION WITH EXPERT ADVICE (PEA); RANDOM VARIABLES; RANDOMIZATION; ADAPTIVE LEARNING RATES; FOLLOW THE PERTURBED LEADER; GENERAL WEIGHTS; LEARNING RATES; LOSS BOUNDS; PREDICTION WITH EXPERT ADVICE; S-ALGORITHMS;

ALGORITHMS;

EID: 21844436185     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30215-5_22     Document Type: Conference Paper

References (15)

1. [ACBG02] P. Auer, N. Cesa-Bianchi, and C. Gentile. Adaptive and self-confident on-line learning algorithms. Journal of Computer and System Sciences, 64(l):48-75, 2002.
2. [AG00] P. Auer and C. Gentile. Adaptive and self-confident on-line learning algorithms. In Proceedings of the 13th Conference on Computational Learning Theory, pages 107-117. Morgan Kaufmann, San Francisco, 2000.
3. [CB97] N. Cesa-Bianchi et al. How to use expert advice. Journal of the ACM, 44(3):427-485, 1997.
4. [FS97] Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
5. [Gen03] C. Gentile. The robustness of the p-norm algorithm. Machine Learning, 53(3):265-299, 2003.
6. [Han57] J. Hannan. Approximation to Bayes risk in repeated plays. In M. Dresher, A. W. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games 3, pages 97-139. Princeton University Press, 1957.
7. [Hut03a] M. Hutter. Convergence and loss bounds for Bayesian sequence prediction. IEEE Transactions on Information Theory, 49(8):2061-2067, 2003.
8. [Hut03b] M. Hutter. Optimality of universal Bayesian prediction for general loss and alphabet. Journal of Machine Learning Research, 4:971-1000, 2003.
9. [KV03] A. Kalai and S. Vempala. Efficient algorithms for online decision. In Proceedings of the 16th Annual Conference on Learning Theory (COLT2003), Lecture Notes in Artificial Intelligence, pages 506-521, Berlin, 2003. Springer.
10. [LW89] N. Littlestone and M. K. Warmuth. The weighted majority algorithm. In 30th Annual Symposium on Foundations of Computer Science, pages 256-261, Research Triangle Park, North Carolina, 1989. IEEE.
11. [LW94] N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994.
12. [McD89] C. McDiarmid. On the method of bounded differences. Surveys in Combinatorics, 141, London Mathematical Society Lecture Notes Series:148-188, 1989.
13. [Vov90] V. G. Vovk. Aggregating strategies. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 371-383, Rochester, New York, 1990. ACM Press.
14. [Vov95] V. G. Vovk. A game of prediction with expert advice. In Proceedings of the 8th Annual Conference on Computational Learning Theory, pages 51-60. ACM Press, New York, NY, 1995.
15. [YEYS04] R. Yaroshinsky, R. El-Yaniv, and S. Seiden. How to better use expert advice. Machine Learning, 2004.