Mutual Information Scaling for Tensor Network Machine Learning
arXiv:2103.00105 · doi:10.1088/2632-2153/ac44a9
Abstract
Tensor networks have emerged as promising tools for machine learning, inspired by their widespread use as variational ansatze in quantum many-body physics. It is well known that the success of a given tensor network ansatz depends in part on how well it can reproduce the underlying entanglement structure of the target state, with different network designs favoring different scaling patterns. We demonstrate here how a related correlation analysis can be applied to tensor network machine learning, and explore whether classical data possess correlation scaling patterns similar to those found in quantum states which might indicate the best network to use for a given dataset. We utilize mutual information as measure of correlations in classical data, and show that it can serve as a lower-bound on the entanglement needed for a probabilistic tensor network classifier. We then develop a logistic regression algorithm to estimate the mutual information between bipartitions of data features, and verify its accuracy on a set of Gaussian distributions designed to mimic different correlation patterns. Using this algorithm, we characterize the scaling patterns in the MNIST and Tiny Images datasets, and find clear evidence of boundary-law scaling in the latter. This quantum-inspired classical analysis offers insight into the design of tensor networks which are best suited for specific learning tasks.
29 pages, 10 figures
References in corpus (11)
- The density-matrix renormalization group in the age of matrix product states
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- A class of quantum many-body states that can be efficiently simulated
- On Variational Bounds of Mutual Information
- Correlations in local measurements on a quantum state, and complementarity as an explanation of nonclassicality
- Tensor Networks in a Nutshell
- Efficient simulation of infinite tree tensor network states on the Bethe lattice
- Lectures on Quantum Tensor Networks
- Tighter Variational Representations of f-Divergences via Restriction to Probability Measures
- Entanglement and Tensor Networks for Supervised Image Classification
- A Multi-Scale Tensor Network Architecture for Classification and Regression
Cited by in corpus (11)
- The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
- Tensor networks for quantum machine learning
- Tensor networks for interpretable and efficient quantum-inspired machine learning
- Entanglement bipartitioning and tree tensor networks
- Decohering Tensor Network Quantum Machine Learning Models
- Machine learning with tree tensor networks, CP rank constraints, and tensor dropout
- Tensor network to learn the wavefunction of data
- Tensor networks and efficient descriptions of classical data
- Tensor tree learns hidden relational structures in data to construct generative models
- Deep tensor networks with matrix product operators
- Universal scaling laws in quantum-probabilistic machine learning by tensor network towards interpreting representation and generalization powers