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

Improved Quantum Boosting

University of Amsterdam(阿姆斯特丹大学);QuSoft(QuSoft 量子软件研究中心);CWI(荷兰国家数学与计算机科学研究中心)

Adam Izdebski, Ronald de Wolf

英文摘要:

Boosting is a general method to convert a weak learner (which generates hypotheses that are just slightly better than random) into a strong learner (which generates hypotheses that are much better than random). Recently, Arunachalam and Maity gave the first quantum improvement for boosting, by combining Freund and Schapire's AdaBoost algorithm with a quantum algorithm for approximate counting. Their booster is faster than classical boosting as a function of the VC-dimension of the weak learner's hypothesis class, but worse as a function of the quality of the weak learner. In this paper we give a substantially faster and simpler quantum boosting algorithm, based on Servedio's SmoothBoost algorithm.

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

↑