Recursive Adaptive Importance Sampling

• Recursive adaptive importance sampling is a Monte Carlo method that updates the proposal distribution using past weighted samples to accurately estimate integrals.
• It employs techniques such as single-sample stochastic gradients, stagewise batch updates, and particle replenishment to manage weight degeneracy and optimize sampling performance.
• The framework leverages convex optimization and asymptotic guarantees to balance statistical efficiency against computational cost while ensuring unbiased estimates.

Searching arXiv for recent and foundational papers on recursive adaptive importance sampling and closely related adaptive importance-sampling frameworks. Recursive adaptive importance sampling denotes a family of Monte Carlo methods in which the proposal distribution is not fixed in advance but is updated online from previously generated weighted samples. The common objective is to estimate an integral or expectation while simultaneously learning a proposal that reduces importance-weight variability, improves effective sample size, or balances statistical efficiency against computational cost. In the modern literature, the topic encompasses single-sample stochastic-gradient recursions, stagewise adaptive multiple importance sampling with recycling, tempering-based stabilization, adaptive proposal-family fitting, and recursive Bayesian weight updates with replenishment (Ryu et al., 2014, Delyon et al., 2018).

1. Formal setting and core definitions

A standard formulation begins with a target quantity

$I=\mathbf{E}\,\phi(X)=\int \phi(x)f(x)\;dx,$

where $X\sim f$. Ordinary Monte Carlo draws IID samples from $f$ and uses

$$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$

Importance sampling instead introduces a proposal density $\tilde f$, with $\tilde f(x)>0$ whenever $\phi(x)f(x)\neq 0$, and forms

$$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$

This estimator is unbiased, and its variance is governed by the second moment of the weighted integrand (Ryu et al., 2014).

Recursive adaptive importance sampling replaces the fixed proposal by a sequence $\tilde f_1,\tilde f_2,\ldots$, with $X_i\sim \tilde f_i$, and estimator

$X\sim f$0

The recursive feature is that $X\sim f$1 is selected from information accumulated up to iteration $X\sim f$2. In stage-based formulations, stage $X\sim f$3 consists of an exploration step using $X\sim f$4 samples from $X\sim f$5, followed by an exploitation step that updates the sampling policy $X\sim f$6; the resulting empirical sums have a martingale structure, and the adaptive estimator remains centered at the target integral under support conditions (Delyon et al., 2018).

Across the literature, the target of adaptation varies. Some methods adapt the natural parameter of an exponential-family proposal to minimize variance (Ryu et al., 2014). Others adapt a Gaussian-mixture proposal by fitting weighted samples to intermediate targets (Aufort et al., 2022). In rare-event stochastic root-finding, the adaptive object is an importance-sampling parameter $X\sim f$7 determined by the current root estimate (He et al., 2021). In recursive Bayesian computation, weighted particles are propagated through likelihood increments and periodically replenished by a refitted proposal (Barreto et al., 9 Sep 2025). A broader interpretation also includes procedures that adapt the number of proposals inside an importance-resampling Markov kernel rather than the proposal density itself (Laitinen et al., 28 Nov 2025).

2. Recursive update architectures

The simplest recursive architecture uses each new sample for two tasks simultaneously: estimation of the target quantity and update of the proposal for future sampling. This one-pass coupling is explicit in Convex AdaMC, where each sample contributes one importance weight to the Monte Carlo average and one stochastic gradient step for the next proposal parameter (Ryu et al., 2014). A similar structure appears in stochastic approximation for quantile estimation, where the current sample under $X\sim f$8 updates $X\sim f$9, and the new sampler is then set to $f$0 (He et al., 2021).

A second architecture is stagewise or batchwise. In the asymptotic-optimality framework, stage $f$1 draws $f$2 samples from $f$3, updates the estimator, and then updates $f$4; no restriction is imposed on the allocation policy $f$5, so the theory does not require a prescribed split between exploration and exploitation (Delyon et al., 2018). Adaptive multiple importance sampling methods follow this pattern as well: a current batch is sampled, weighted, and then used to fit the next proposal, often while retaining all past samples for a final multiple-importance denominator (Marin et al., 2012).

A third architecture updates a posterior approximation recursively with incoming data. RAISOR exploits

$f$6

which yields the cheap weight recursion

$f$7

Because repeated weight updates induce degeneracy, replenishment steps are inserted at selected times; the proposal is then adapted to the current weighted sample and a fresh particle cloud is drawn (Barreto et al., 9 Sep 2025).

The literature also contains a deterministic analogue. Quantization based recursive Importance Sampling keeps the same optimization target as stochastic-approximation RIS but replaces random Monte Carlo estimation of the criterion and its derivatives by finite deterministic sums under an optimal quantizer, followed by Newton–Raphson zero search (Frikha et al., 2011). This is explicitly presented as a deterministic counterpart of recursive importance sampling.

3. Variance minimization and convex stochastic programming

A central line of work formulates recursive adaptation as an optimization problem over a proposal family. For exponential-family proposals

