Geodesic Quantum $f$-Divergences

arXiv:2608.15833 2026 Regularization 1 ideas extracted · analyzed Sep 1, 2026

What the math gives to ML

The paper supplies a continuous, noncommutative interpolation between standard Petz and maximal quantum f-divergences through an affine-invariant geodesic of relative modular operators. This is transferable to neural models whose predictions or embeddings are positive-definite matrices, including covariance networks, density-matrix classifiers, and matrix-valued representation learners. The key asset is that operator-convex generators preserve data processing along completely positive trace-preserving layers, while the geodesic parameter t provides a tunable tradeoff between conventional and maximal matrix discrepancies. A practical first use is a geodesic divergence auxiliary loss with differentiable eigendecomposition or Lanczos evaluation, combined with an ordinary task loss to prevent representation collapse.

Ideas from this paper

Unverified 2026

Geodesic Matrix Divergence Loss

Replace a conventional covariance or density-matrix discrepancy with the geodesic quantum f-divergence between an example's predicted positive-definite matrix and its target matrix. Use t as a controllable interpolation between the standard Petz divergence at t=0 and the maximal divergence at t=1, with f(x)=x log x or another operator-convex power generator. The loss is suited to covariance-predicting networks, SPD-valued embeddings, and matrix-valued classifiers where eigenvector alignment…

Useful6/10
Difficulty6/10
Novelty7/10
Paper: Geodesic Quantum $f$-Divergences arXiv:2608.15833