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

Quantum Alphatron:带核函数与噪声的学习场景下的量子优势

Quantum Alphatron: quantum advantage for learning with kernels and noise

Siyi Yang, Naixu Guo, Miklos Santha, Patrick Rebentrost

AI总结:

本研究提出容错场景下的量子版Alphatron算法,可在核学习与两层神经网络学习中实现多项式级时间加速,为带核的量子样本学习研究提供了新进展。

摘要:

在机器学习与量子计算的交叉领域,一个重要问题是哪些分布可以在最优样本复杂度下被可证明地学习,且具备量子加速的时间复杂度。在经典场景中,Klivans和Goel提出了\textit{Alphatron}(阿尔法创算法),这是一种用于学习与核回归相关分布的算法,他们还将其应用于两层神经网络的学习。在本研究中,我们提出了容错场景下的Alphatron量子版本。在一个定义明确的学习模型中,该量子算法能够针对底层概念类的大范围参数提供多项式级别的加速。我们讨论了两种加速类型:一种用于核矩阵求值,另一种用于随机梯度下降过程中的梯度求值。我们还探讨了两层神经网络学习场景下的量子优势。本研究为带核函数、基于样本的量子学习研究做出了贡献。

英文摘要:

At the interface of machine learning and quantum computing, an important question is what distributions can be learned provably with optimal sample complexities and with quantum-accelerated time complexities. In the classical case, Klivans and Goel discussed the \textit{Alphatron}, an algorithm to learn distributions related to kernelized regression, which they also applied to the learning of two-layer neural networks. In this work, we provide quantum versions of the Alphatron in the fault-tolerant setting. In a well-defined learning model, this quantum algorithm is able to provide a polynomial speedup for a large range of parameters of the underlying concept class. We discuss two types of speedups, one for evaluating the kernel matrix and one for evaluating the gradient in the stochastic gradient descent procedure. We also discuss the quantum advantage in the context of learning of two-layer neural networks. Our work contributes to the study of quantum learning with kernels and from samples.

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

↑