Related papers: A Block Reduction Method for Random Band Matrices …
Kinetic transport equations are notoriously difficult to simulate because of their complex multiscale behaviors and the need to numerically resolve a high dimensional probability density function. Past literature has focused on building…
Owing to their low-complexity iterations, Frank-Wolfe (FW) solvers are well suited for various large-scale learning tasks. When block-separable constraints are present, randomized block FW (RB-FW) has been shown to further reduce complexity…
We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, $W\sim N$. All previous results concerning…
This paper is concerned with the Taylor-reduced basis method (Taylor-RBM) for the efficient approximation of eigenspaces of large scale parametric Hermitian matrices. The Taylor-RBM is a local model order reduction method, which constructs…
The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in J Stat Phys 164:1233 -- 1260, 2016; Commun Math Phys 351:1009 -- 1044, 2017. We consider random Hermitian…
Reed-Muller (RM) codes achieve the capacity of general binary-input memoryless symmetric channels and are conjectured to have a comparable performance to that of random codes in terms of scaling laws. However, such results are established…
We consider a natural class of extensions of the Anderson model on $\mathbb Z^d$, called random block Schr\"odinger operators (RBSOs), defined on the $d$-dimensional torus $(\mathbb Z/L\mathbb Z)^d$. These operators take the form…
In this paper we analyze the randomized block-coordinate descent (RBCD) methods proposed in [8,11] for minimizing the sum of a smooth convex function and a block-separable convex function. In particular, we extend Nesterov's technique…
Finite-sample bias is a pervasive challenge in the estimation of structural equation models (SEMs), especially when sample sizes are small or measurement reliability is low. A range of methods have been proposed to improve finite-sample…
We develop a block minimum residual (MINRES) algorithm for symmetric indefinite matrices. This version is built upon the band Lanczos method that generates one basis vector of the block Krylov subspace per iteration rather than a whole…
At each iteration of a Block Coordinate Descent method one minimizes an approximation of the objective function with respect to a generally small set of variables subject to constraints in which these variables are involved. The…
We consider Hermitian random band matrices $H=(h_{xy})$ on the $d$-dimensional lattice $(\mathbb Z/L \mathbb Z)^d$, where the entries $h_{xy}=\overline h_{yx}$ are independent centered complex Gaussian random variables with variances…
Intra prediction is an essential component in the image coding. This paper gives an intra prediction framework completely based on neural network modes (NM). Each NM can be regarded as a regression from the neighboring reference blocks to…
Fractional Laplace equations are becoming important tools for mathematical modeling and prediction. Recent years have shown much progress in developing accurate and robust algorithms to numerically solve such problems, yet most solvers for…
We consider the problem of minimizing block-separable convex functions subject to linear constraints. While the Alternating Direction Method of Multipliers (ADMM) for two-block linear constraints has been intensively studied both…
Robustly manipulating waves on subwavelength scales can be achieved by, firstly, designing a structure with a subwavelength band gap and, secondly, introducing a defect so that eigenfrequencies fall within the band gap. Such frequencies are…
Block coordinate descent is an optimization paradigm that iteratively updates one block of variables at a time, making it quite amenable to big data applications due to its scalability and performance. Its convergence behavior has been…
This paper adapts the recently developed rigorous application of the supersymmetric transfer matrix approach for the 1d band matrices to the case of the orthogonal symmetry. We consider $N\times N$ block band matrices consisting of $W\times…
The High Efficiency Video Coding (HEVC/H.265) standard doubles the compression efficiency of the widely used H.264/AVC standard. For practical applications, rate control (RC) algorithms for HEVC need to be developed. Based on the R-Q,…
(Block-)coordinate minimization is an iterative optimization method which in every iteration finds a global minimum of the objective over a variable or a subset of variables, while keeping the remaining variables constant. While for some…