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 √ ) O(T) and O(logT) O(logT) regret bounds can be achieved for convex losses and strictly convex losses with bounded first and second derivatives respectively. In special cases like the Aggregating Algorithm with mixable losses and the Weighted Average Algorithm...[Show more]
|Collections||ANU Research Publications|
|Source:||Exp-Concavity of Proper Composite Losses|
|01_Kamalaruban_Exp-Concavity_of_Proper_2015.pdf||1.5 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.