Learning complexity gradually in quantum machine learning models
Erik Recio-Armengol, Franz J. Schreiber, Jens Eisert, Carlos, Bravo-Prieto

TL;DR
This paper introduces a data-centric training framework for quantum machine learning that emphasizes informative data points, inspired by classical curriculum learning, to improve model training efficiency and effectiveness.
Contribution
It proposes a novel training approach that prioritizes informative samples in quantum models, integrating classical curriculum learning concepts with quantum training strategies.
Findings
Improved training efficiency for quantum models.
Theoretical insights into data prioritization benefits.
Validated approach on recognition tasks of quantum phases.
Abstract
Quantum machine learning is an emergent field that continues to draw significant interest for its potential to offer improvements over classical algorithms in certain areas. However, training quantum models remains a challenging task, largely because of the difficulty in establishing an effective inductive bias when solving high-dimensional problems. In this work, we propose a training framework that prioritizes informative data points over the entire training set. This approach draws inspiration from classical techniques such as curriculum learning and hard example mining to introduce an additional inductive bias through the training data itself. By selectively focusing on informative samples, we aim to steer the optimization process toward more favorable regions of the parameter space. This data-centric approach complements existing strategies such as warm-start initialization…
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
TopicsQuantum Computing Algorithms and Architecture
