arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.12732math.OCcs.GTcs.LGmath.AP
收藏

基于历史相关专家意见的二元序列预测的PDE方法

A PDE Approach to the Prediction of a Binary Sequence with Advice from Two History-Dependent Experts

University of Minnesota(明尼苏达大学);Courant Institute of Mathematical Sciences, New York University(纽约大学库朗数学科学研究所)

Nadejda Drenska, Robert V. Kohn

摘要:

二进制序列的预测是在线机器学习的一个经典例子。我们喜欢称之为“股票预测问题”,将序列视为股票的价格历史,在每个时间步长上涨或下跌一个单位。在这个问题中,投资者可以获得两个或更多“专家”的预测,并努力减少她对表现最好的专家的最后一次遗憾。概率不起作用;相反,市场被假定为是对抗性的。我们考虑的情况下,有两个历史依赖的专家,其预测是由d最近的股票走势。集中在一个适当的连续极限,并使用最优控制,图论,和偏微分方程的方法,我们讨论的投资者和对抗性市场的策略,我们确定相关的上限和下界的投资者的最后一次后悔。当d小于4时,我们的上界和下界合并,因此所提出的策略是渐近最优的。与其他近期将偏微分方程应用于预测的方法相比,我们的方法有一个新的元素:有两个时间尺度,因为最近的历史在每一步都在变化,而遗憾积累得更慢。

英文摘要:

The prediction of a binary sequence is a classic example of online machine learning. We like to call it the 'stock prediction problem,' viewing the sequence as the price history of a stock that goes up or down one unit at each time step. In this problem, an investor has access to the predictions of two or more 'experts,' and strives to minimize her final-time regret with respect to the best-performing expert. Probability plays no role; rather, the market is assumed to be adversarial. We consider the case when there are two history-dependent experts, whose predictions are determined by the d most recent stock moves. Focusing on an appropriate continuum limit and using methods from optimal control, graph theory, and partial differential equations, we discuss strategies for the investor and the adversarial market, and we determine associated upper and lower bounds for the investor's final-time regret. When d is less than 4 our upper and lower bounds coalesce, so the proposed strategies are asymptotically optimal. Compared to other recent applications of partial differential equations to prediction, ours has a new element: there are two timescales, since the recent history changes at every step whereas regret accumulates more slowly.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