mlsanityData to 13 Oct 2026

Quantum Maximum Likelihood Prediction via Hilbert Space Embeddings

arXiv 2602.18364 ↗First posted 20 Feb 2026cs.IT cs.LG math.ITcited by 0

Not on the map. Why?

Abstract (arXiv)

Maximum likelihood prediction (MLP) is a core task at the heart of modern large language models. Here, we study a quantum version of this task for a simplified data model consisting of independent and identically distributed samples, as a first step. The quantum maximum likelihood predictor (QMLP) is obtained by embedding of empirical probability distributions into quantum states and performing a minimization of quantum relative entropy over a given class of states. We derive non-asymptotic performance guarantees for QMLP in terms of convergence rates and concentration inequalities, both in trace norm and quantum relative entropy. Our approach provides a unified framework to handle MLP within both classical and quantum LLMs. We also consider the related problem of quantum information projection and generalize the quantum Pythagorean theorem to mixture families specified by possibly non-self-adjoint linear constraints. We further show that the Pythagorean inequality continues to hold in the infinite-dimensional setting whenever the convex information-projection problem attains a finite minimum.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 22 of its 80 references that are in the map. First posted on arXiv 20 Feb 2026.

Builds on

22 of 80 references.

References · 22

  1. 2021An Explanation of In-context Learning as Implicit Bayesian Inferencecited by 925
  2. 2022What Can Transformers Learn In-Context? A Case Study of Simple Function Classescited by 706
  3. 2022What learning algorithm is in-context learning? Investigations with linear modelscited by 676
  4. 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 360
  5. 2023Transformers as Statisticians: Provable In-Context Learning with In-Context Algorithm Selectioncited by 293
  6. 2017Size-Independent Sample Complexity of Neural Networkscited by 289
  7. 2024The Evolution of Statistical Induction Heads: In-Context Learning Markov Chainscited by 116
  8. 2024An Information-Theoretic Analysis of In-Context Learningcited by 39
  9. 2022Information Theory with Kernel Methodscited by 37
  10. 2016Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Modelscited by 26
  11. 2025Understanding LLM Behaviors via Compression: Data Generation, Knowledge Acquisition and Scaling Lawscited by 15
  12. 2024Towards Understanding the Universality of Transformers for Next-Token Predictioncited by 9
10 more
  1. 2017Semidefinite approximations of the matrix logarithmcited by 7
  2. 2015Optimal Estimation of Low Rank Density Matricescited by 6
  3. 2021Minimizing Quantum Renyi Divergences via Mirror Descent with Polyak Step Sizecited by 3
  4. 2024Learning to Embed Distributions via Maximum Kernel Entropycited by 3
  5. 2025Performance Guarantees for Quantum Neural Estimation of Entropiescited by 3
  6. 2022Optimal self-concordant barriers for quantum relative entropiescited by 2
  7. 2023Transformers are Universal Predictorscited by 2
  8. 2024Interior Point Methods for Structured Quantum Relative Entropy Optimization Problemscited by 2
  9. 2025Fundamentals of quantum Boltzmann machine learning with visible and hidden unitscited by 2
  10. 2025Likelihood Ratio Tests by Kernel Gaussian Embeddingcited by 1

Built on by

Not cited yet.