Sequential Variance Accumulation

• Sequential Variance Accumulation is the process by which variance is updated recursively as new data is incorporated, using both classical and modern variance reduction techniques.
• It underpins applications in Monte Carlo sampling, particle filters, and Gaussian process assimilation, ensuring more accurate uncertainty quantification and efficient online estimation.
• Advanced algorithms leveraging sequential variance accumulation inform stopping rules and confidence bounds, enabling real-time calibration and improved decision-making in stochastic systems.

Sequential variance accumulation concerns the way variance is generated, updated, and accounted for as new data or random variables are processed incrementally in a sequential or online fashion. This phenomenon is pivotal in stochastic programming, Monte Carlo sampling methodologies, sequential Monte Carlo (SMC; particle filters), and Gaussian process (Kriging) data assimilation. Rigorous mathematical frameworks and algorithmic schemes have been developed to manage and reduce variance at each step, using both classical and recent techniques. The field also encompasses variance estimation and the provision of stopping rules or confidence bounds in sequential analysis.

1. Fundamental Recursions and Theoretical Foundations

Variance accumulation in a sequential setting is governed by explicit recursive update equations that detail how the variance of a running estimator evolves as additional samples or information are incorporated. In prototypical scenarios such as the running mean of i.i.d. samples or stochastic programming optimality gaps, the variance of the estimator after processing $t+1$ samples is updated as follows:

$$\operatorname{Var}(\hat{\theta}_{t+1}) = \frac{t}{t+1} \operatorname{Var}(\hat{\theta}_t) + \frac{1}{(t+1)^2} \sigma^2$$

where $\sigma^2$ is the (possibly reduced) variance of the new increment. For variance-reduced schemes such as Antithetic Variates (AV) and Latin Hypercube Sampling (LHS), the incremental variance is replaced by their respective $\sigma^2_{\mathrm{AV}}$ or $\sigma^2_{\mathrm{LHS}}$, both strictly less than the nominal variance under suitable conditions, resulting in systematically lower variance accumulation in the sequential estimator. This recursion quantifies precisely how variance propagates and is accumulated stepwise (Park et al., 2020).

2. Variance Decomposition in Particle Filters and Sequential Monte Carlo

In the context of SMC (particle filters), the asymptotic variance of estimators for functionals of the target distribution admits a telescoping decomposition as a sum of local contributions across time:

$\sigma^2(\varphi) = \sum_{p=0}^n v_{p,n}(\varphi)$

with each $v_{p,n}(\varphi)$ representing the variance incurred at time $p$, formally

$$v_{p,n}(\varphi) = \frac{\gamma_p(1)\, \gamma_p(Q_{p,n}(\varphi)^2)}{\gamma_n(1)^2} - \eta_n(\varphi)^2$$

where $\gamma_p, Q_{p,n}, \eta_n$ are the unnormalized Feynman–Kac measures and associated propagators. This decomposition captures the stepwise accumulation of variance intrinsic to sequential resampling and propagation (Bon et al., 2 Oct 2025, Du et al., 2019).

The knot operator provides a powerful abstraction for modifying the transition kernels by incorporating more information (local twisting), producing a variance ordering—more knots induce provably lower asymptotic variance, giving a partial order over Feynman–Kac models by their cumulative sequential variance (Bon et al., 2 Oct 2025).

3. Sequential Variance Estimation and Online Algorithms

Correctly estimating the accumulated variance online is essential for sequential inference and confidence quantification. In SMC, the Lee & Whiteley estimator provides a single-pass $O(nN)$ algorithm that is consistent for the true asymptotic variance (both for nonadaptive and adaptive SMC under standard regularity conditions), leveraging the squared deviation of weighted particles at each step (Du et al., 2019).

More refined algorithms, including coalescent tree-based estimators and backward-sampling approaches, decompose the cumulative variance into contributions from distinct genealogical events, giving detailed diagnostics of variance accumulation by time (Idrissi et al., 2022). The ALVar algorithm adaptively traces genealogies with variable lag to control the bias–variance tradeoff in online variance estimation, with the lag tuned automatically to balance stability and accuracy as the particle filter progresses (Mastrototaro et al., 2022, Olsson et al., 2017).

