Statistics – Machine Learning
Scientific paper
2011-03-04
Statistics
Machine Learning
9 pages, 1 figure; CMU Statistics Technical Report. v2: Added empirical example, revised discussion of related work
Scientific paper
When dealing with time series with complex non-stationarities, low retrospective regret on individual realizations is a more appropriate goal than low prospective risk in expectation. Online learning algorithms provide powerful guarantees of this form, and have often been proposed for use with non-stationary processes because of their ability to switch between different forecasters or ``experts''. However, existing methods assume that the set of experts whose forecasts are to be combined are all given at the start, which is not plausible when dealing with a genuinely historical or evolutionary system. We show how to modify the ``fixed shares'' algorithm for tracking the best expert to cope with a steadily growing set of experts, obtained by fitting new models to new data as it becomes available, and obtain regret bounds for the growing ensemble.
Clauset Aaron
Jacobs Abigail Z.
Klinkner Kristina Lisa
Shalizi Cosma Rohilla
No associations
LandOfFree
Adapting to Non-stationarity with Growing Expert Ensembles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Adapting to Non-stationarity with Growing Expert Ensembles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adapting to Non-stationarity with Growing Expert Ensembles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-321595