Quantum Boosting using Domain-Partitioning Hypotheses
Debajyoti Bera, Rohan Bhatia, Parmeet Singh Chani, Sagnik Chatterjee

TL;DR
This paper introduces QRealBoost, a quantum boosting algorithm that extends quantum boosting to non-binary hypotheses, achieving quadratic and polynomial speedups over classical and prior quantum methods, with empirical validation on real datasets.
Contribution
It develops QRealBoost, the first quantum boosting algorithm for non-binary hypotheses, with proven convergence, generalization, and quantum speedup guarantees.
Findings
QRealBoost retains quadratic speedup over QAdaBoost.
QRealBoost achieves polynomial speedup over QAdaBoost.
Empirical results show promising convergence performance on datasets.
Abstract
Boosting is an ensemble learning method that converts a weak learner into a strong learner in the PAC learning framework. Freund and Schapire designed the Godel prize-winning algorithm named AdaBoost that can boost learners, which output binary hypotheses. Recently, Arunachalam and Maity presented the first quantum boosting algorithm with similar theoretical guarantees. Their algorithm, which we refer to as QAdaBoost henceforth, is a quantum adaptation of AdaBoost and only works for the binary hypothesis case. QAdaBoost is quadratically faster than AdaBoost in terms of the VC-dimension of the hypothesis class of the weak learner but polynomially worse in the bias of the weak learner. Izdebski et al. posed an open question on whether we can boost quantum weak learners that output non-binary hypothesis. In this work, we address this open question by developing the QRealBoost algorithm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Quantum Computing Algorithms and Architecture · Stochastic Gradient Optimization Techniques
