SPADE: Sequential-clustering Particle Annihilation via Discrepancy Estimation

For an empirical signed measure $μ= \frac{1}{N} \left(\sum_{i=1}^P δ_{x_i} - \sum_{i=1}^M δ_{y_i}\right)$, particle annihilation (PA) removes $N_A$ particles from both $\{x_i\}_{i=1}^P$ and $\{y_i\}_{i=1}^M$ simultaneously, yielding another empirical signed measure $ν$ such that $\int f d ν$ approximates to $\int f d μ$ within an acceptable accuracy for suitable test functions $f$. 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.

No reviews yet.

No comments yet.