Related papers: The Adaptive Shift Method in Full Configuration In…
We present an analysis of an adaptive time-stepping scheme for the Super-Droplet Method (SDM), a Monte Carlo algorithm for simulating particle coagulation. SDM represents cloud droplets as weighted superdroplets, enabling high-fidelity…
Bayesian inference in the physical sciences faces a fundamental challenge: the imperative for high-fidelity physical modeling often clashes with the intrinsic limitations of stochastic sampling algorithms. Complex, high-dimensional…
While multilevel Monte Carlo (MLMC) methods for the numerical approximation of partial differential equations with random coefficients enjoy great popularity, combinations with spatial adaptivity seem to be rare. We present an adaptive MLMC…
Fault-tolerant quantum computation (FTQC) requires fast and accurate decoding of quantum errors, which is often formulated as a minimum-weight perfect matching (MWPM) problem. A determinant-based approach has been proposed as a novel method…
Fourier transform methods are used to analyze functions and data sets to provide frequencies, amplitudes, and phases of underlying oscillatory components. Fast Fourier transform (FFT) methods offer speed advantages over evaluation of…
We propose an inexact variable-metric proximal point algorithm to accelerate gradient-based optimization algorithms. The proposed scheme, called QNing can be notably applied to incremental first-order methods such as the stochastic…
This paper develops an adaptive proximal alternating direction method of multipliers (ADMM) for solving linearly constrained, composite optimization problems under the assumption that the smooth component of the objective is weakly convex,…
We show that Full Configuration Interaction Quantum Monte Carlo (FCIQMC) is a Markov Chain in its present form. We construct the Markov matrix of FCIQMC for a two determinant system and hence compute the stationary distribution. These…
Fast convolution algorithms, including Winograd and FFT, can efficiently accelerate convolution operations in deep models. However, these algorithms depend on high-precision arithmetic to maintain inference accuracy, which conflicts with…
Accurate ab initio calculations of 3d transition metal monoxide molecules have attracted extensive attention because of its relevance in physical and chemical science, as well as theoretical challenges in treating strong electron…
We recently developed a scheme to use low-cost calculations to find a single twist angle where the couple cluster doubles energy of a single calculation matches the twist-averaged coupled cluster doubles energy in a finite unit cell. We…
Motivated by recent developments in conformal field theory (CFT), we devise a Quantum Monte Carlo (QMC) method to calculate the moments of the partially transposed reduced density matrix at finite temperature. These are used to construct…
The auxiliary-field quantum Monte Carlo (AFQMC) method is a general numerical method for correlated many-electron systems, which is being increasingly applied in lattice models, atoms, molecules, and solids. Here we introduce the theory and…
This article focuses on the globally composite adaptive law-based intelligent finite-/fixed- time (FnT/FxT) tracking control issue for a family of uncertain strict-feedback nonlinear systems. First, intelligent approximators with new…
We propose and analyze an adaptive finite element method for a phase-field model of dynamic brittle fracture. The model couples a second-order hyperbolic equation for elastodynamics with the Ambrosio-Tortorelli regularization of the…
This work presents the first finite-time analysis for the last-iterate convergence of average-reward $Q$-learning with an asynchronous implementation. A key feature of the algorithm we study is the use of adaptive stepsizes, which serve as…
This work describes methodologies to successfully implement the Implicit Monte Carlo (IMC) scheme for thermal radiative transfer in reduced-precision floating-point arithmetic. The methods used can be broadly categorized into scaling…
Adaptive importance sampling is a class of techniques for finding good proposal distributions for importance sampling. Often the proposal distributions are standard probability distributions whose parameters are adapted based on the…
The vanilla fractional order gradient descent may oscillatively converge to a region around the global minimum instead of converging to the exact minimum point, or even diverge, in the case where the objective function is strongly convex.…
We analyze the line radiative transfer in protoplanetary disks using several approximate methods and a well-tested Accelerated Monte Carlo code. A low-mass flaring disk model with uniform as well as stratified molecular abundances is…