$f$8

the per-sample variance of the importance-sampling estimator is

$f$9

The optimization problem is to minimize $$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$0 over a convex parameter set $$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$1 (Ryu et al., 2014).

The key structural theorem is that $$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$2 is a convex function of the natural parameter $$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$3. The proof uses convexity of the log-partition function $$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$4, and the variance objective is written as an integral of convex functions of $$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$5. This convexity is important because it rules out the local-minimum pathologies that often complicate adaptive importance sampling outside exponential-family settings (Ryu et al., 2014).

Convex AdaMC performs stochastic gradient descent on this variance objective while accumulating the Monte Carlo estimate: $$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$6

$$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$7

$$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$8

$$\hat{I}_n^\mathrm{MC}=\frac{1}{n}\sum^n_{i=1}\phi(X_i).$$9

where $\tilde f$0 is Euclidean projection onto $\tilde f$1. The stochastic gradient is unbiased because

$\tilde f$2

The resulting estimator is unbiased for $\tilde f$3 even though the proposal changes over time (Ryu et al., 2014).

The same direct-optimization idea also appears in structured probabilistic domains. In Bayesian networks and influence diagrams, the proposal is parameterized by conditional-probability tables, and a sequential stochastic-gradient update

$\tilde f$4

is applied either to the variance objective itself or to discrepancy measures between the current proposal and approximations of the optimal proposal. In that setting, the minimum-variance proposal for positive $\tilde f$5 is

$\tilde f$6

which is unavailable because the normalizing constant is the unknown target quantity; recursive adaptation is introduced precisely to approximate this unavailable optimum online (Ortiz et al., 2013).

4. Stabilization by recycling, tempering, weighting, and replenishment

Recursive adaptation creates a recurring stability problem: early proposals may be poor, high-variance weights can distort learning, and repeated reweighting can collapse the effective sample size. Several strands of the literature address this issue by modifying the adaptation target rather than the basic importance ratio.

AMIS introduces a recycling denominator that uses the mixture of all proposals visited so far: $\tilde f$7 The consistency analysis shows that full recycling inside the learning step is delicate; the proved version therefore updates $\tilde f$8 using only the current sample with ordinary weights, and performs only one final recycling step after adaptation is complete. The paper’s methodological lesson is that recursive adaptation and recycling can be separated: current samples drive learning, while all samples can still be reused in the final estimator (Marin et al., 2012).

TAMIS stabilizes adaptation by introducing a tempered intermediate target

$\tilde f$9

which transforms the weights to $\tilde f(x)>0$0, and then an anti-truncation map

$\tilde f(x)>0$1

Tempering reduces weight degeneracy, while anti-truncation preserves contamination from the current proposal $\tilde f(x)>0$2 and helps prevent premature collapse. The tempering parameter is calibrated automatically by an ESS constraint, and the threshold $\tilde f(x)>0$3 is taken as a quantile of the tempered weights (Aufort et al., 2022).

Weighted AIS addresses the finite-sample cost of poor early stages by introducing stage weights

$\tilde f(x)>0$4

with $\tilde f(x)>0$5. The stated purpose is to forget poor samples from early stages while preserving unbiasedness for unnormalized integrals (Delyon et al., 2018).

RAISOR treats degeneration through replenishment rather than weight transformation. Sample quality is monitored by the Relative Effective Sample Size

$\tilde f(x)>0$6

with empirical estimator

$\tilde f(x)>0$7

When estimated RESS falls below a threshold, the method refits the proposal and regenerates particles (Barreto et al., 9 Sep 2025).

5. Proposal families and adaptive quantities

The umbrella term covers markedly different choices of proposal family and adaptive variable.

Method	Proposal or kernel	Adaptive quantity
Convex AdaMC	Exponential family $\tilde f(x)>0$8	Natural parameter $\tilde f(x)>0$9
Modified AMIS	Parametric proposal $\phi(x)f(x)\neq 0$0	Proposal parameter $\phi(x)f(x)\neq 0$1
TAMIS	Gaussian mixture model with diagonal covariances	$\phi(x)f(x)\neq 0$2, $\phi(x)f(x)\neq 0$3, and mixture parameters
DAIS	Gaussian $\phi(x)f(x)\neq 0$4	$\phi(x)f(x)\neq 0$5, $\phi(x)f(x)\neq 0$6, and damping $\phi(x)f(x)\neq 0$7
VAE-based AIS	VAE proposal density	Neural-network parameters of the proposal
Adaptive i-SIR	i-SIR transition $\phi(x)f(x)\neq 0$8	Proposal count $\phi(x)f(x)\neq 0$9
RAISOR	Weighted particles plus replenishment proposal	Replenishment times and proposal parameter $$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$0

Within Gaussian approximation methods, DAIS forms the damped target

$$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$1

or equivalently

$$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$2

