atlas

Research map / Learning theory and algorithms / Sample complexity

Quantum Boosting

ICML 2020 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of ranking and selection · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use quantum boosting instead of classical AdaBoostWeak quantum PAC learner for a Boolean concept class · Strong PAC learningtime complexity: \widetilde{O}\Bigg(\sqrt{\VC({\mathcal C})} \cdot Q({\mathcal C})^{3/2} \cdot \frac{n^2}{\gamma^{11}}\Bigg); classical cHelped
Estimate weighted errors using quantum techniques and use modified distribution updates that tolerate approximate estimatesAdaBoost-style quantum boosting · Training-error reduction on a training set Stime complexity: \widetilde{O}(n^2 \sqrt{M}\cdot Q({\mathcal C})^{3/2}); training error at most 1/10Helped
Use classical AdaBoost to boost a weak quantum learnerWeak quantum PAC learner · Strong PAC learningtime complexity: \widetilde{O}\Bigg(\frac{\VC({\mathcal C})}{\eta^2}\cdot Q({\mathcal C}) \cdot \frac{n^2}{\gamma^4}\Bigg)Mixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy