Related papers: Optimal Renormalization Group Transformation from …
We apply Renormalization Group (RG) techniques to Classical Information Theory, in the limit of large codeword size $n$. In particular, we apply RG techniques to (1) noiseless coding (i.e., a coding used for compression) and (2) noisy…
Based on the contractor renormalization group (CORE) method and the density matrix renormalization group (DMRG) method, a new computational scheme, which is called the block density matrix renormalization group with effective interactions…
A simple modification of the standard Renormalization Group (RG) technique for the study of quantum spin systems is introduced. Our method which takes into account the effect of boundary conditions by employing the concept of superblock,…
The quintessential learning algorithm of empirical risk minimization (ERM) is known to fail in various settings for which uniform convergence does not characterize learning. It is therefore unsurprising that the practice of machine learning…
Mixed-integer programming (MIP) has emerged as a powerful framework for learning optimal decision trees. Yet, existing MIP approaches for regression tasks are either limited to purely binary features or become computationally intractable…
Coarse-grained models are a core computational tool in theoretical chemistry and biophysics. A judicious choice of a coarse-grained model can yield physical insight by isolating the essential degrees of freedom that dictate the…
Gradient regularization (GR) has been shown to improve the generalizability of trained models. While Natural Gradient Descent has been shown to accelerate optimization in the initial phase of training, little attention has been paid to how…
Extending the parameter space of the three-dimensional (d=3) Ising model, we search for a regime of eliminated corrections to finite-size scaling. For that purpose, we consider a real-space renormalization group (RSRG) with respect to a…
We have studied quantum data compression for finite quantum systems where the site density matrices are not independent, i.e., the density matrix cannot be given as direct product of site density matrices and the von Neumann entropy is not…
In multimodal graph learning, graph structures that integrate information from multiple sources, such as vision and text, can more comprehensively model complex entity relationships. However, the continuous growth of their data scale poses…
The density matrix renormalization group (DMRG) is a numerical method that optimizes a variational state expressed by a tensor product. We show that the ground state is not fully optimized as far as we use the standard finite system…
In applications of the density matrix renormalization group to nonhermitean problems, the choice of the density matrix is not uniquely prescribed by the algorithm. We demonstrate that for the recently introduced stochastic transfer matrix…
We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of quantum circuits. This algorithm can be seen as the extension of time-dependent DMRG from the usual situation of hermitian Hamiltonian matrices to…
We present a systematic study to test a recently introduced phenomenological renormalization group, proposed to coarse-grain data of neural activity from their correlation matrix. The approach allows, at least in principle, to establish…
Coarse-graining (CG) of molecular simulations simplifies the particle representation by grouping selected atoms into pseudo-beads and drastically accelerates simulation. However, such CG procedure induces information losses, which makes…
Evaluation of likelihood functions for cosmological large scale structure data sets (including CMB, galaxy redshift surveys, etc.) naturally involves marginalization, i.e., integration, over an unknown underlying random signal field.…
We present a recently introduced real space renormalization group (RG) approach to the study of surface growth. The method permits us to obtain the properties of the KPZ strong coupling fixed point, which is not accessible to standard…
A valid prediction for a physical observable from quantum field theory should be independent of the choice of renormalization scheme -- this is the primary requirement of renormalization group invariance (RGI). Satisfying scheme invariance…
We investigate the unsupervised node classification problem on random hypergraphs under the non-uniform Hypergraph Stochastic Block Model (HSBM) with two equal-sized communities. In this model, edges appear independently with probabilities…
The density matrix renormalization group (DMRG) is applied to some one-dimensional reaction-diffusion models in the vicinity of and at their critical point. The stochastic time evolution for these models is given in terms of a non-symmetric…