Contracting Tensor Networks with Generalized Belief Propagation

• URL: http://arxiv.org/abs/2604.24760v1
• Date: Mon, 27 Apr 2026 17:59:03 GMT
• Title: Contracting Tensor Networks with Generalized Belief Propagation
• Abstract summary: We show how to apply belief propagation to approximate, but highly efficient, tensor network contraction.<n>We implement the belief propagation algorithm for a number of different region choices on a range of two- and three-dimensional, infinite and finite tensor networks.<n>Our examples include calculating the partition function of the fully frustrated Ising model, computing the ground state degeneracy of three-dimensional ice models, measuring observables on the deformed AKLT quantum state and evaluating the norm of randomly generated tensor network states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent years have seen a growing interest in the use of belief propagation - an algorithm originally introduced for performing statistical inference on graphical models - for approximate, but highly efficient, tensor network contraction. Here, we detail how to apply generalized belief propagation (GBP) - where messages are passed within a hierarchy of overlapping regions of the tensor network - to approximately contract tensor networks and obtain accurate results. The original belief propagation algorithm is a corner case of this approach, corresponding to a particularly simple choice of regions of the tensor network. We implement the GBP algorithm for a number of different region choices on a range of two- and three-dimensional, infinite and finite tensor networks, solving the corresponding fixed point equations both numerically and, in certain tractable cases, analytically. Our examples include calculating the partition function of the fully frustrated Ising model, computing the ground state degeneracy of three-dimensional ice models, measuring observables on the deformed AKLT quantum state and evaluating the norm of randomly generated tensor network states.

Related papers

• Algorithmic Separation between Constant-Depth and Logarithmic-Depth Neural Networks [64.7580803923092]
  We prove the first algorithmic separation between constant-depth and logarithmic-depth networks.<n>Specifically, we identify a class of Boolean functions with hierarchically structured spectra that logarithmic-depth networks can learn efficiently.
  arXiv  Detail & Related papers  (2026-07-28T02:13:30Z)
• T-GINEE: A Tensor-Based Multilayer Graph Representation Learning [50.294562905744215]
  T-GINEE is a statistical regularization framework combining tensor-based generalized estimating equations with task-specific loss to model cross-network correlations explicitly.<n>Our theoretical analysis establishes consistency and normality under mild conditions.<n>Extensive experiments on synthetic and real-world datasets validate T-GINEE's effectiveness for multilayer network analysis.
  arXiv  Detail & Related papers  (2026-05-27T10:51:29Z)
• Graph Signal Diffusion Models for Wireless Resource Allocation [74.84410305593006]
  We consider constrained ergodic resource optimization in wireless networks with graph-structured interference.<n>We show that time-sharing the generated power allocations achieves near-optimal ergodic sum-rate utility and near-feasible ergodic minimum-rates.
  arXiv  Detail & Related papers  (2026-04-06T21:12:25Z)
• Emergent statistical mechanics in holographic random tensor networks [41.99844472131922]
  We show that RTN states equilibrate at large bond dimension and also in the scaling limit for three classes of geometries.<n>We reproduce a holographic degree-of-freedom counting for the effective dimension of each system.<n>These results demonstrate that RTN techniques can probe aspects of late-time dynamics of quantum many-body phases.
  arXiv  Detail & Related papers  (2025-08-22T17:49:49Z)
• Tensorization of neural networks for improved privacy and interpretability [46.0920431279359]
  We present a tensorization algorithm for constructing tensor train representations of functions.<n>We show that this approach can be used to enhance the privacy and interpretability of neural network models.
  arXiv  Detail & Related papers  (2025-01-10T19:00:06Z)
• Tensor Network Representation and Entanglement Spreading in Many-Body Localized Systems: A Novel Approach [0.0]
  A novel method has been devised to compute the Local Integrals of Motion for a one-dimensional many-body localized system. A class of optimal unitary transformations is deduced in a tensor-network formalism to diagonalize the Hamiltonian of the specified system. The efficiency of the method was assessed and found to be both fast and almost accurate.
  arXiv  Detail & Related papers  (2023-12-13T14:28:45Z)
• Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms [41.94295877935867]
  We present two algorithms to initialize layers of tensorized neural networks and general tensor network algorithms.<n>The core of this method is the use of the normworks of the tensor network in an iterative way, so that we normalize by the finite values of the norms that led to the divergence or zero norm.<n>We have also applied it to the Matrix Product State/Tensor Train (MPS/TT) and Matrix Product Operator/Tensor Train Matrix (MPO/TT-M) layers.
  arXiv  Detail & Related papers  (2023-09-11T08:05:09Z)
• Theory on variational high-dimensional tensor networks [2.0307382542339485]
  We investigate the emergent statistical properties of random high-dimensional-network states and the trainability of tensoral networks. We prove that variational high-dimensional networks suffer from barren plateaus for global loss functions. Our results pave a way for their future theoretical studies and practical applications.
  arXiv  Detail & Related papers  (2023-03-30T15:26:30Z)
• Block belief propagation algorithm for two-dimensional tensor networks [0.0]
  We propose a block belief propagation algorithm for contracting two-dimensional tensor networks and approximating the ground state of $2D$ systems. As applications, we use our algorithm to study the $2D$ Heisenberg and transverse Ising models, and show that the accuracy of the method is on par with state-of-the-art results.
  arXiv  Detail & Related papers  (2023-01-14T07:37:08Z)
• On the Effective Number of Linear Regions in Shallow Univariate ReLU Networks: Convergence Guarantees and Implicit Bias [50.84569563188485]
  We show that gradient flow converges in direction when labels are determined by the sign of a target network with $r$ neurons. Our result may already hold for mild over- parameterization, where the width is $tildemathcalO(r)$ and independent of the sample size.
  arXiv  Detail & Related papers  (2022-05-18T16:57:10Z)
• On the Neural Tangent Kernel Analysis of Randomly Pruned Neural Networks [91.3755431537592]
  We study how random pruning of the weights affects a neural network's neural kernel (NTK) In particular, this work establishes an equivalence of the NTKs between a fully-connected neural network and its randomly pruned version.
  arXiv  Detail & Related papers  (2022-03-27T15:22:19Z)
• Mean-field Analysis of Piecewise Linear Solutions for Wide ReLU Networks [83.58049517083138]
  We consider a two-layer ReLU network trained via gradient descent. We show that SGD is biased towards a simple solution. We also provide empirical evidence that knots at locations distinct from the data points might occur.
  arXiv  Detail & Related papers  (2021-11-03T15:14:20Z)
• Tensor-Train Networks for Learning Predictive Modeling of Multidimensional Data [0.0]
  A promising strategy is based on tensor networks, which have been very successful in physical and chemical applications. We show that the weights of a multidimensional regression model can be learned by means of tensor networks with the aim of performing a powerful compact representation. An algorithm based on alternating least squares has been proposed for approximating the weights in TT-format with a reduction of computational power.
  arXiv  Detail & Related papers  (2021-01-22T16:14:38Z)
• A function space analysis of finite neural networks with insights from sampling theory [41.07083436560303]
  We show that the function space generated by multi-layer networks with non-expansive activation functions is smooth. Under the assumption that the input is band-limited, we provide novel error bounds. We analyze both deterministic uniform and random sampling showing the advantage of the former.
  arXiv  Detail & Related papers  (2020-04-15T10:25:18Z)
• Efficient variational contraction of two-dimensional tensor networks with a non-trivial unit cell [0.0]
  tensor network states provide an efficient class of states that faithfully capture strongly correlated quantum models and systems. We generalize a recently proposed variational uniform matrix product state algorithm for capturing one-dimensional quantum lattices. A key property of the algorithm is a computational effort that scales linearly rather than exponentially in the size of the unit cell.
  arXiv  Detail & Related papers  (2020-03-02T19:01:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.