Loss functions, complexities, and the Legendre transformation

The paper introduces a way of re-constructing a loss function from predictive complexity. We show that a loss function and expectations of the corresponding predictive complexity w.r.t. the Bernoulli distribution are related through the Legendre transformation. It is shown that if two loss functions specify the same complexity then they are equivalent in a strong sense. The expectations are also related to the so-called generalized entropy. c © 2003 Elsevier B.V. All rights reserved.

[1]  David Haussler,et al.  Sequential Prediction of Individual Sequences Under General Loss Functions , 1998, IEEE Trans. Inf. Theory.

[2]  Vladimir Vovk,et al.  Aggregating strategies , 1990, COLT '90.

[3]  Vladimir Vovk,et al.  A game of prediction with expert advice , 1995, COLT '95.

[4]  V. Tikhomirov,et al.  Optimal Control , 1987 .

[5]  Vladimir Vovk,et al.  Universal portfolio selection , 1998, COLT' 98.

[6]  David Haussler,et al.  How to use expert advice , 1993, STOC.

[7]  Manfred K. Warmuth,et al.  The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.