arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.02369cs.LGphysics.data-anstat.ML
收藏

用于训练机器学习模型的QUBO公式

QUBO Formulations for Training Machine Learning Models

UT-Battelle, LLC(UT-Battelle有限责任公司);U.S. Department of Energy(美国能源部);Oak Ridge Leadership Computing Facility(橡树岭领导计算设施);DOE Office of Science(美国能源部科学办公室);Oak Ridge National Laboratory(橡树岭国家实验室);Auburn University(奥本大学);Washington University in St. Louis(圣路易斯华盛顿大学)

Prasanna Date, Davis Arthur, Lauren Pusey-Nazzaro

摘要:

在经典计算机上训练机器学习模型通常是一个时间和计算密集型过程。随着摩尔定律的终结以及对使用机器学习进行大规模数据分析的需求不断增长,我们必须利用量子计算等非传统计算范式来有效地训练机器学习模型。像D-Wave 2000 Q这样的绝热量子计算机可以近似解决NP-难优化问题,例如二次无约束二进制优化(QUBO),比经典计算机更快。由于许多机器学习问题也是NP难的,我们相信绝热量子计算机可能有助于在后摩尔定律时代有效地训练机器学习模型。为了解决绝热量子计算机上的问题,必须将其表述为QUBO问题,这本身就是一项具有挑战性的任务。在本文中,我们制定了三个机器学习模型的训练问题-线性回归,支持向量机(SVM)和等大小的k-means聚类-作为QUBO问题,使他们能够有效地在绝热量子计算机上训练。我们还分析了我们的配方的时间和空间复杂度,并将其与用于训练这些机器学习模型的最先进的经典算法进行比较。我们表明,我们的配方的时间和空间复杂度是更好的(在SVM和大小相等的k-均值聚类的情况下)或等效(在线性回归的情况下),他们的经典同行。

英文摘要:

Training machine learning models on classical computers is usually a time and compute intensive process. With Moore's law coming to an end and ever increasing demand for large-scale data analysis using machine learning, we must leverage non-conventional computing paradigms like quantum computing to train machine learning models efficiently. Adiabatic quantum computers like the D-Wave 2000Q can approximately solve NP-hard optimization problems, such as the quadratic unconstrained binary optimization (QUBO), faster than classical computers. Since many machine learning problems are also NP-hard, we believe adiabatic quantum computers might be instrumental in training machine learning models efficiently in the post Moore's law era. In order to solve a problem on adiabatic quantum computers, it must be formulated as a QUBO problem, which is a challenging task in itself. In this paper, we formulate the training problems of three machine learning models---linear regression, support vector machine (SVM) and equal-sized k-means clustering---as QUBO problems so that they can be trained on adiabatic quantum computers efficiently. We also analyze the time and space complexities of our formulations and compare them to the state-of-the-art classical algorithms for training these machine learning models. We show that the time and space complexities of our formulations are better (in the case of SVM and equal-sized k-means clustering) or equivalent (in case of linear regression) to their classical counterparts.

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

↑