COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Statistics > Trading-Off Payments and Accuracy in Online Classification
Trading-Off Payments and Accuracy in Online ClassificationAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Qingyuan Zhao. We consider online binary classification where in each round, before making a prediction the learner can choose to ask some a number of stochastic experts for their advice. In contrast to the standard experts problem, we investigate the case where each expert needs to be paid before they provide their advice, and that the amount we pay them directly influences the accuracy of their prediction through some unknown productivity function. In each round, the learner must decide how much to pay each expert and then make a prediction. They incur a cost equal to a weighted sum of the prediction error and upfront payments for all experts. We introduce an online learning algorithm and analyse its total cost compared to that of a predictor which knows the productivity of all experts in advance. In order to achieve this result, we combine Lipschitz bandits and online classification with surrogate losses. Joint work with: Dirk van der Hoeven, Hao Qiu, Nicolo Cesa-Bianchi This talk is part of the Statistics series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsInternational Political Economy Research Group International Political Economy Research Group Babraham SeminarOther talksLunch at the Moller Institute Multiscale Modelling of Behaviour-induced Critical Regimes During Epidemics Using simulations to investigate the mechanical properties of peptidoglycan The role of the extracellular matrix as a memory hub to coordinate collective cell behaviour during vascular growth Telling Tree Stories through Laser Scans and AI Mediated Panel Discussion |