Pith. sign in

REVIEW

A Quantum Bagging Algorithm with Unsupervised Base Learners for Label Corrupted Datasets

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2509.07040 v1 pith:7W4ZRHD5 submitted 2025-09-08 quant-ph cs.LG

classification quant-phcs.LG
keywords baggingquantumlabelunsupervisedalgorithmbaselearnerslearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The development of noise-resilient quantum machine learning (QML) algorithms is critical in the noisy intermediate-scale quantum (NISQ) era. In this work, we propose a quantum bagging framework that uses QMeans clustering as the base learner to reduce prediction variance and enhance robustness to label noise. Unlike bagging frameworks built on supervised learners, our method leverages the unsupervised nature of QMeans, combined with quantum bootstrapping via QRAM-based sampling and bagging aggregation through majority voting. Through extensive simulations on both noisy classification and regression tasks, we demonstrate that the proposed quantum bagging algorithm performs comparably to its classical counterpart using KMeans while exhibiting greater resilience to label corruption than supervised bagging methods. This highlights the potential of unsupervised quantum bagging in learning from unreliable data.

Discussion (0). Continue with ORCID to comment.

Pith tools