Related papers: Triad second renormalization group
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…
We present Re-weighted Gradient Descent (RGD), a novel optimization technique that improves the performance of deep neural networks through dynamic sample re-weighting. Leveraging insights from distributionally robust optimization (DRO)…
This paper proposes a family of online second order methods for possibly non-convex stochastic optimizations based on the theory of preconditioned stochastic gradient descent (PSGD), which can be regarded as an enhance stochastic Newton…
In low-rank tensor completion tasks, due to the underlying multiple large-scale singular value decomposition (SVD) operations and rank selection problem of the traditional methods, they suffer from high computational cost and high…
We analyze the renormalization group fixed point of the two-dimensional Ising model at criticality. In contrast with expectations from tensor network renormalization (TNR), we show that a simple, explicit analytic description of this fixed…
We implement an efficient strong-disorder renormalization-group (SDRG) procedure to study disordered tight-binding models in any dimension and on the Erdos-Renyi random graphs, which represent an appropriate infinite dimensional limit. Our…
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…
In order to extend the density-matrix renormalization-group (DMRG) method to two-dimensional systems, we formulate two alternative methods to prepare the initial states. We find that the number of states that is needed for accurate energy…
Ab-initio calculations of real-time evolution for lattice gauge theory have very interesting potential applications but present challenging computational aspects. We show that tensor renormalization group methods developed in the context of…
We develop a Renormalization Group (RG) approach to the study of existence and uniqueness of solutions to stochastic partial differential equations driven by space-time white noise. As an example we prove well-posedness and independence of…
We introduce a statistical system on random networks of trivalent vertices for the purpose of studying the canonical tensor model, which is a rank-three tensor model in the canonical formalism. The partition function of the statistical…
We propose an initialization procedure for the density-matrix renormalization group (DMRG): {\it the recursive sweep method}. In a conventional DMRG calculation, the infinite-algorithm, where two new sites are added to the system at each…
Within the tensor singular value decomposition (T-SVD) framework, existing robust low-rank tensor completion approaches have made great achievements in various areas of science and engineering. Nevertheless, these methods involve the T-SVD…
The two- and three-dimensional transverse-field Ising models with ferromagnetic exchange interactions are analyzed by means of the real-space renormalization group method. The basic strategy is a generalization of a method developed for the…
Efficient and fast computation of a tensor singular value decomposition (t-SVD) with a few passes over the underlying data tensor is crucial because of its many potential applications. The current/existing subspace randomized algorithms…
We study the tensor-on-tensor regression, where the goal is to connect tensor responses to tensor covariates with a low Tucker rank parameter tensor/matrix without the prior knowledge of its intrinsic rank. We propose the Riemannian…
Tensor numerical methods, based on the rank-structured tensor representation of $d$-variate functions and operators, are designed to provide $O(dn)$ complexity of numerical calculations on $n^{\otimes d }$ grids contrary to $O(n^d)$ scaling…
Multi-relational learning has received lots of attention from researchers in various research communities. Most existing methods either suffer from superlinear per-iteration cost, or are sensitive to the given ranks. To address both issues,…
We introduce tensor Interpolative Decomposition (tensor ID) for the reduction of the separation rank of Canonical Tensor Decompositions (CTDs). Tensor ID selects, for a user-defined accuracy \epsilon, a near optimal subset of terms of a CTD…
We develop a Machine-Learning Renormalization Group (MLRG) algorithm to explore and analyze many-body lattice models in statistical physics. Using the representation learning capability of generative modeling, MLRG automatically learns the…