Understanding Generalization in Quantum Machine Learning with Margins

Tak Hur, Daniel K. Park
11/11/2024
quant-phcs.LG

No official code found. Best implementation: takh04/Q-margin (0 stars, Apache-2.0, last commit 2025-07-29). 1 more below.

Abstract

Understanding and improving generalization capabilities is crucial for both classical and quantum machine learning (QML). Recent studies have revealed shortcomings in current generalization theories, particularly those relying on uniform bounds, across both classical and quantum settings. In this work, we present a margin-based generalization bound for QML models, providing a more reliable framework for evaluating generalization. Our experimental studies on the quantum phase recognition (QPR) dataset demonstrate that margin-based metrics are strong predictors of generalization performance, outperforming traditional metrics like parameter count. By connecting this margin-based metric to quantum information theory, we demonstrate how to enhance the generalization performance of QML through a classical-quantum hybrid approach when applied to classical data.

View on arXivView PDF

Code Implementations(2)

takh04/Q-marginCommunity73%
Apache-2.0

Understanding Generalizations in Quantum Machine Learning with Margins

00Python, Jupyter NotebookAug 13, 20241 years agoApache-2.0
Apache-2.0

Understanding generalization in quantum machine learning with margin

00Python, Jupyter NotebookDec 15, 20241 years agoApache-2.0

Similar Papers

Cite this paper

@article{hur2024understanding,
  title  = {Understanding Generalization in Quantum Machine Learning with Margins},
  author = {Tak Hur and Daniel K. Park},
  year   = {2024},
  eprint = {2411.06919},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.06919v1},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.06919.svg)](https://codeofpaper.com/paper/2411.06919)

Discussion