SPADE: Sequential-clustering Particle Annihilation via Discrepancy Estimation

05/11/2020
by   Sihong Shao, et al.
0

For an empirical signed measure μ = 1/N(∑_i=1^P δ__i - ∑_i=1^M δ__i), particle annihilation (PA) removes N_A particles from both {_i}_i=1^P and {_i}_i=1^M simultaneously, yielding another empirical signed measure ν such that ∫ f ν approximates to ∫ f μ within an acceptable accuracy for suitable test functions f. 62G09 Such annihilation of particles carrying opposite importance weights has been extensively utilized for alleviating the numerical sign problem in particle simulations. In this paper, we propose an algorithm for PA in high-dimensional Euclidean space based on hybrid of clustering and matching, dubbed the Sequential-clustering Particle Annihilation via Discrepancy Estimation (SPADE). It consists of two steps: Adaptive clustering of particles via controlling their number-theoretic discrepancies, and independent random matching among positive and negative particles in each cluster. Both deterministic error bounds by the Koksma-Hlawka inequality and non-asymptotic random error bounds by concentration inequalities are proved to be affected by two factors. One factor measures the irregularity of point distributions and reflects their discrete nature. The other relies on the variation of test function and is influenced by the continuity. Only the latter implicitly depends on dimensionality d, implying that SPADE can be immune to the curse of dimensionality for a wide class of test functions. Numerical experiments up to d=1080 validate our theoretical discoveries.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/09/2023

Efficient displacement convex optimization with particle gradient descent

Particle gradient descent, which uses particles to represent a probabili...
research
08/28/2018

The dispersion time of random walks on finite graphs

We study two random processes on an n-vertex graph inspired by the inter...
research
05/27/2023

Provably Fast Finite Particle Variants of SVGD via Virtual Particle Stochastic Approximation

Stein Variational Gradient Descent (SVGD) is a popular variational infer...
research
08/11/2017

Visualizing Time-Varying Particle Flows with Diffusion Geometry

The tasks of identifying separation structures and clusters in flow data...
research
09/21/2022

Particle-based, rapid incremental smoother meets particle Gibbs

The particle-based, rapid incremental smoother (PARIS) is a sequential M...
research
01/24/2023

Sequential propagation of chaos

A new class of particle systems with sequential interaction is proposed ...
research
08/22/2023

A Study of Particle Motion in the Presence of Clusters

The motivation for this study came from the task of analysing the kineti...

Please sign up or login with your details

Forgot password? Click here to reset