Empirical Characterization of Learning Geometry in Hybrid Quantum Forecasting Models

• URL: http://arxiv.org/abs/2608.19497v1
• Date: Wed, 19 Aug 2026 23:24:32 GMT
• Title: Empirical Characterization of Learning Geometry in Hybrid Quantum Forecasting Models
• Abstract summary: We compare the learning dynamics of a compact hybrid quantum forecasting model with a structurally aligned classical baseline.<n>The classical model exhibits stronger early target alignment, whereas the hybrid model generally develops a less concentrated kernel spectrum and smaller kernel drift.
• Score: 1.7643828635590282
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We characterize the learning dynamics of a compact hybrid quantum forecasting model through comparison with a structurally aligned classical baseline. Using stationary harmonic-mixture and nonstationary chirp benchmarks with controlled spectral complexity and data availability, we analyze empirical Neural Tangent Kernel dynamics through kernel-target alignment, kernel drift, spectral concentration, and training loss. The classical model exhibits stronger early target alignment, whereas the hybrid model generally develops a less concentrated kernel spectrum and smaller kernel drift. Despite these distinct optimization geometries, both architectures attain similar held-out performance across the evaluated regimes. Notably, the hybrid model uses 125 trainable parameters compared with 281 for the classical baseline and reaches its validation-selected checkpoint earlier in 15 of 18 frequency conditions. A Fourier-augmented classical baseline does not reproduce the observed training behavior, while a controlled re-uploading ablation shows that repeated encoding systematically modifies both optimization and kernel geometry. These results demonstrate that comparable generalization can emerge from substantially different learning trajectories and that individual NTK diagnostics do not provide monotonic predictors of validation convergence. Rather than claiming a general quantum advantage, the study identifies architecture-dependent learning behavior that is masked by endpoint accuracy alone.

Related papers

• Quantum Hamiltonian Evolution for Coherent Quantum Learning [0.0]
  We introduce Coherent Quantum Learning (CQL), a training framework for quantum learning models in which the model parameters are quantum degrees of freedom evolved under a Hamiltonian that encodes the loss function.
  arXiv  Detail & Related papers  (2026-09-03T10:41:23Z)
• Generalized Convexity and Smoothness via Conjugate Duality: Optimization Theory for Deep Neural Networks [0.0]
  Deep neural network (DNN) training with gradient descent (SGD) and its variants achieves strong empirical performance.<n>Traditional analyses rely on assumptions such as differentiability, convexity, or smoothness.<n>We introduce $mathcalH()$ smoothness and $mathcalH()$-smoothness, which unify convex non-smooth as well as smooth non-smooth objectives.
  arXiv  Detail & Related papers  (2026-08-10T12:24:29Z)
• Quantum Machine Learning Applied to the Sinking of the Titanic [0.0]
  Quantum models were constructed using Pauli entangling and non-entangling expansion-based feature maps and the RealAmplitudes ansatz with up to 50 variational parameters.<n>Model training employed the COBYLA gradient-free framework to minimize the cross-entropy loss.
  arXiv  Detail & Related papers  (2025-08-31T16:00:52Z)
• A theoretical framework for overfitting in energy-based modeling [5.1337384597700995]
  We investigate the impact of limited data on training pairwise energy-based models for inverse problems aimed at identifying interaction networks.<n>We show that optimal points for early stopping arise from the interplay between these timescales and the initial conditions of training.<n>We propose a generalization to arbitrary energy-based models by deriving the neural tangent kernel dynamics of the score function under the score-matching.
  arXiv  Detail & Related papers  (2025-01-31T14:21:02Z)
• Model-Based Qubit Noise Spectroscopy [0.0]
  We derive model-based QNS approaches using inspiration from classical signal processing. We show, through both simulation and experimental data, how these model-based QNS approaches maintain the statistical and computational benefits of their classical counterparts.
  arXiv  Detail & Related papers  (2024-05-20T09:30:38Z)
• A PAC-Bayesian Perspective on the Interpolating Information Criterion [54.548058449535155]
  We show how a PAC-Bayes bound is obtained for a general class of models, characterizing factors which influence performance in the interpolating regime. We quantify how the test error for overparameterized models achieving effectively zero training error depends on the quality of the implicit regularization imposed by e.g. the combination of model, parameter-initialization scheme.
  arXiv  Detail & Related papers  (2023-11-13T01:48:08Z)
• Capturing dynamical correlations using implicit neural representations [85.66456606776552]
  We develop an artificial intelligence framework which combines a neural network trained to mimic simulated data from a model Hamiltonian with automatic differentiation to recover unknown parameters from experimental data. In doing so, we illustrate the ability to build and train a differentiable model only once, which then can be applied in real-time to multi-dimensional scattering data.
  arXiv  Detail & Related papers  (2023-04-08T07:55:36Z)
• NAG-GS: Semi-Implicit, Accelerated and Robust Stochastic Optimizer [45.47667026025716]
  We propose a novel, robust and accelerated iteration that relies on two key elements. The convergence and stability of the obtained method, referred to as NAG-GS, are first studied extensively. We show that NAG-arity is competitive with state-the-art methods such as momentum SGD with weight decay and AdamW for the training of machine learning models.
  arXiv  Detail & Related papers  (2022-09-29T16:54:53Z)
• On the generalization of learning algorithms that do not converge [54.122745736433856]
  Generalization analyses of deep learning typically assume that the training converges to a fixed point. Recent results indicate that in practice, the weights of deep neural networks optimized with gradient descent often oscillate indefinitely.
  arXiv  Detail & Related papers  (2022-08-16T21:22:34Z)
• Convex Analysis of the Mean Field Langevin Dynamics [49.66486092259375]
  convergence rate analysis of the mean field Langevin dynamics is presented. $p_q$ associated with the dynamics allows us to develop a convergence theory parallel to classical results in convex optimization.
  arXiv  Detail & Related papers  (2022-01-25T17:13:56Z)
• Multiplicative noise and heavy tails in stochastic optimization [62.993432503309485]
  empirical optimization is central to modern machine learning, but its role in its success is still unclear. We show that it commonly arises in parameters of discrete multiplicative noise due to variance. A detailed analysis is conducted in which we describe on key factors, including recent step size, and data, all exhibit similar results on state-of-the-art neural network models.
  arXiv  Detail & Related papers  (2020-06-11T09:58:01Z)
• Kernel and Rich Regimes in Overparametrized Models [69.40899443842443]
  We show that gradient descent on overparametrized multilayer networks can induce rich implicit biases that are not RKHS norms. We also demonstrate this transition empirically for more complex matrix factorization models and multilayer non-linear networks.
  arXiv  Detail & Related papers  (2020-02-20T15:43:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.