通过不断增长的专家集成来适应非平稳性
Adapting to Non-stationarity with Growing Expert Ensembles
摘要:
当处理具有复杂非平稳性的时间序列时,对个体实现的低追溯后悔比期望中的低预期风险是一个更合适的目标。在线学习算法提供了这种形式的有力保证,并且经常被提议用于非平稳过程,因为它们能够在不同的预测者或“专家”之间切换。然而,现有的方法假设一组专家的预测是结合在一起,都在一开始,这是不合理的,当处理一个真正的历史或进化系统。我们展示了如何修改“固定份额”算法,以跟踪最好的专家,以应付一个稳定增长的专家组,通过拟合新的模型,新的数据,因为它变得可用,并获得遗憾的范围不断增长的合奏。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。