@inproceedings{ded7480519ad4beba171e2a4dc74ccc5,

title = "The Fundamental Nature of the Log Loss Function",

abstract = "The standard loss functions used in the literature on probabilistic prediction are the log loss function, the Brier loss function, and the spherical loss function; however, any computable proper loss function can be used for comparison of prediction algorithms. This note shows that the log loss function is most selective in that any prediction algorithm that is optimal for a given data sequence (in the sense of the algorithmic theory of randomness) under the log loss function will be optimal under any computable proper mixable loss function; on the other hand, there is a data sequence and a prediction algorithm that is optimal for that sequence under either of the two other loss functions but not under the log loss function.",

keywords = "algorithmic theory of randomness, mixability, predictive complexity, predictive randomness, probabilistic prediction, proper loss functions",

author = "Vladimir Vovk",

year = "2015",

month = sep,

day = "5",

doi = "10.1007/978-3-319-23534-9_20",

language = "English",

isbn = "978-3-319-23533-2",

volume = "9300",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "307--318",

editor = "Lev Beklemishev and Andreas Blass and Nachum Dershowitz and Berndt Finkbeiner and Wolfram Schulte",

booktitle = "Lecture Notes in Computer Science",

}