Related papers: Initial tensor construction and dependence of the …

Recently, the tensor network description with bond weights on its edges has been proposed as a novel improvement for the tensor renormalization group algorithm. The bond weight is controlled by a single hyperparameter, whose optimal value…

We present a new family of zero-field Ising models over $N$ binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of…

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…

We continue our study of rigorous renormalization group (RG) maps for tensor networks that was begun in arXiv:2107.11464. In this paper we construct a rigorous RG map for 2D tensor networks whose domain includes tensors that represent the…

Tensor Ring (TR) decomposition is a powerful tool for high-order data modeling, but is inherently restricted to discrete forms defined on fixed meshgrids. In this work, we propose a TR functional decomposition for both meshgrid and…

Tensor time series, which is a time series consisting of tensorial observations, has become ubiquitous. It typically exhibits high dimensionality. One approach for dimension reduction is to use a factor model structure, in a form similar to…

Tensor network structure search (TN-SS) aims to automatically discover optimal network topologies and rank configurations for efficient tensor decomposition in high-dimensional data representation. Despite recent advances, existing TN-SS…

We analyze the renormalization-group (RG) flows of two effective Lagrangians, one for measurement induced transitions of monitored quantum systems and one for entanglement transitions in random tensor networks. These Lagrangians, previously…

Tensors, which provide a powerful and flexible model for representing multi-attribute data and multi-way interactions, play an indispensable role in modern data science across various fields in science and engineering. A fundamental task is…

We present a new method for online prediction and learning of tensors ($N$-way arrays, $N >2$) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor…

We study extensions of compressive sensing and low rank matrix recovery (matrix completion) to the recovery of low rank tensors of higher order from a small number of linear measurements. While the theoretical understanding of low rank…

Novel randomness-induced disordered ground states in two-dimensional (2D) quantum spin systems have been attracting much interest. For quantitative analysis of such random quantum spin systems, one of the most promising numerical approaches…

We examine feasibility of accurate estimations of universal critical data using tensor renormalization group (TRG) algorithm introduced by Levin and Nave. Specifically, we compute critical exponents $\gamma, \gamma/\nu, \delta, \eta$ and…

Independent component analysis (ICA) is a fundamental problem in the field of signal processing, and numerous algorithms have been developed to address this issue. The core principle of these algorithms is to find a transformation matrix…

We show that the Tensor Renormalization Group (TRG) method can be applied to O(N) spin models, principal chiral models and pure gauge theories (Z2, U(1) and SU(2)) on (hyper) cubic lattices. We explain that contrarily to some common belief,…

The $k$-tensor Ising model is an exponential family on a $p$-dimensional binary hypercube for modeling dependent binary data, where the sufficient statistic consists of all $k$-fold products of the observations, and the parameter is an…

Recent advances in IoT and biometric sensing technologies have led to the generation of massive and high-dimensional tensor data, yet achieving accurate and efficient low-rank approximation remains a major challenge. Most existing tensor…

We set up the Functional Renormalisation Group formalism for Tensorial Group Field Theory in full generality. We then apply it to a rank-3 model over U(1) x U(1) x U(1), endowed with a linear kinetic term and nonlocal interactions. The…

In usual (non-stochastic) tensor network calculations, the truncated singular value decomposition (SVD) is often used for approximating a tensor, and it causes systematic errors. By introducing stochastic noise in the approximation,…

We propose a novel coarse graining tensor renormalization group method based on the higher-order singular value decomposition. This method provides an accurate but low computational cost technique for studying both classical and quantum…