mlsanityData to 14 Oct 2026

Overfitting in quantum machine learning and entangling dropout

arXiv 2205.11446 ↗First posted 23 May 2022quant-ph cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

The ultimate goal in machine learning is to construct a model function that has a generalization capability for unseen dataset, based on given training dataset. If the model function has too much expressibility power, then it may overfit to the training data and as a result lose the generalization capability. To avoid such overfitting issue, several techniques have been developed in the classical machine learning regime, and the dropout is one such effective method. This paper proposes a straightforward analogue of this technique in the quantum machine learning regime, the entangling dropout, meaning that some entangling gates in a given parametrized quantum circuit are randomly removed during the training process to reduce the expressibility of the circuit. Some simple case studies are given to show that this technique actually suppresses the overfitting.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 8 of its 17 references that are in the map. First posted on arXiv 23 May 2022.

Builds on

8 of 17 references.

References · 8

  1. 2018Supervised learning with quantum enhanced feature spacescited by 665
  2. 2020The effect of data encoding on the expressive power of variational quantum machine learning modelscited by 333
  3. 2016Quantum Machine Learningcited by 326
  4. 2021Generalization in quantum machine learning from few training datacited by 216
  5. 2021Encoding-dependent generalization bounds for parametrized quantum circuitscited by 82
  6. 2019Input Redundancy for Parameterized Quantum Circuitscited by 33
  7. 2020Reformulation of the No-Free-Lunch Theorem for Entangled Data Setscited by 28
  8. 2021Structural risk minimization for quantum linear classifierscited by 24

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 3; 2026: 1.

9 papers.