Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.07040 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912576709853184 |
|---|---|
| author | Rathi, Neeshu Kumar, Sanjeev |
| author_facet | Rathi, Neeshu Kumar, Sanjeev |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_07040 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Quantum Bagging Algorithm with Unsupervised Base Learners for Label Corrupted Datasets Rathi, Neeshu Kumar, Sanjeev Quantum Physics Machine Learning 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. |
| title | A Quantum Bagging Algorithm with Unsupervised Base Learners for Label Corrupted Datasets |
| topic | Quantum Physics Machine Learning |
| url | https://arxiv.org/abs/2509.07040 |