and then updates the mean and covariance of the Gaussian approximation through Stein-identity-based moment corrections. The damping parameter $$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$3 is chosen as the largest value for which the current effective sample size exceeds a fixed threshold, so the method adapts both the proposal and the amount of tempering (Boom et al., 2024).

High-dimensional non-parametric AIS replaces Gaussian or Gaussian-mixture proposals by a variational autoencoder. The proposal density is learned from weighted samples using a weighted ELBO, together with a learnable prior based on the VampPrior and a pre-training procedure intended to reduce posterior collapse. The learned proposal is then inserted into existing adaptive importance-sampling algorithms and cross-entropy rare-event procedures (Demange-Chryst et al., 2023).

Adaptive i-SIR occupies a boundary position. It is not a general proposal-adaptation scheme, since it does not adapt $$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$4; instead, it introduces a fractional proposal count $$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$5, a generalized kernel

$$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$6

and a stochastic-approximation update of $$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$7 based on an approximate efficiency criterion. It is therefore recursive and importance-sampling-based, but its adaptive variable is computational effort rather than the proposal law (Laitinen et al., 28 Nov 2025).

6. Asymptotic guarantees, applications, and limitations

A defining feature of the subject is that many adaptive procedures come with asymptotic guarantees showing that online learning does not destroy first-order efficiency. In the stagewise AIS framework, if the proposal sequence converges suitably and a moment condition holds, then

$$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$8

and in parametric AIS, consistency of the sampling policy yields the oracle property

$$\hat{I}^{\mathrm{IS}}_n=\frac{1}{n}\sum^n_{i=1}\phi(X_i)\frac{f(X_i)}{\tilde{f}(X_i)}.$$9

meaning that adaptive learning is asymptotically as efficient as using the limiting optimal proposal from the outset (Delyon et al., 2018).

Convex AdaMC strengthens this theme in a single-sample recursive setting. Under compactness of $\tilde f_1,\tilde f_2,\ldots$0 and a finite fourth-moment condition, the estimator variance satisfies

$\tilde f_1,\tilde f_2,\ldots$1

so

$\tilde f_1,\tilde f_2,\ldots$2

and

$\tilde f_1,\tilde f_2,\ldots$3

The limiting variance is the best achievable within the chosen exponential family (Ryu et al., 2014).

In stochastic root-finding and quantile estimation, adaptive importance sampling resolves the circular dependence between the unknown solution and the unknown optimal sampler. The resulting SAA, Robbins–Monro SA, and Polyak–Ruppert SA estimators are strongly consistent and asymptotically normal, and the asymptotic variance matches that of the fixed optimal sampler at the true solution. Numerical examples report large variance reductions for extreme quantiles, including standard normal, exponential, Pareto-tailed, and portfolio VaR/CVaR settings (He et al., 2021).

Applications span several domains. Structured-domain methods target belief inference in Bayesian networks and action evaluation in influence diagrams (Ortiz et al., 2013). Quantization-based recursive IS is developed for option pricing in both multi-dimensional and path-dependent diffusion settings (Frikha et al., 2011). TAMIS is evaluated on banana-shaped targets and high-dimensional Gaussian targets (Aufort et al., 2022). DAIS targets Gaussian posterior approximation for intractable Bayesian posteriors (Boom et al., 2024). VAE-based AIS addresses multimodal sampling and rare-event estimation in high dimensions (Demange-Chryst et al., 2023). RAISOR is applied to Gaussian-process regression for sea surface temperature prediction in the Gulf of Mexico (Barreto et al., 9 Sep 2025).

Several limitations recur across the literature. Proposal-family misspecification remains fundamental: if the proposal family cannot represent the target well, KL divergence may not vanish, the temperature may not reach $\tilde f_1,\tilde f_2,\ldots$4, or the algorithm may converge only to the best available approximation inside the chosen family (Aufort et al., 2022). Convex-programming guarantees for Convex AdaMC require an exponential-family proposal, a convex compact parameter set, and finite fourth moments, and the constants in the variance bound are “not very informative for tuning in practice” (Ryu et al., 2014). AMIS consistency is established only for a modified learning rule, not for the fully recycled learning dynamics of the original algorithm (Marin et al., 2012). RAISOR is explicitly described as less attractive in high-dimensional settings, where degeneration accelerates rapidly (Barreto et al., 9 Sep 2025). DAIS is recursive and adaptive, but it is not standard SMC because it does not maintain a resampled particle cloud across iterations (Boom et al., 2024). Adaptive i-SIR provides a theory for tuning the number of proposals, not for adapting the proposal distribution itself (Laitinen et al., 28 Nov 2025).

A common misconception is therefore that “recursive adaptive importance sampling” names a single algorithmic template. The literature instead shows a family resemblance: sequential proposal improvement from weighted samples, preservation or recovery of asymptotic exactness, and explicit mechanisms for controlling instability caused by changing proposals. What differs is the adaptive variable—proposal parameter, temporary target, damping level, recycling weight, replenishment schedule, or proposal count—and the mathematical tool used to justify it.