Adaptive Resampling (ARS) Overview

• Adaptive Resampling (ARS) is a family of methods that condition resampling decisions on diagnostics like ESS, KLD, or local image signals to balance computational cost and estimation quality.
• It includes techniques such as KLD-resampling for particle filters and adaptive particle allocation in Resample-Move, demonstrating improved performance with fewer particles or evaluations.
• ARS is broadly applied in domains like filtering, image processing, and optimization, where adaptive decisions mitigate weight degeneracy and tailor resource allocation based on data complexity.

Searching arXiv for papers and context on adaptive resampling and related ARS terminology. Adaptive resampling is a family of procedures in which the resampling operation is made data dependent rather than fixed in advance. Across the arXiv literature, this includes particle-filter rules that trigger resampling only when weight degeneracy becomes severe, particle-allocation schemes that expand the population when an intermediate distribution is poorly approximated, image-processing methods that predict spatially varying interpolation kernels and apply them adaptively to each position in the image, and optimization procedures that allocate additional evaluations to uncertain or potentially Pareto-relevant points. The acronym is also overloaded: in neighboring Monte Carlo literature, “ARS” can denote adaptive rejection sampling, which is distinct from adaptive resampling proper (Li et al., 2013, Huggins et al., 2015, Jia et al., 2017, Budszuhn et al., 27 Mar 2025, Martino et al., 2015).

1. Terminology and conceptual scope

In the literature summarized here, adaptive resampling is not a single canonical algorithm. It is a recurring design principle in which a resampling decision is conditioned on a diagnostic such as ESS, KLD, posterior complexity, class-wise performance, local image structure, or bootstrap-estimated uncertainty. This suggests that “adaptive resampling” is best understood as a methodological pattern rather than a field-specific primitive.

Domain	What is adapted	Signal used
Particle filtering	Whether to trigger resampling or how many particles to resample	ESS or KLD (Finke et al., 24 Jun 2026, Li et al., 2013)
Resample-Move SMC	Particle-set size at difficult intermediate distributions	$\mathrm{ESS}_n / R_n$ (Fraccaro et al., 2016)
Image resampling	Spatially varying interpolation kernels	Local content, per-pixel context, or channel-specific structure (Jia et al., 2017, Pise et al., 3 Nov 2025)
Noisy optimization	Additional evaluations of candidate points	Probability of dominance via bootstrap (Budszuhn et al., 27 Mar 2025)
Imbalanced classification	Sampling distribution over classes during training	Class-wise macro F1 (Basandrai et al., 31 Aug 2025)

A recurrent misconception is that adaptive resampling always means “resample more often.” In several formulations the opposite is central: resampling is postponed until needed, or the sampling budget is concentrated only where the approximation is weak. Another misconception is that all ARS methods optimize the same objective. In fact, the objectives range from controlling particle degeneracy and divergence from the target distribution to preserving image detail, reducing variance of $\log \hat Z$, or improving macro-F1.

2. Particle filters: KLD-resampling and adaptive sample size

In particle filtering, adaptive resampling can mean determining the number of particles to resample so that the Kullback-Leibler distance between the distribution of particles before resampling and after resampling does not exceed a pre-specified error bound (Li et al., 2013). The setting is a weighted particle approximation $\{x_t^{(i)}, w_t^{(i)}\}$ to the posterior $p(x_t \mid y_{1:t})$, followed by resampling to an equally weighted set. The method bins the state space into $k$ occupied cells and chooses the resampled size online so that, with probability at least $1-\delta$, the KL divergence remains below $\varepsilon$.

Using the $\chi^2$ approximation and the Wilson-Hilferty approximation, the required sample size is written as

$$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$

Operationally, the algorithm draws resampled particles one by one, updates the number of occupied bins, and recomputes the required $N$ whenever a new bin becomes non-empty. This differs from Fox’s KLD-sampling because the bound is inserted into the resampling step rather than the sampling step; the formulation therefore measures the fit of the distribution represented by weighted particles based on KLD during resampling rather than in sampling (Li et al., 2013).

The reported target-tracking simulations use a maneuvering-target scenario with RMSE, average number of particles resampled over time, and wall-clock computational time as metrics. The observations are that ARS via KLD-resampling achieves RMSE comparable to both fixed-$\log \hat Z$0 SIR-PF and Fox’s KLD-sampling PF, uses significantly fewer particles on average when the posterior is sharp, and automatically increases $\log \hat Z$1 when the posterior spreads out during maneuvers. The same summary reports up to 40–50% savings in resampling cost while delivering the same estimation quality at lower average computational cost (Li et al., 2013).

