Related papers: A Block Reduction Method for Random Band Matrices …
Latent variable models represent a useful tool for the analysis of complex data when the constructs of interest are not observable. A problem related to these models is that the integrals involved in the likelihood function cannot be solved…
We consider 1d random Hermitian $N\times N$ block band matrices consisting of $W\times W$ random Gaussian blocks (parametrized by $j,k \in\Lambda=[1,n]\cap \mathbb{Z}$, $N=nW$) with a fixed entry's variance…
The Lattice Boltzmann Method (LBM), e.g. in [ 1] and [2 ], can be interpreted as an alternative method for the numerical solution of partial differential equations. Consequently, although the LBM is usually applied to solve fluid flows, the…
We study the wave function localization properties in a d-dimensional model of randomly spaced particles with isotropic hopping potential depending solely on Euclidean interparticle distances. Due to the generality of this model usually…
We consider the minimization of a sum of an expectation-valued coordinate-wise $L_i$-smooth nonconvex function and a nonsmooth block-separable convex regularizer. We propose an asynchronous variance-reduced algorithm, where in each…
In this paper we analyze a family of general random block coordinate descent methods for the minimization of $\ell_0$ regularized optimization problems, i.e. the objective function is composed of a smooth convex function and the $\ell_0$…
We study additive finite-rank perturbations of random periodic band matrices under the assumption that the nontrivial eigenvalues of the perturbation do not depend on the dimension. We establish the eigenvalue/eigenvector BBP transition in…
In this paper we propose a distributed version of a randomized block-coordinate descent method for minimizing the sum of a partially separable smooth convex function and a fully separable non-smooth convex function. Under the assumption of…
The Alternating Direction Method of Multipliers (ADMM) has now days gained tremendous attentions for solving large-scale machine learning and signal processing problems due to the relative simplicity. However, the two-block structure of the…
We set up Restricted Boltzmann Machines (RBM) to reproduce the Long Range Ising (LRI) models of the Ohmic type in one dimension. The RBM parameters are tuned by using the standard machine learning procedure with an additional method of…
A new extremely simple ensemble-based model with the uniformly generated axis-parallel hyper-rectangles as base models (HRBM) is proposed. Two types of HRBMs are studied: closed rectangles and corners. The main idea behind HRBM is to…
We introduce a random matrix framework for studying statistical-mechanical lattice systems through spectral observables. Equilibrium configurations sampled from a Boltzmann measure are mapped to matrix ensembles whose covariance structure…
We consider inhomogeneous square random matrices of size $N$ with independent entries of mean 0 and finite variance. We assume that the variance profile of this matrix is doubly stochastic and has a band-like structure with an appropriately…
In numerical simulations of many charged systems at the micro/nano scale, a common theme is the repeated solution of the Poisson-Boltzmann equation. This task proves challenging, if not entirely infeasible, largely due to the nonlinearity…
Restricted Boltzmann Machine (RBM) is a particular type of random neural network models modeling vector data based on the assumption of Bernoulli distribution. For multi-dimensional and non-binary data, it is necessary to vectorize and…
The use of model-based numerical simulation of wave propagation in rooms for engineering applications requires that acoustic conditions for multiple parameters are evaluated iteratively and this is computationally expensive. We present a…
We study the spectrum of an asymmetric random matrix with block structured variances. The rows and columns of the random square matrix are divided into $D$ partitions with arbitrary size (linear in $N$). The parameters of the model are the…
Lattice Boltmzmann Methods (LBM) have been proved to be very effective methods for computational aeroacoustics (CAA), which have been used to capture the dynamics of weak acoustic fluctuations. In this paper, we propose a strategy to reduce…
The non-backtracking operator of a graph is a powerful tool in spectral graph theory and random matrix theory. Most existing results for the non-backtracking operator of a random graph concern only eigenvalues or top eigenvectors. In this…
The low rank approximation of matrices is a crucial component in many data mining applications today. A competitive algorithm for this class of problems is the randomized block Lanczos algorithm - an amalgamation of the traditional block…