paper-with-me

Papers

Double descent in quantum machine learning

2025-01-17 · Marie Kempkes, Aroosa Ijaz, Elies Gil-Fuster, Carlos Bravo-Prieto, Jakob Spiegelberg, Evert van Nieuwenburg, Vedran Dunjko

The double descent phenomenon challenges traditional statistical learning theory by revealing scenarios where larger models do not necessarily lead to reduced performance on unseen data. While this counterintuitive behavior has been observed in a variety of classical machine learning models, particularly modern neural network architectures, it remains elusive within the context of quantum machine learning. In this work, we analytically demonstrate that quantum learning models can exhibit double descent behavior by drawing on insights from linear regression and random matrix theory. Additionally, our numerical experiments on quantum kernel methods across different real-world datasets and system sizes further confirm the existence of a test error peak, a characteristic feature of double descent. Our findings provide evidence that quantum models can operate in the modern, overparameterized regime without experiencing overfitting, thereby opening pathways to improved learning performance beyond traditional statistical learning theory.

📄 PDF Abstract BibTeX arXiv:2501.10077

Code (1)

bpcarlos/double_descent_quantum_ml 공식 구현

Tasks

Learning TheoryQuantum Machine Learning

Methods 이 논문이 사용한 방법론

Linear Regression Linear Regression is a method for modelling a relationship between a dependent variable and independent variables. These models can be fit with numerous approaches. The most…

Similar Papers 제목 키워드 기반

Cautious optimism for deep parameterized quantum circuits

2026-07-23 · Marie Kempkes, Elies Gil-Fuster, Carlos Bravo-Prieto, Aroosa Ijaz 외 arxiv

A central challenge in quantum machine learning is understanding the scaling behavior of parameterized quantum circuits (PQCs). In particular, it remains unclear how their performance on unseen data changes as the number…

Quantum Machine Learning

Classical and Quantum Speedups for Non-Convex Optimization via Energy Conserving Descent

2026-04-14 · Yihang Sun, Huaijin Wang, Patrick Hayden, Jose Blanchet arxiv

The Energy Conserving Descent (ECD) algorithm was recently proposed (De Luca & Silverstein, 2022) as a global non-convex optimization method. Unlike gradient descent, appropriately configured ECD dynamics escape strict l…

Double Descent Demystified: Identifying, Interpreting & Ablating the Sources of a Deep Learning Puzzle

2023-03-24 · Rylan Schaeffer, Mikail Khona, Zachary Robertson, Akhilan Boopathy 외

Double descent is a surprising phenomenon in machine learning, in which as the number of model parameters grows relative to the number of data, test error drops as models grow ever larger into the highly overparameterize…

Learning Theoryregression

On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks

2022-09-29 · Yizhou Liu, Weijie J. Su, Tongyang Li

Classical algorithms are often not effective for solving nonconvex optimization problems where local minima are separated by high barriers. In this paper, we explore possible quantum speedups for nonconvex optimization b…

The Volume of Non-Restricted Boltzmann Machines and Their Double Descent Model Complexity

2020-10-19 · NeurIPS Workshop DL-IG 2020 12 · Prasad Cheema, Mahito Sugiyama

The double descent risk phenomenon has received much interest in the machine learning and statistics community. Motivated through Rissanen's minimum description length (MDL) principle, and Amari's information geometry, w…