3. ESS-triggered adaptive resampling, $\log \hat Z$2-ESS, and conditional SMC

A second major line of work defines adaptive resampling as an online decision rule based on particle degeneracy. In the simplest ESS-based formulation, one fixes a threshold fraction $\log \hat Z$3 and triggers resampling when

$\log \hat Z$4

A smaller $\log \hat Z$5 leads to fewer resampling steps, whereas a larger $\log \hat Z$6 keeps weights more balanced (Finke et al., 24 Jun 2026). In the unified CSMC framework, adaptive resampling is represented as a mixture of trivial resampling and a proper resampling scheme, with the mixture determined by the ESS criterion. Under the assumptions of proper weighting and persistence, the resulting SMC estimator of the normalizing constant remains unbiased, and the ARS-CSMC transition kernel leaves the target smoothing distribution invariant (Finke et al., 24 Jun 2026).

A more stringent diagnostic is the $\log \hat Z$7-ESS,

$\log \hat Z$8

which is smaller than the usual $\log \hat Z$9-ESS and therefore imposes stricter control on weight concentration (Huggins et al., 2015). The conditional adaptive-resampling particle filter uses a threshold $\{x_t^{(i)}, w_t^{(i)}\}$0 and resamples when the $\{x_t^{(i)}, w_t^{(i)}\}$1-ESS falls below it. This construction supports direct divergence control rather than only control of mean-squared error of test-function estimates. Under the $\{x_t^{(i)}, w_t^{(i)}\}$2-ESS bound and a strong-mixing assumption, the cited results provide bounds on $\{x_t^{(i)}, w_t^{(i)}\}$3, a minorization inequality for the sampling kernel, and $\{x_t^{(i)}, w_t^{(i)}\}$4 control of KL and $\{x_t^{(i)}, w_t^{(i)}\}$5 divergences between the target distribution and the law of the SMC sample (Huggins et al., 2015).

The same framework is carried into Particle Gibbs. Replacing the conditional SMC kernel by its adaptive-resampling variant preserves invariance and yields a minorization condition implying uniform ergodicity of the conditional kernel; the full adaptive-resampling Particle Gibbs chain is then geometrically ergodic whenever the ideal Gibbs sampler is (Huggins et al., 2015). This suggests that adaptive resampling in SMC is not merely a computational heuristic: in these formulations it is tightly coupled to validity guarantees for approximate sampling and PMCMC.

4. Adaptive particle allocation in Resample-Move

For normalizing-constant estimation, adaptive resampling appears as adaptive expansion of the particle set within the Resample-Move framework. The motivating observation is that a fixed number of particles at every intermediate distribution is suboptimal because some transitions contribute disproportionately to the variance of the estimate (Fraccaro et al., 2016). Let

$\{x_t^{(i)}, w_t^{(i)}\}$6

Under independent equally weighted samples and a total budget $\{x_t^{(i)}, w_t^{(i)}\}$7, the optimal particle allocation is

$\{x_t^{(i)}, w_t^{(i)}\}$8

and the minimized variance is

$\{x_t^{(i)}, w_t^{(i)}\}$9

Because $p(x_t \mid y_{1:t})$0 is not available a priori, Adaptive Resample-Move (ARM) uses the proxy

$p(x_t \mid y_{1:t})$1

with $p(x_t \mid y_{1:t})$2 as a per-particle quality diagnostic. If $p(x_t \mid y_{1:t})$3, the particle set is expanded; if $p(x_t \mid y_{1:t})$4, the current population is regarded as sufficient (Fraccaro et al., 2016). The algorithm therefore implements a greedy online version of the optimal allocation rule.

The benchmark results cited for Gaussian Process Classification and Restricted Boltzmann Machine partition-function estimation report that ARM estimates the normalizing constant with a smaller variance, using less computational resources, than either Resample-Move with a fixed number of particles or Annealed Importance Sampling; a further reported advantage is that ARM is easier to tune (Fraccaro et al., 2016). In the GPC experiments, the description states that ARM reaches low bias and variance an order of magnitude faster than AIS or fixed-$p(x_t \mid y_{1:t})$5 RM. In the RBM experiments, ARM and especially ARM-anticipate match or beat AIS in variance using less than one minute of compute, whereas AIS-MAS takes more than ten minutes. The practical control variables are $p(x_t \mid y_{1:t})$6, $p(x_t \mid y_{1:t})$7, and $p(x_t \mid y_{1:t})$8 rather than $p(x_t \mid y_{1:t})$9-grids or HMC leapfrog parameters.

