Combining Expert Advice Efficiently
| dc.creator | Koolen, Wouter | |
| dc.creator | de Rooij, Steven | |
| dc.date | 2008-02-14 | |
| dc.date | 2008-02-15 | |
| dc.date.accessioned | 2026-07-07T09:20:47Z | |
| dc.date.available | 2026-07-07T09:20:47Z | |
| dc.description | We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficiently calculate, among other things, how the expert predictions should be weighted according to the model. We cast many existing models as HMMs and recover the best known running times in each case. We also describe two new models: the switch distribution, which was recently developed to improve Bayesian/Minimum Description Length model selection, and a new generalisation of the fixed share algorithm based on run-length coding. We give loss bounds for all models and shed new light on their relationships. | |
| dc.description | 50 pages | |
| dc.identifier | https://arxiv.org/abs/0802.2015 | |
| dc.identifier | http://arxiv.org/abs/0802.2015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154830 | |
| dc.subject | Machine Learning | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Information Theory | |
| dc.subject | G.3 | |
| dc.title | Combining Expert Advice Efficiently | |
| dc.type | text |