Related papers: Generalized Suzuki-Chin Factorization in Bosonic P…
Symmetric nonnegative matrix factorization (NMF), a special but important class of the general NMF, is demonstrated to be useful for data analysis and in particular for various clustering tasks. Unfortunately, designing fast algorithms for…
We present low-scaling algorithms for $GW$ and constrained random phase approximation based on a symmetry-adapted interpolative separable density fitting (ISDF) procedure that incorporates the space-group symmetries of crystalline systems.…
By chaining a sequence of differentiable invertible transformations, normalizing flows (NF) provide an expressive method of posterior approximation, exact density evaluation, and sampling. The trend in normalizing flow literature has been…
This paper introduces a second-order time discretization for solving the incompressible Boussinesq equation. It uses the generalized scalar auxiliary variable (GSAV) and a backward differentiation formula (BDF), based on a Taylor expansion…
Stochastic gradient descent (SGD) algorithm is an effective learning strategy to build a latent factor analysis (LFA) model on a high-dimensional and incomplete (HDI) matrix. A particle swarm optimization (PSO) algorithm is commonly adopted…
Probabilities of vibronic transitions in molecules are referred to as Franck-Condon factors (FCFs). Although several approaches for calculating FCFs have been developed, such calculations are still challenging. Recently it was shown that…
We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global…
A new formulation for collisional kinetic theory is presented based on the use of Lie-transform methods to eliminate fast orbital time scales from a general bilinear collision operator. As an application of this new formalism, a general…
We tackle the problem of collaborative filtering (CF) with side information, through the lens of Gaussian Process (GP) regression. Driven by the idea of using the kernel to explicitly model user-item similarities, we formulate the GP in a…
Computing partition function is the most important statistical inference task arising in applications of Graphical Models (GM). Since it is computationally intractable, approximate methods have been used to resolve the issue in practice,…
We present a new class of polynomial-time algorithms for submodular function minimization (SFM), as well as a unified framework to obtain strongly polynomial SFM algorithms. Our algorithms are based on simple iterative methods for the…
The Poisson-binomial distribution is useful in many applied problems in engineering, actuarial science, and data mining. The Poisson-binomial distribution models the distribution of the sum of independent but not identically distributed…
Matrix factorization (MF) is employed by many popular algorithms, e.g., collaborative filtering. The emerging GPU technology, with massively multicore and high intra-chip memory bandwidth but limited memory capacity, presents an opportunity…
Bosonic quantum error correction enables hardware-efficient protection of quantum information by encoding logical qubits in harmonic oscillators. Bosonic grid states, such as Gottesman-Kitaev-Preskill (GKP) states, are particularly…
The parallel solver of the general synthetic iterative scheme (GSIS), as recently developed by Zhang \textit{et. al.} in Comput. Fluids 281 (2024) 106374, is an efficient method to find the solution of the Boltzmann equation…
Spatial Monte Carlo integration (SMCI) is an extension of standard Monte Carlo integration and can approximate expectations on Markov random fields with high accuracy. SMCI was applied to pairwise Boltzmann machine (PBM) learning, with…
In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization. Current state-of-the-art algorithms that provide…
Simulating interactions between fermions and bosons is central to understanding correlated phenomena, yet these systems are inherently difficult to treat classically. Previous quantum algorithms for fermion-boson models exhibit computation…
Matrix factorization (MF) is a widely used collaborative filtering (CF) algorithm for recommendation systems (RSs), due to its high prediction accuracy, great flexibility and high efficiency in big data processing. However, with the…
Three refined and refined harmonic extraction-based Jacobi--Davidson (JD) type methods are proposed, and their thick-restart algorithms with deflation and purgation are developed to compute several generalized singular value decomposition…