COLT '90 Proceedings of the third annual workshop on Computational learning theory
The weighted majority algorithm
Information and Computation
Journal of the ACM (JACM)
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
A game of prediction with expert advice
Journal of Computer and System Sciences - Special issue on the eighth annual workshop on computational learning theory, July 5–8, 1995
Loss Functions, Complexities, and the Legendre Transformation
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Sequential prediction of individual sequences under general loss functions
IEEE Transactions on Information Theory
On the Absence of Predictive Complexity for Some Games
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
The weak aggregating algorithm and weak mixability
Journal of Computer and System Sciences
| Hi-index | 0.00 |
This paper investigates the behaviour of the constant c(脽) from the Aggregating Algorithm. Some conditions for mixability are derived and it is shown that for many non-mixable games c(脽) still converges to 1. The condition c(脽) 驴 1 is shown to imply the existence of weak predictive complexity and it is proved that many games specify complexity up to 驴n.