Related papers: Physics Constrained Neural Collision Operators for…
History-dependent sampling can reduce long-run Monte Carlo variance by discouraging redundant revisits, but existing schemes typically encode history through empirical measure on finite state spaces, which is infeasible in high-dimensional…
In diffusion Monte Carlo (DMC) methods, the nodes (or zeroes) of the trial wave function dictate the magnitude of the fixed-node (FN) error. Within standard DMC implementations, they emanate from short multideterminant expansions,…
We consider the computational efficiency of Monte Carlo (MC) and Multilevel Monte Carlo (MLMC) methods applied to partial differential equations with random coefficients. These arise, for example, in groundwater flow modelling, where a…
In this paper we present a new approach to control variates for improving computational efficiency of Ensemble Monte Carlo. We present the approach using simulation of paths of a time-dependent nonlinear stochastic equation. The core idea…
The direct simulation Monte Carlo (DSMC) method is widely used to describe rarefied gas flows. The DSMC method accounts for the transport and collisions of computational particles, resulting in higher computational costs in the continuum…
In plasma edge simulations, kinetic Monte Carlo (MC) is often used to simulate neutral particles and estimate source terms. For large-sized reactors, like ITER and DEMO, high particle collision rates lead to a substantial computational cost…
Due to their diverse nature, the faithful description of excited states within electronic structure theory methods remains one of the grand challenges of modern theoretical chemistry. Quantum Monte Carlo (QMC) methods have been applied very…
Aerosol injectors applied in single-particle diffractive imaging experiments demonstrated their potential in efficiently delivering nanoparticles with high density. Continuous optimization of injector design is crucial for achieving…
We rely on Monte Carlo (MC) simulations to interpret searches for new physics at the Large Hadron Collider (LHC) and elsewhere. These simulations result in noisy and approximate estimators of selection efficiencies and likelihoods. In this…
Exact stochastic simulation of continuous-time Markov chains (CTMCs) is essential when discreteness and noise drive system behavior, but the hard categorical event selection in Gillespie-type algorithms blocks gradient-based learning. We…
The Kinetic-Diffusion Monte Carlo (KDMC) method is a powerful tool for simulating neutral particles in fusion reactors. It is a hybrid fluid-kinetic method that is significantly faster than pure kinetic methods at the cost of a small bias…
Purpose: Very fast Monte Carlo (MC) simulations of proton transport have been implemented recently on GPUs. However, these usually use simplified models for non-elastic (NE) proton-nucleus interactions. Our primary goal is to build a…
The Monte Carlo-type Neural Operator (MCNO) introduces a lightweight architecture for learning solution operators for parametric PDEs by directly approximating the kernel integral using a Monte Carlo approach. Unlike Fourier Neural…
We present a method for optimizing the location of the fermion ground-state nodes using a combination of diffusion Monte Carlo (DMC) and projected gradient descent (PGD). A PGD iteration shifts the parameters of an arbitrary node-fixing…
Time-dependent reliability analysis of nonlinear dynamical systems under stochastic excitations is a critical yet computationally demanding task. Conventional approaches, such as Monte Carlo simulation, necessitate repeated evaluations of…
Accurate estimates of long-term risk probabilities and their gradients are critical for many stochastic safe control methods. However, computing such risk probabilities in real-time and in unseen or changing environments is challenging.…
Stochastic versions of recursive integrated climate-economy assessment models are essential for studying and quantifying policy decisions under uncertainty. However, as the number of state variables and stochastic shocks increases, solving…
The recently-introduced self-learning Monte Carlo method is a general-purpose numerical method that speeds up Monte Carlo simulations by training an effective model to propose uncorrelated configurations in the Markov chain. We implement…
We derive an adjoint method for the Direct Simulation Monte Carlo (DSMC) method for the spatially homogeneous Boltzmann equation with a general collision law. This generalizes our previous results in [Caflisch, R., Silantyev, D. and Yang,…
We build on auto-encoding sequential Monte Carlo (AESMC): a method for model and proposal learning based on maximizing the lower bound to the log marginal likelihood in a broad family of structured probabilistic models. Our approach relies…