Improved Quantum Boosting

2020-09-17 · 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.

📄 PDF Abstract BibTeX arXiv:2009.08360

Code (0)

등록된 구현이 없습니다.

Efficient Quantum Agnostic Improper Learning of Decision Trees

2022-10-01 · Sagnik Chatterjee, Tharrmashastha SAPV, Debajyoti Bera

The agnostic setting is the hardest generalization of the PAC model since it is akin to learning with adversarial noise. In this paper, we give a poly$(n,t,{\frac{1}{\varepsilon}})$ quantum algorithm for learning size $t…

Ensemble Learning

Boosting the Performance of Quantum Annealers using Machine Learning

2022-03-04 · Jure Brence, Dragan Mihailović, Viktor Kabanov, Ljupčo Todorovski 외

Noisy intermediate-scale quantum (NISQ) devices are spearheading the second quantum revolution. Of these, quantum annealers are the only ones currently offering real world, commercial applications on as many as 5000 qubi…

BIG-bench Machine Learning

Learning to Measure Quantum Neural Networks

2025-01-10 · Samuel Yen-Chi Chen, Huan-Hsin Tseng, Hsin-Yi Lin, Shinjae Yoo

The rapid progress in quantum computing (QC) and machine learning (ML) has attracted growing attention, prompting extensive research into quantum machine learning (QML) algorithms to solve diverse and complex problems. D…

Quantum Machine Learning

Quantum Boosting

2020-02-12 · ICML 2020 1 · Srinivasan Arunachalam, Reevu Maity

Suppose we have a weak learning algorithm $\mathcal{A}$ for a Boolean-valued problem: $\mathcal{A}$ produces hypotheses whose bias $\gamma$ is small, only slightly better than random guessing (this could, for instance, b…

Quantum Inspired Adaptive Boosting

2021-02-01 · Bálint Daróczy, Katalin Friedl, László Kabódi, Attila Pereszlényi 외

Building on the quantum ensemble based classifier algorithm of Schuld and Petruccione [arXiv:1704.02146v1], we devise equivalent classical algorithms which show that this quantum ensemble method does not have advantage o…