arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2206.09313cs.LGcs.AIquant-phstat.ML
收藏

机器学习中的惰性、贫瘠高原与噪声

Laziness, Barren Plateau, and Noise in Machine Learning

Pritzker School of Molecular Engineering, The University of Chicago(芝加哥大学普利兹克分子工程学院);Chicago Quantum Exchange(芝加哥量子交易所);Kadanoff Center for Theoretical Physics, The University of Chicago(芝加哥大学卡达诺夫理论物理中心);qBraid Co.(qBraid公司)

Junyu Liu, Zexi Lin, Liang Jiang

AI总结:

本文定义并区分了机器学习中的“惰性”与量子“贫瘠高原”现象,借助神经正切核理论分析过参数化区域中的损失景观与噪声影响,证明变分量子算法在过参数化下具有噪声鲁棒性,为近期量子算法提供理论支持。

摘要:

我们定义“惰性”来描述神经网络(无论是经典还是量子)变分参数更新的大幅抑制现象。在量子情形下,对于随机化的变分量子电路,这种抑制随量子比特数呈指数级增长。我们讨论了量子机器学习中由量子物理学家在文献中提出的“贫瘠高原”与“惰性”之间的区别,前者用于描述梯度下降过程中损失函数景观的平坦性。我们借助神经正切核理论对这两种现象提出了新的理论理解。对于无测量噪声的理想量子电路,在具有大量可训练变分角度的过参数化区域中,损失函数景观是复杂的。相反,在优化的随机起始点附近,存在大量足够好的局部极小值,它们能够最小化均方损失函数,此时我们仍然存在量子惰性,但不存在贫瘠高原。然而,在有限的迭代次数内以及量子控制和量子感知精度较低的情况下,这种复杂景观是不可见的。此外,我们通过假设直观的噪声模型来研究优化过程中噪声的影响,并表明变分量子算法在过参数化区域中具有噪声鲁棒性。我们的工作将量子贫瘠高原的表述精确化为一种精度表述,并在特定噪声模型中证明了该表述的合理性,为近期变分量子算法注入了新的希望,并提供了与经典机器学习的理论联系。本文提供了关于量子贫瘠高原的概念性视角,并讨论了梯度下降动力学。

英文摘要:

We define \emph{laziness} to describe a large suppression of variational parameter updates for neural networks, classical or quantum. In the quantum case, the suppression is exponential in the number of qubits for randomized variational quantum circuits. We discuss the difference between laziness and \emph{barren plateau} in quantum machine learning created by quantum physicists in \cite{mcclean2018barren} for the flatness of the loss function landscape during gradient descent. We address a novel theoretical understanding of those two phenomena in light of the theory of neural tangent kernels. For noiseless quantum circuits, without the measurement noise, the loss function landscape is complicated in the overparametrized regime with a large number of trainable variational angles. Instead, around a random starting point in optimization, there are large numbers of local minima that are good enough and could minimize the mean square loss function, where we still have quantum laziness, but we do not have barren plateaus. However, the complicated landscape is not visible within a limited number of iterations, and low precision in quantum control and quantum sensing. Moreover, we look at the effect of noises during optimization by assuming intuitive noise models, and show that variational quantum algorithms are noise-resilient in the overparametrization regime. Our work precisely reformulates the quantum barren plateau statement towards a precision statement and justifies the statement in certain noise models, injects new hope toward near-term variational quantum algorithms, and provides theoretical connections toward classical machine learning. Our paper provides conceptual perspectives about quantum barren plateaus, together with discussions about the gradient descent dynamics in \cite{together}.

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

↑