Spectral Costs of Multinomial and Residual Resampling in High-Dimensional Particle Ensembles: A Free-Probability Analysis
Organizations: the Faculty of Applied Sciences, Macao Polytechnic University, Macao, China
Abstract
Resampling is the standard remedy against weight degeneracy in particle filters, yet its effect on the spectrum of the particle second-moment matrix is poorly understood. We study a single resampling step for a d-dimensional ensemble of N particles with d/N -> c. For any unbiased scheme, the resampled empirical second-moment matrix dominates its pre-resampling counterpart in conditional convex order, while the conditional mean is preserved; the excess second spectral moment equals the Frobenius energy of the resampling perturbation. For multinomial resampling, the empirical count law converges to the mixed-Poisson law determined by the limiting weight law. For residual resampling, the count law is determined by the joint limit of floor-fraction pairs: we classify all residual limits of weight sequences converging to delta_1 in law as a one-parameter family between the deterministic identity and the full multinomial count law. Each count law feeds a common covariance-side spectral map, yielding exact consequences: a closed-form zero-eigenvalue mass, a rank-and-spectral-gap transition with a universal lower edge benchmark, computable regular edges, unbounded right support, and scheme-specific second-moment costs. The effective sample size determines one bulk statistic but cannot determine the limiting spectrum. Pre-registered numerical experiments confirm the theory at every level.
Figures & tables
| Profile | Scheme | empirical | theory | empirical | theory | empirical | theory |
|---|---|---|---|---|---|---|---|
| uniform | pre | ||||||
| uniform | multinomial | ||||||
| uniform | residual | ||||||
| two-point | pre | ||||||
| two-point | multinomial | ||||||
| Quantity | Profile | Profile |
|---|---|---|
| (exact) | ||
| empirical | ||
| theory | ||
| empirical | ||
| theory | ||
| empirical |
| Construction | zero fraction | ||||
|---|---|---|---|---|---|
| uniform | all | ||||
| (theory) | — | ||||
| interior | |||||
| (theory) | |||||
| endpoint |
Spectral Methods
Spectral methods use eigenvalues, eigenvectors, and frequency decompositions to analyze data, graphs, operators, and learning algorithms.
See all 237 papers