Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm
Abstract
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 (1015 configurations), and, for the bipartite antiferromagnetic model with 232 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.
Related
- Fermionic Unruh effect revisited: Entanglement and correlation dynamics under symmetric transformations
- Modified Family-Vicsek Scaling and Probability Distributions for Brownian Castle Interfaces
- Constrained surrogates for arbitrary families of continuous probability distributions
- Real-time Tunable Probability Distributions From Perimeter-Gated SPAD TRNGs
- Tensor Network Moral Graph Recovery of Discrete Probability Distributions
BibTeX
@misc{kinjo2026maximal,
title = {{Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm}},
author = {Kayo Kinjo and Jun Ohkubo},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.02731},
eprint = {2611.02731},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.02731},
}
RIS
TY - UNPB
TI - Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm
AU - Kayo Kinjo
AU - Jun Ohkubo
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.02731
UR - https://arxiv.org/abs/2611.02731
AB - 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.
ER -