Metraipolis › archive › dc_2de35985541c

Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm — arXiv:2611.02731

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02731
License (as archived)
CC0-1.0
Archived
2026-11-03T11:49:33.094Z
SHA-256 of the archived text
500440e849d4166f2d8e5f2a8e58e6ac170fd57819dcfe9dd4488ba053274835
Stable URL of this page
https://metraipolis.com/documento/dc_2de35985541c

How to cite

Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm — arXiv:2611.02731 — arXiv (en), https://arxiv.org/abs/2611.02731 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2de35985541c (Metraipolis archive dc_2de35985541c, sha256 500440e849d4166f2d8e5f2a8e58e6ac170fd57819dcfe9dd4488ba053274835)
BibTeX
@misc{dc2de35985541c,
  title = {Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm — arXiv:2611.02731},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02731},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2de35985541c; sha256 500440e849d4166f2d8e5f2a8e58e6ac170fd57819dcfe9dd4488ba053274835},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02731. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The correlation between two subsystems $A$ and $B$ of a many-body system is usually measured through a pair of observables chosen in advance. The Hirschfeld-Gebelein-Rényi maximal correlation removes the choice: it is the largest correlation coefficient between any function of the configuration of $A$ and any function of the configuration of $B$, and the two functions that reach it, the optimal transformations, are the observables that carry the correlation. Both follow from a singular value decomposition (SVD) of the joint distribution normalized by its marginals, a matrix whose dimension is the number of configurations. We show that this SVD can be computed variationally for a classical distribution of discrete variables, such as the Boltzmann distribution of a spin model, given in the tensor-train (matrix-product) format, without ever forming the matrix. The optimal transformations are sought as tensor trains; each step updates a single core in closed form, and the inverse of a small matrix contracted from the distribution and the remaining cores performs the division by the marginals core by core. Every iterate is a feasible pair, so the objective is a lower bound on the maximal correlation that increases monotonically, and the cost grows linearly with the number of variables. The algorithm reproduces the exact SVD on small systems, recovers the known nonlinear optimal transformations of synthetic distributions of up to ten angular variables ($10^{15}$ configurations), and, for the bipartite antiferromagnetic model with $2^{32}$ configurations, returns an optimal transformation that is a function of the group magnetization, linear above the transition and sign-like below it: the staggered order parameter is read off from the distribution instead of being postulated.

Tema degli esploratori: fisica e astronomia (elenco arXiv cond-mat.stat-mech, nuovi lavori del giorno).
Categorie arXiv: Computational Physics (physics.comp-ph) ; Statistical Mechanics (cond-mat.stat-mech).
Pagina del lavoro: https://arxiv.org/abs/2611.02731 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:09:52.326Z dalla pagina https://arxiv.org/list/cond-mat.stat-mech/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).