arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.06003quant-ph
收藏

套期保值的量子算法和伊辛模型的学习

Quantum algorithms for hedging and the learning of Ising models

Patrick Rebentrost, Yassine Hamoudi, Maharshi Ray, Xin Wang, Siyi Yang, Miklos Santha

摘要:

在线学习的典型算法是Freund和Schapire的Hedge算法。在多轮中选择分配到不同的策略,每轮都会为每个策略带来相应的损失。即使在对抗的情况下,该算法也能获得对总损失的有利保证。这项工作提出了量子算法,这种在线学习的神谕设置。对于$T$时间步长和$N$策略,我们展示了大约$O \left ({\rm poly} (T) \sqrt{N} \right)$的运行时间,用于估计损失和通过采样对单个策略进行投注。此外,我们讨论了一个量子模拟的Sparsitron,一个机器学习算法的基础上对冲算法。量子算法继承了经典算法的可证明学习保证,并表现出多项式加速比。加速可能与金融相关,例如对冲风险,以及机器学习,例如学习广义线性模型或伊辛模型。

英文摘要:

A paradigmatic algorithm for online learning is the Hedge algorithm by Freund and Schapire. An allocation into different strategies is chosen for multiple rounds and each round incurs corresponding losses for each strategy. The algorithm obtains a favorable guarantee for the total losses even in an adversarial situation. This work presents quantum algorithms for such online learning in an oracular setting. For $T$ time steps and $N$ strategies, we exhibit run times of about $O \left ({\rm poly} (T) \sqrt{N} \right)$ for estimating the losses and for betting on individual strategies by sampling. In addition, we discuss a quantum analogue of the Sparsitron, a machine learning algorithm based on the Hedge algorithm. The quantum algorithm inherits the provable learning guarantees from the classical algorithm and exhibits polynomial speedups. The speedups may find relevance in finance, for example for hedging risks, and machine learning, for example for learning generalized linear models or Ising models.

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

↑