4. Variance Accumulation in Gaussian Process (Kriging) Sequential Data Assimilation

Kriging (Gaussian process regression) offers an exemplary case where variance is accumulated and subsequently reduced as new observations arrive. The corrected update formula for the predictive variance, when integrating $r$ new observations into a set of $n$ existing data, is:

$$\sigma_{n+r}^2(x) = \sigma_n^2(x) - c_{\mathrm{old}}(X_{\mathrm{new}}, x)^\top E_{\mathrm{new}}^{-1} c_{\mathrm{old}}(X_{\mathrm{new}}, x)$$

with $E_{\mathrm{new}}$ the conditional covariance of the new points given the old, and $c_{\mathrm{old}}$ the conditional covariance vector to the prediction site. Each new datum, by positive definiteness, strictly reduces (never increases) the accumulated predictive variance. The same principle extends to batch-sequential assimilation via Schur complements and maintains computational feasibility and correct uncertainty quantification (Chevalier et al., 2012).

5. Sharp Confidence Intervals and Empirical Bounds for Sequential Accumulation

Recent advances in sequential empirical Bernstein inequalities have produced sharp, time-uniform confidence sequences for the variance of bounded random variables, valid at arbitrary stopping times. These results require only conditional mean and variance stability and do not assume independence, making them robust for a wide spectrum of sequential decision-making procedures:

$$P\left(\hat{V}_T - \sigma^2 \geq R_{T,\delta}\right) \leq \delta$$

where $R_{T,\delta}$ is an explicitly computable bound incorporating realized variance increments. The methodology accumulates local squared deviations as weights and matches the oracle first-order rate for the width of the confidence intervals, considerably outperforming classical self-bounding inequalities, particularly when higher moments are not at their maximal bounds (Martinez-Taboada et al., 4 May 2025).

6. Implications for Algorithm Design and Stopping Rules

Variance accumulation directly informs algorithmic stopping criteria, as in stochastic programming where sequential sampling is terminated once the half-width of a normal approximation interval falls below a target threshold $\epsilon$:

$z_{1-\alpha/2} S_t / \sqrt{t} \leq \epsilon$

for $S_t$ the empirical standard deviation. Both AV and LHS variance-reduced schemes can result in earlier stopping (fewer iterations) by decreasing $S_t$, demonstrating their practical importance. Empirical findings in two-stage stochastic linear programs show that LHS often yields lower bias and narrower confidence intervals in non-sequential (fixed-sample) settings, while AV can be more effective in sequential (stopping rule-based) estimations (Park et al., 2020).

7. Summary Table of Sequential Variance Accumulation Approaches

Method/Context	Sequential Variance Update Formula	Key References
Stochastic Programming (IID, AV, LHS)	$$\operatorname{Var}_{t+1} = \frac{t}{t+1} \operatorname{Var}_t + \frac{1}{(t+1)^2}\sigma_s^2$$	(Park et al., 2020)
SMC/Particle Filters (asymptotic decomposition)	$\sigma^2(\varphi) = \sum_{p=0}^n v_{p,n}(\varphi)$	(Bon et al., 2 Oct 2025Du et al., 2019)
Kriging Sequential Updates	$$\sigma_{n+1}^2(x) = \sigma_n^2(x) - w_{n+1}(x)^2 \gamma$$	(Chevalier et al., 2012)
Empirical Bernstein Bound (Sequential)	$P(\hat V_T - \sigma^2 \ge R_{T,\delta}) \le \delta$	(Martinez-Taboada et al., 4 May 2025)

Sequential variance accumulation therefore constitutes both a theory of how uncertainty builds up and can be dynamically reduced in online statistical estimation and a set of actionable algorithms for variance reduction, statistical inference, and real-time calibration of sequential inference procedures across domains.