5. Adaptive image resampling and spatially varying kernels

In image processing, adaptive resampling refers to content-aware interpolation rather than particle-population control. Deep adaptive image resampling for super-resolution uses a kernel-estimation FCN to predict spatially variant interpolation kernels and an adaptive resampling layer that applies the estimated kernels adaptively to each position in the image (Jia et al., 2017). If $k$0 denotes the filter predicted at HR location $k$1, the reconstruction is expressed as

$k$2

The model is trained end to end with an $k$3 reconstruction loss. A recursive extension is reported to add approximately $k$4 dB on Set5/Set14 per extra recursion, and the method is also extended to joint image filtering (Jia et al., 2017).

A later downscaling formulation, ADK-Net, learns a unique, spatially varying resampling kernel for each output pixel and each color channel, followed by per-pixel convolution on the HR image (Pise et al., 3 Nov 2025). The architecture contains a ResNet-based feature extractor and three independent channel-specific kernel generators, with kernel normalization by min-max scaling to $k$5 and sum-to-one normalization. On the RealSR test set for $k$6 downscaling, the reported results are Bicubic at $k$7 dB / $k$8, DPID at $k$9 dB / $1-\delta$0, IDCL at $1-\delta$1 dB / $1-\delta$2, SDFlow at $1-\delta$3 dB / $1-\delta$4, and ADK-Net at $1-\delta$5 dB / $1-\delta$6; the ablation summary reports that sharing the trunk or using a single stream for all channels drops PSNR by more than $1-\delta$7 dB (Pise et al., 3 Nov 2025).

Remote-sensing and astronomical variants use different adaptive signals. A Cellular Automata–CNN hybrid adaptive resampling scheme for remotely sensed imagery selects among $1-\delta$8 according to local pixel variation and texture variation, evaluated over a Laplacian pyramid; the reported comparison states that the method consistently achieves higher correlation, lower entropy deviation, and reduced average error than classical kernels (Katiyar et al., 2014). For JWST IFU spectroscopy, adaptive trace modeling fits cubic B-spline profiles along slices, oversamples detector traces before cube rectification, and switches between spline-based and linear interpolation according to the derivative of the normalized spline. The reported effect is a reduction of single-spaxel artifact amplitudes from approximately $1-\delta$9–$\varepsilon$0 down to approximately $\varepsilon$1, with aperture-summed flux conservation better than $\varepsilon$2 rms after ARS (Law et al., 27 Mar 2026).

This suggests a domain-specific shift in meaning: in imaging, “adaptive resampling” usually denotes locally varying interpolation or reconstruction operators, even when the formal mechanism is still a data-dependent redistribution of sampling weight.

6. Adaptive resampling in learning, optimization, and proposal adaptation

Beyond SMC and image formation, adaptive resampling is used to reallocate budget across classes, features, candidate solutions, or proposals. In imbalanced classification, Adaptive Resampling-based Training (ART) periodically recomputes a class-sampling distribution from class-wise validation F$\varepsilon$3 scores. With $\varepsilon$4 the per-class F$\varepsilon$5, the difficulty score is $\varepsilon$6, the normalized performance-based distribution is $\varepsilon$7, and the training distribution is blended with the empirical prior as

$\varepsilon$8

The reported empirical summary states that ART improves macro F1 by an average of $\varepsilon$9 percentage points across all tested tabular datasets relative to training on the original imbalanced data, and that gains on tabular datasets are significant under paired $\chi^2$0-tests and Wilcoxon tests with $\chi^2$1 (Basandrai et al., 31 Aug 2025).

In iterated sampling importance resampling, the adaptive variable is the number of proposals $\chi^2$2. The method defines a cost-weighted proxy

$\chi^2$3

