Search arXiv⌕ Search

arXiv · 2610.01120

Sign-Switched Antithetic Coupling for Signed Gradient-Particle Methods

Abstract

Gradient random-walk methods represent the spatial derivative of a solution by signed particles and recover the solution by summing their masses. We reduce the sampling error of such simulations for one-dimensional convection-diffusion equations by running them in pairs with particles matched in order of position. Reflected pairing, the standard antithetic choice, gives matched particles opposite displacements. In sign-switched pairing, matched particles of equal sign receive opposite displacements and those of opposite sign the same displacement. Each simulation keeps the probability distribution of the solver, so the pair average has the expectation and bias of one simulation. For a fixed matching, we prove that sign-switched pairing minimizes the variance contribution of each matched pair at the last diffusion step. We also derive an exact formula for the variance it removes relative to reflected pairing. For the heat equation both results extend to every step, and we measure the accumulated variance reduction numerically. In Burgers tests, with sample sizes chosen from pilot runs and checked on fresh runs, sign-switched pairing meets a mean-squared-error target with 4 simulations, compared with 65 for independent sampling and 34 for reflected pairing. Against within-sign pairing, which matches only particles of equal sign, it has about 26% lower variance with 8192 particles. With 2048 particles it meets a second target in about 40% less time. The gain persists for further profiles, later times, other viscosities, and a cubic flux, supporting sign-switched pairing as an inexpensive way to improve repeated field estimates where particles of opposite sign meet.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephen Abkin, Prabir Daripa. 2026-10-01. Sign-Switched Antithetic Coupling for Signed Gradient-Particle Methods. https://arxiv.org/abs/2610.01120

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Neural network-driven domain decomposition for efficient solutions to the Helmholtz equation

Accurately simulating wave propagation is crucial in fields such as acoustics, electromagnetism, and seismic analysis. Traditional numerical methods, like finite difference and finite element approaches, are widely used to solve governing partial differential equations (PDEs) such as the Helmholtz equation. However, these methods face significant computational challenges when applied to high-frequency wave problems in complex two-dimensional domains. This work investigates Finite Basis Physics-Informed Neural Networks (FBPINNs) and their multilevel extensions as a promising alternative. These methods leverage domain decomposition, partitioning the computational domain into overlapping sub-domains, each governed by a local neural network. We assess their accuracy and computational efficiency in solving the Helmholtz equation for the homogeneous case, demonstrating their potential to mitigate the limitations of traditional approaches.

math.NA↗

Differentiating through Stochastic Differential Equations: A Primer

Dynamical systems are essential to model various phenomena in physics, finance, economics, and are also of current interest in machine learning. A central modeling task is investigating parameter sensitivity, whether tuning atmospheric coefficients, computing financial Greeks, or optimizing neural networks. These sensitivities are mathematically expressed as derivatives of an objective function with respect to parameters of interest and are rarely available analytically, necessitating numerical methods for approximating them. While the literature for differentiation of deterministic systems is well-covered, the treatment of stochastic systems, such as stochastic differential equations (SDEs), in most curricula is less comprehensive than what the subtleties arising from the interplay of noise and discretization warrant. This paper provides a primer on numerical differentiation of SDEs organized as a two-tale narrative. Tale 1 demonstrates that differentiating through discretized SDEs, known as the discretize-optimize approach, is reliable for both Itô and Stratonovich calculus. Tale 2 examines the optimize-discretize approach, investigating the continuous limit of adjoint equations from Tale 1 corresponding to the desired gradients. Our aim is to equip readers with a clear guide on the numerical differentiation of SDEs: computing gradients correctly in both Itô and Stratonovich settings, understanding when discretize-optimize and optimize-discretize agree or diverge, and developing intuition for reasoning about stochastic differentiation beyond the cases explicitly covered.

math.NA↗

A discrete gradient scheme for preserving QSR-dissipativity

The notion of dissipative dynamical systems provides a formal description of processes that cannot generate energy internally. For these systems, changes in energy can only occur due to an external energy supply or dissipation effects. Unfortunately, dissipative properties tend to deteriorate in numerical computations, especially in nonlinear systems. Discrete gradient methods can help mitigate this problem. In this paper, we present a class of structure-preserving time discretization schemes based on discrete gradients for a special class of systems that are dissipative with respect to a quadratic supply rate.

math.NA↗