arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0912.0779quant-phcs.LG
收藏

用量子绝热算法训练大规模分类器

Training a Large Scale Classifier with the Quantum Adiabatic Algorithm

Hartmut Neven, Vasil S. Denchev, Geordie Rose, William G. Macready

摘要:

在以前的出版物中,我们提出了离散的全局优化作为一种方法来训练一个强的二元分类器构建为一个阈值和弱分类器。我们的动机是将分类器的训练转换为适合量子绝热算法解决的格式。应用绝热量子计算(AQC)有望产生优于经典启发式求解器的解决方案。有趣的是,我们发现通过使用启发式求解器来获得近似解,我们已经可以获得比标准方法AdaBoost更大的优势。在这次交流中,我们将基线方法推广到大规模分类器训练。大规模是指候选弱分类器的字典的基数或强分类器中使用的弱学习器的数量超过了在单个全局优化中可以有效处理的变量的数量。对于这种情况下,我们提出了一种迭代和分段的方法,其中弱分类器的一个子集,在每次迭代中选择通过全局优化。然后通过连接弱分类器的子集来构造强分类器。我们在数值研究中表明,广义方法再次成功地与AdaBoost竞争。我们还提供了理论论据,为什么提出的优化方法,它不仅最大限度地减少经验损失,而且还增加了L0-范数正则化,是优于版本的提升,只有最小化的经验损失。通过进行量子蒙特卡罗模拟,我们收集的证据表明,量子绝热算法能够有效地处理一般的训练问题。

英文摘要:

In a previous publication we proposed discrete global optimization as a method to train a strong binary classifier constructed as a thresholded sum over weak classifiers. Our motivation was to cast the training of a classifier into a format amenable to solution by the quantum adiabatic algorithm. Applying adiabatic quantum computing (AQC) promises to yield solutions that are superior to those which can be achieved with classical heuristic solvers. Interestingly we found that by using heuristic solvers to obtain approximate solutions we could already gain an advantage over the standard method AdaBoost. In this communication we generalize the baseline method to large scale classifier training. By large scale we mean that either the cardinality of the dictionary of candidate weak classifiers or the number of weak learners used in the strong classifier exceed the number of variables that can be handled effectively in a single global optimization. For such situations we propose an iterative and piecewise approach in which a subset of weak classifiers is selected in each iteration via global optimization. The strong classifier is then constructed by concatenating the subsets of weak classifiers. We show in numerical studies that the generalized method again successfully competes with AdaBoost. We also provide theoretical arguments as to why the proposed optimization method, which does not only minimize the empirical loss but also adds L0-norm regularization, is superior to versions of boosting that only minimize the empirical loss. By conducting a Quantum Monte Carlo simulation we gather evidence that the quantum adiabatic algorithm is able to handle a generic training problem efficiently.

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

↑