Related papers: Tensor Renormalization Group with Randomized Singu…
We propose a general procedure for extracting the running coupling constants of the underlying field theory of a given classical statistical model on a two-dimensional lattice, combining tensor network renormalization (TNR) and the…
Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…
The renormalization group has proven to be a very powerful tool in physics for treating systems with many length scales. Here we show how it can be adapted to provide a new class of algorithms for discrete optimization. The heart of our…
The tensor renormalization group is a promising complementary approach to traditional Monte Carlo methods for lattice systems, as it is inherently free from the sign problem. We discuss recent developments crucial for its application to…
We present an algorithm for low rank decomposition of tensors of any symmetry type, from fully asymmetric to fully symmetric. It recovers the decomposition one summand at a time via the higher-order power method. This approach is known to…
A classical problem in matrix computations is the efficient and reliable approximation of a given matrix by a matrix of lower rank. The truncated singular value decomposition (SVD) is known to provide the best such approximation for any…
For scalar QED on a three-dimensional toroidal lattice with a fine lattice spacing we consider the renormalization problem of choosing counter terms depending on the lattice spacing, so that the theory stays finite as the spacing goes to…
Tensor decomposition serves as a powerful primitive in statistics and machine learning, and has numerous applications in problems such as learning latent variable models or mixture of Gaussians. In this paper, we focus on using power…
This paper lies in the intersection of several fields: number theory, lattice theory, multilinear algebra, and scientific computing. We adapt existing solution algorithms for tensor eigenvalue problems to the tensor-train framework. As an…
We propose a tensor-network-based algorithm to study the classical Ising model on an infinitely large hyperbolic lattice with a regular 3D tesselation of identical dodecahedra. We reformulate the corner transfer matrix renormalization group…
A block spin renormalization group approach is proposed for the dynamical triangulation formulation of two-dimensional quantum gravity. The idea is to update link flips on the block lattice in response to link flips on the original lattice.…
We give reconstruction algorithms for subclasses of depth-3 arithmetic circuits. In particular, we obtain the first efficient algorithm for finding tensor rank, and an optimal tensor decomposition as a sum of rank-one tensors, when given…
We parallelize density-matrix renormalization group to directly extend it to 2-dimensional ($n$-leg) quantum lattice models. The parallelization is made mainly on the exact diagonalization for the superblock Hamiltonian since the part…
We propose a numerical self-consistent method for 3D classical lattice models, which optimizes the variational state written as two-dimensional product of tensors. The variational partition function is calculated by the corner transfer…
The recently developed tensor renormalization-group (TRG) method provides a highly precise technique for deriving thermodynamic and critical properties of lattice Hamiltonians. The TRG is a local coarse-graining transformation, with the…
We discuss in detail algorithms for implementing tensor network renormalization (TNR) for the study of classical statistical and quantum many-body systems. Firstly, we recall established techniques for how the partition function of a 2D…
Decomposing tensors into orthogonal factors is a well-known task in statistics, machine learning, and signal processing. We study orthogonal outer product decompositions where the factors in the summands in the decomposition are required to…
We present a method for contracting a square-lattice tensor network in two dimensions, based on auxiliary tensors accomplishing successive truncations (renormalization) of 8-index tensors for 2 by 2 plaquettes into 4-index tensors. The…
This paper tackles the problem of recovering a low-rank signal tensor with possibly correlated components from a random noisy tensor, or so-called spiked tensor model. When the underlying components are orthogonal, they can be recovered…
The widely used density matrix renormalization group (DRMG) method often fails to converge in systems with multiple length scales, such as lattice discretizations of continuum models and dilute or weakly doped lattice models. The local…