Related papers: Improved Spectral Density Estimation via Explicit …
Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density…
We show that Laplacian and symmetric diagonally dominant (SDD) matrices can be well approximated by linear-sized sparse Cholesky factorizations. We show that these matrices have constant-factor approximations of the form $L L^{T}$, where…
Approximate matrix multiplication with limited space has received ever-increasing attention due to the emergence of large-scale applications. Recently, based on a popular matrix sketching algorithm -- frequent directions, previous work has…
A generalized skew-symmetric Lanczos bidiagonalization (GSSLBD) method is proposed to compute several extreme eigenpairs of a large matrix pair $(A,B)$, where $A$ is skew-symmetric and $B$ is symmetric positive definite. The underlying…
We present a subspace projection technique to conduct large-scale Kohn-Sham density functional theory calculations using spectral finite-element discretization. The proposed method treats both metallic and insulating materials in a single…
We describe a general technique that yields the first {\em Statistical Query lower bounds} for a range of fundamental high-dimensional learning problems involving Gaussian distributions. Our main results are for the problems of (1) learning…
Accurate calculations of the spectral density in a strongly correlated quantum many-body system are of fundamental importance to study its dynamics in the linear response regime. Typical examples are the calculation of inclusive and…
An implicit purification scheme is proposed for calculation of the temperature-dependent, grand canonical single-particle density matrix, given as a Fermi operator expansion in terms of the Hamiltonian. The computational complexity is shown…
We study the problem of learning mixtures of linear classifiers under Gaussian covariates. Given sample access to a mixture of $r$ distributions on $\mathbb{R}^n$ of the form $(\mathbf{x},y_{\ell})$, $\ell\in [r]$, where…
Posterior inference for Dirichlet process mixture models is analytically intractable and typically relies on Markov chain Monte Carlo methods, which can become computationally prohibitive at moderate to large sample sizes. In this work, we…
Many important problems are characterized by the eigenvalues of a large matrix. For example, the difficulty of many optimization problems, such as those arising from the fitting of large models in statistics and machine learning, can be…
This article investigates the weak approximation towards the invariant measure of semi-linear stochastic differential equations (SDEs) under non-globally Lipschitz coefficients. For this purpose, we propose a linear-theta-projected Euler…
In this paper, we develop a unified framework able to certify both exponential and subexponential convergence rates for a wide range of iterative first-order optimization algorithms. To this end, we construct a family of parameter-dependent…
In this paper, we propose a linear and monolithic finite element method for the approximation of an incompressible viscous fluid interacting with an elastic and deforming plate. We use the arbitrary Lagrangian-Eulerian (ALE) approach that…
This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path taken through a Markov graph. Integrated with the Viterbi algorithm (VA),…
Diffusion maps is a manifold learning algorithm widely used for dimensionality reduction. Using a sample from a distribution, it approximates the eigenvalues and eigenfunctions of associated Laplace-Beltrami operators. Theoretical bounds on…
An efficient despeckling method using a quantum-inspired adaptive threshold function is presented for reducing noise of ultrasound images. In the first step, the ultrasound image is decorrelated by an spectrum equalization procedure due to…
The deformation of an initially spherical capsule, freely suspended in simple shear flow, can be computed analytically in the limit of small deformations [D. Barthes-Biesel, J. M. Rallison, The Time-Dependent Deformation of a Capsule Freely…
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…
In the study of condensed matter physics, spectral information plays an important role for understand the mechanism of materials. However, it is difficult to obtain the spectrum directly through experiments or simulation. For example, the…