Minimax regret under log loss for general classes of experts

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn , Issue , 1999, Pages 12-18

  Cesa Bianchi, Nicolo ^a   Lugosi, Gabor ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; DATA COMPRESSION; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

DATA SEQUENCE; LOG LOSS; PROBABILITY ASSIGNMENT; SEQUENTIAL STRATEGIES; WEIGHTED AVERAGE ALGORITHMS;

EXPERT SYSTEMS;

EID: 0033280347     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/307400.307407     Document Type: Conference Paper

References (19)