where $\chi^2$4 is the average holding probability, proves that the asymptotic variance $\chi^2$5 is strictly decreasing and strictly convex in $\chi^2$6, and introduces a generalized transition with fractional “number of proposals” to support online adaptation (Laitinen et al., 28 Nov 2025). The adaptive algorithm updates a reparameterized proposal count by stochastic approximation and is accompanied by a strong law of large numbers for bounded test functions (Laitinen et al., 28 Nov 2025).

Adaptive resampling of random Fourier features aims to approach the optimal frequency law

$\chi^2$7

by repeatedly resampling frequencies according to the magnitudes of learned amplitudes $\chi^2$8 (Huang et al., 3 Sep 2025). The main theorem summarized in the source states that, under decay and regularity assumptions and suitable choices of the cutoff $\chi^2$9 and fraction $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$0, one ARS step yields a resampled law whose generalization error approaches the optimal constant $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$1 up to a factor $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$2 (Huang et al., 3 Sep 2025).

In noisy multi-objective optimization, ARS uses bootstrap estimates of the means and a probability-of-dominance criterion to decide whether a point merits additional evaluation. If $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$3 is the maximum estimated probability that $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$4 dominates a member of the current Pareto-front estimate, then a point is resampled only when $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$5 lies between lower and upper thresholds $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$6 and $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$7 (Budszuhn et al., 27 Mar 2025). The empirical summary reports that ARS is better than all other sequential NSGA-II variants in $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$8 of test cases and worse in $$N \ge \frac{k-1}{2\varepsilon} \left[ 1 - \frac{2}{9(k-1)} + \sqrt{\frac{2}{9(k-1)}}\, z_{1-\delta} \right]^3.$$9, while only static one-shot NSGA-II sometimes beats ARS, notably under $N$0 noise (Budszuhn et al., 27 Mar 2025).

A related but geometrically different use appears in multi-view 3D detection. FrustumFormer performs adaptive instance-aware resampling by constructing instance frustums from 2D masks, predicting a BEV occupancy mask, and dedicating additional deformable-attention sampling only to selected BEV queries. The component ablation reports an improvement from $N$1 mAP / $N$2 NDS for the baseline to $N$3 mAP / $N$4 NDS for the full adaptive instance-aware resampling module, and to $N$5 mAP / $N$6 NDS with temporal fusion on top (Wang et al., 2023).

7. Trade-offs, limitations, and the distinction from adaptive rejection sampling

The central trade-off in adaptive resampling is between computational cost and approximation quality. In ESS-triggered particle filters, larger thresholds induce more frequent resampling and lower degeneracy, while smaller thresholds save work but allow more weight collapse (Finke et al., 24 Jun 2026). In KLD-resampling, smaller $N$7 or smaller $N$8 imply more conservative sample sizes (Li et al., 2013). In ARM, more particle expansions reduce variance of $N$9 but increase runtime (Fraccaro et al., 2016). In learned image resampling, larger or more specialized kernel generators can improve fidelity but increase model complexity (Pise et al., 3 Nov 2025). In noisy optimization, more aggressive resampling can waste budget on points that are already confidently dominated or have too little chance to improve (Budszuhn et al., 27 Mar 2025).

Another recurrent limitation is that adaptivity depends on the adequacy of the diagnostic. ESS summarizes weight concentration but not all aspects of particle impoverishment; KLD-resampling depends on binning; ARM depends on ESS as a proxy for the unknown variance term $\log \hat Z$00; bootstrap-based ARS in noisy optimization assumes global homoscedasticity when the number of observations is small (Li et al., 2013, Fraccaro et al., 2016, Budszuhn et al., 27 Mar 2025). These are not objections to adaptive resampling as such, but they locate the modeling burden in the choice of the adaptation signal.

Finally, adaptive resampling should be distinguished from adaptive rejection sampling. “Adaptive Rejection Sampling with fixed number of nodes” introduces Cheap Adaptive Rejection Sampling (CARS), where the target is a univariate log-concave density, the proposal is a piecewise-exponential envelope, and the number of support nodes is held fixed to keep proposal-sampling cost constant (Martino et al., 2015). “Parsimonious Adaptive Rejection Sampling” likewise describes an efficient trade-off between acceptance rate and proposal complexity, with the resulting algorithm reported as faster than standard ARS (Martino, 2017). These methods concern adaptive proposal construction inside rejection sampling, not adaptive triggering or allocation of resampling steps. The shared acronym is therefore a source of genuine ambiguity rather than a terminological variant of the same method.