Exp-Concavity of Proper Composite Losses

The goal of online prediction with expert advice is to find a decision strategy which will perform almost as well as the best expert in a given pool of experts, on any sequence of outcomes. This problem has been widely studied and O(√T) and O(logT) regret bounds can be achieved for convex losses (citezinkevich2003online) and strictly convex losses with bounded first and second derivatives (citehazan2007logarithmic) respectively. In special cases like the Aggregating Algorithm (citevovk1995game) with mixable losses and the Weighted Average Algorithm (citekivinen1999averaging) with exp-concave losses, it is possible to achieve O(1) regret bounds. citevan2012exp has argued that mixability and exp-concavity are roughly equivalent under certain conditions. Thus by understanding the underlying relationship between these two notions we can gain the best of both algorithms (strong theoretical performance guarantees of the Aggregating Algorithm and the computational efficiency of the Weighted Average Algorithm). In this paper we provide a complete characterization of the exp-concavity of any proper composite loss. Using this characterization and the mixability condition of proper losses (citevan2012mixability), we show that it is possible to transform (re-parameterize) any β-mixable binary proper loss into a β-exp-concave composite loss with the same β. In the multi-class case, we propose an approximation approach for this transformation.