This work is concerned with online learning from expert advice. Extensive work on this problem generated numerous "expert advice algorithms" whose total loss is provably bounded above in terms of the loss incurred by the best expert in hindsight. Such algorithms were devised for various problem variants corresponding to various loss functions. For some loss functions, such as the square, Hellinger and entropy losses, optimal algorithms are known. However, for two of the most widely used loss functions, namely the 0/1 and absolute loss, there are still gaps between the known lower and upper bounds. In this paper we present two new expert advice algorithms and prove for them the best known 0/1 and absolute loss bounds. Given an expert advice algorithm ALG, the goal is to form an upper bound on the regret L-ALG-L* of ALG, where L-ALG is the loss of ALG and L* is the loss of the best expert in hindsight. Typically, regret bounds of a "canonical form" C . root L* ln N are sought where N is the number of experts and C is a constant. So far, the best known constant for the absolute loss function is C = 2.83, which is achieved by the recent IAWM algorithm of Auer et al. (2002). For the 0/1 loss function no bounds of this canonical form are known and the best known regret bound is L-ALG - L* less than or equal to L* + C-1 ln N + C-2 root L* ln N + e/4 ln(2) N, where C-1 = e - 2 and C-2 = 2roote. This bound is achieved by a "P-norm" algorithm of Gentile and Littlestone ( 1999). Our first algorithm is a randomized extension of the "guess and double" algorithm of Cesa-Bianchi et al. ( 1997). While the guess and double algorithm achieves a canonical regret bound with C = 3.32, the expected regret of our randomized algorithm is canonically bounded with C = 2.49 for the absolute loss function. The algorithm utilizes one random choice at the start of the game. Like the deterministic guess and double algorithm, a deficiency of our algorithm is that it occasionally restarts itself and therefore "forgets" what it learned. Our second algorithm does not forget and enjoys the best known asymptotic performance guarantees for both the absolute and 0/1 loss functions. Specifically, in the case of the absolute loss, our algorithm is canonically bounded with C approaching root2 and in the case of the 0/1 loss, with C approaching 3/root2 approximate to 2.12. In the 0/1 loss case the algorithm is randomized and the bound is on the expected regret.
