Integral Updating of Posteriors

• Integral updating of posteriors is a Bayesian method that integrates over latent or auxiliary parameters to normalize or marginalize, ensuring coherent updates.
• It spans contexts like loss-based, sequential, and hierarchical Bayes by using an integral step to aggregate evidence or enforce normalization.
• Applications include recursive inference, variational approximations, and model-error correction, offering order-invariant and decision-theoretically sound updates.

Searching arXiv for the cited papers and closely related work to ground the article. Integral updating of posteriors denotes a family of Bayesian and Bayesian-adjacent update procedures in which the posterior is obtained only after an explicit integration step. Depending on context, that integral may normalize an exponentially tilted density, produce the predictive density in sequential Bayes, marginalize latent parameters or hyperparameters in hierarchical models, or aggregate experiment-specific information before a single update. Across these uses, the common structure is that posterior formation is not merely multiplicative; it requires an integral that either enforces normalization or averages over uncertainty carried by prior, latent, or auxiliary quantities [(McAlinn et al., 2 Feb 2026); (Lewis, 2013); (Scharf, 3 Aug 2025); (Jia et al., 2024)].

1. Conceptual scope

The expression has no single universal meaning. In generalized Bayes, it refers to the normalization integral that turns an exponential tilt of a baseline distribution into a probability measure. In recursive Bayes, it refers to the predictive normalizer

$$Z_t=\int p(\theta\mid y_{1:t-1})\,p(y_t\mid \theta)\,d\theta,$$

which updates the previous posterior into the next one. In hierarchical models, it denotes marginalization over latent parameters or hyperparameters. In objective Bayes with heterogeneous experiments, it can denote a revised update in which information measures are aggregated first and Bayes’ theorem is applied once with a joint noninformative prior [(McAlinn et al., 2 Feb 2026); (Scharf, 3 Aug 2025); (Jia et al., 2024); (Lewis, 2013)].

Usage	Representative form	Role of the integral
Loss-based/generalized Bayes	$$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$	Partition function $Z(x)$ normalizes the tilt
Sequential Bayes	$$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$	$Z_t$ is the predictive density
Hierarchical Bayes	$$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$	Marginalizes dataset-level parameters
Objective-prior aggregation	$$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$	Builds a joint noninformative prior from aggregated information

This breadth has interpretive consequences. In some settings the integral has evidential status analogous to marginal likelihood; in others it is only a normalization device or the value of a variational problem. A central theme of recent work is that identical algebraic forms can encode different objects: conditional beliefs, randomized decision rules, predictive updates, or latent-variable marginalizations (McAlinn et al., 2 Feb 2026).

2. Exponential tilting, generalized Bayes, and the status of the normalizing integral

A canonical loss-based update takes the form

$$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$

For cumulative data $x_{1:n}$, the loss becomes additive,

$L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$

and the same Gibbs form yields sequential coherence: tilting by $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$0 and then $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$1 produces the same distribution as tilting once by $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$2 (McAlinn et al., 2 Feb 2026).

The decision-theoretic characterization in "When Is Generalized Bayes Bayesian? A Decision-Theoretic Characterization of Loss-Based Updating" distinguishes belief posteriors from decision posteriors (McAlinn et al., 2 Feb 2026). Belief posteriors are conditional beliefs justified by Savage and Anscombe–Aumann foundations and arise from a prior $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$3 together with a likelihood $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$4. Decision posteriors are randomized decision rules $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$5, justified by preferences over decision rules rather than by conditional-belief coherence. In that regime, the baseline $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$6 is a regularization or default distribution over actions, and coherence is sequential or batching coherence of the update operator.

The main equivalence theorem is sharp. A generalized Bayes update coincides with ordinary Bayes if and only if the loss is, up to scale and a data-only term, negative log-likelihood: $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$7 with $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$8 independent of $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$9 (McAlinn et al., 2 Feb 2026). Setting $Z(x)$0 recovers ordinary Bayes exactly. A related diagnostic is

$Z(x)$1

If generalized Bayes equals a belief posterior for all $Z(x)$2, then $Z(x)$3 must be finite and independent of $Z(x)$4; conversely, if $Z(x)$5, then $Z(x)$6 defines a valid likelihood (McAlinn et al., 2 Feb 2026).

Outside the log-loss regime, the normalizing integral loses its canonical evidential interpretation. The same paper shows that for any data-only shift $Z(x)$7,

$Z(x)$8

Therefore the posterior mapping $Z(x)$9 does not determine $$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$0, and Bayes-factor-like ratios built from such $$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$1 are not well-defined evidence unless the loss recovers a genuine likelihood (McAlinn et al., 2 Feb 2026).

The same work also establishes why non-degenerate loss-based posteriors are not compatible with linear von Neumann–Morgenstern utility over $$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$2. Under vNM axioms, any optimizer is supported on $$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$3, so non-degenerate posteriors require nonlinear preferences over decision rules. Under weak order, loss monotonicity, sequential coherence, separability, and an $$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$4-divergence deviation cost, product additivity uniquely selects relative entropy up to scale, yielding the entropy-regularized variational problem

$$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$5

whose unique minimizer is exactly the exponential tilt. The dual value is

$$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$6

so the normalization integral is simultaneously a partition function and the value of an entropy-penalized risk minimization problem (McAlinn et al., 2 Feb 2026).

3. Sequential recursion, streaming data, and posterior reuse

In standard recursive Bayes with streaming or batched observations,

$$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$7

Here $$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$8 is the previous posterior’s predictive density for the new data. This is the classical integral update for static parameters in online inference (Scharf, 3 Aug 2025, Tomasetti et al., 2019).

"A strategy to avoid particle depletion in recursive Bayesian inference" studies this recursion in Monte Carlo form (Scharf, 3 Aug 2025). In prior-proposal recursive Bayes, proposals are drawn from the previous posterior, and under conditional independence the Metropolis–Hastings acceptance ratio simplifies to a pure likelihood ratio: $$p(\theta\mid y_{1:t})\propto p(\theta\mid y_{1:t-1})p(y_t\mid\theta)$$9 The predictive normalizer $Z_t$0 therefore need not be evaluated explicitly. The difficulty is particle depletion: empirical-resampling proposals reuse a discrete set of past particles, acceptance rates decline as the transient posterior contracts or shifts, duplicates accumulate, and the sample can collapse to a single value. The paper’s remedy, Smoothed Prior-Proposal Recursive Bayes, replaces discrete reuse by a continuous regularized mixture proposal indexed by $Z_t$1; $Z_t$2 recovers multinomial resampling, whereas $Z_t$3 gives a joint Gaussian proposal. In simulations, $Z_t$4 yielded accurate logistic-regression updates, and in a hierarchical species-distribution model with 100 parameters, the smoothed scheme recovered all-at-once posteriors with manageable memory (Scharf, 3 Aug 2025).

"Updating Variational Bayes: Fast sequential posterior inference" develops a deterministic approximation to the same sequential recursion by replacing the unavailable exact prior $Z_t$5 with the previous variational approximation $Z_t$6 (Tomasetti et al., 2019). The resulting pseudo-posterior is

$Z_t$7

and the new approximation $Z_t$8 is obtained by minimizing $Z_t$9. UVB-IS further accelerates the update by reusing samples from $$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$0 through importance weights $$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$1. In the reported simulations, UVB and UVB-IS preserved predictive accuracy while reducing computation; for one mixture-model experiment at $$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$2 and $$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$3, UVB and UVB-IS used $$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$4 and $$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$5 of the SVB computational time, respectively (Tomasetti et al., 2019).

A distinct but related setting is posterior adaptation under label shift. "Posterior Adaptation With New Priors" assumes $$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$6 is unchanged while class priors vary, and derives

$$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$7

The update is a posterior reweighting by prior ratios followed by renormalization; the unknown scale in the recovered likelihood cancels in the denominator. The method is valid under label shift and calibration of the original posteriors, but not under covariate shift (Davis, 2020).

Recursive updating also appears in a non-Bayesian but structurally analogous form in PAC-Bayes. "Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss" replaces evidence-based posterior updating with a recursive bound on randomized classifiers, decomposing posterior risk into an excess term plus a downscaled prior risk that is bounded recursively (Wu et al., 2024). The contribution is not a Bayesian posterior in the probabilistic sense, but it addresses the same operational question: how to turn each posterior-like distribution into the next prior without discarding information from earlier batches.

4. Aggregating information before updating: objective priors and moment constraints

A different meaning of integral updating arises when the prior itself must evolve with the information structure of the combined data. "Modification of Bayesian Updating where Continuous Parameters have Differing Relationships with New and Existing Data" considers independent experiments $$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$8 with continuous parameters but experiment-specific noninformative priors (Lewis, 2013). If Jeffreys’ prior for experiment $$p(\eta\mid D)\propto p(\eta)\prod_i \int p(\theta_i\mid\eta)p(D_i\mid\theta_i)\,d\theta_i$$9 is

$$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$0

then standard sequential updating is order-dependent whenever $$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$1 and $$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$2 differ in functional form: $$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$3 The proposed remedy is to aggregate expected Fisher information first,

$$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$4

form the joint noninformative prior

$$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$5

and apply Bayes’ theorem once: $$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$6 Because information addition and likelihood multiplication are commutative, the posterior is order-invariant (Lewis, 2013).

The paper reports two numerical demonstrations. In a normal-plus-cubic-normal example, with 20,000 simulations and one-sided $$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$7 and $$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$8 bounds, the uniform-prior path had empirical tail frequencies $$p(\theta\mid D_{1:J})\propto \sqrt{\det I_{\text{total}}(\theta)}\prod_j L_j(D_j\mid\theta)$$9 and $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$0, the $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$1-prior path had $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$2 and $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$3, and the joint prior from integral updating had $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$4 and $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$5, materially improving probability matching (Lewis, 2013). In a binomial/negative-binomial example with $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$6, $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$7, and $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$8, the paper again reports improved coverage for the joint prior over either ordering of standard updating (Lewis, 2013). The same framework extends to other Fisher-information-based priors of the form $$\pi(\theta\mid x)=\frac{\pi(\theta)\exp\{-\eta L(\theta;x)\}}{Z(x)},\qquad Z(x)=\int_\Theta \pi(\theta)\exp\{-\eta L(\theta;x)\}\,d\theta.$$9.

Another integral extension of posterior updating appears in maximum relative entropy. "Updating Probabilities with Data and Moments" maximizes relative entropy over the joint $x_{1:n}$0 subject to normalization, a data constraint $x_{1:n}$1, and posterior-level moment constraints $x_{1:n}$2 (0708.1593). The resulting canonical posterior is

$x_{1:n}$3

with multipliers determined by

$x_{1:n}$4

When all $x_{1:n}$5, the update reduces to Bayes’ rule. The moment information therefore acts as an exponential tilt of the Bayes posterior, much as in generalized Bayes, but the tilt is calibrated by explicit posterior constraints rather than by a user-chosen loss (0708.1593).

The same paper emphasizes that constraints need not commute. Distinct data constraints commute, but moment constraints and data constraints need not. Sequential updating is appropriate when later information supersedes earlier information; simultaneous updating is appropriate when all constraints are intended to hold in the final posterior. The difference is substantive rather than merely algorithmic, because the two update orders encode different informational states (0708.1593).

5. Marginalization over latent parameters, model error, and dynamical structure

In hierarchical Bayesian models, integral updating is often literal marginalization. "Hierarchical Bayesian Modeling for Uncertainty Quantification and Reliability Updating using Data" specifies

$x_{1:n}$6

with hyperparameters $x_{1:n}$7 governing between-dataset variability (Jia et al., 2024). The hyperposterior is

$x_{1:n}$8

Reliability is then updated by integrating failure probability over both parameter variability and posterior hyperparameter uncertainty: $x_{1:n}$9 For linear Gaussian models this can be done analytically through Gaussian convolution; for dynamical structural models the paper uses a two-stage TMCMC procedure for $L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$0 and subset simulation for rare-event estimation (Jia et al., 2024). The contrast with conventional Bayesian modeling is interpretive: the hierarchical formulation keeps between-dataset variability explicit, whereas a pooled posterior $L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$1 can understate uncertainty and yield overly optimistic reliability estimates.

"Iterative Updating of Model Error for Bayesian Inversion" gives a different latent-integral construction (Calvetti et al., 2017). Let $L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$2 be the accurate forward model, $L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$3 a reduced model, and $L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$4 the modeling-error map. The algorithm estimates the distribution of $L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$5 under the current posterior $L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$6 and updates by

$L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$7

Each update integrates the likelihood over an iteratively refined modeling-error distribution. In the linear Gaussian case, the paper proves geometric convergence of the resulting posterior means and covariances; for general models, it introduces particle approximations and shows convergence of each iterand in the large-particle limit (Calvetti et al., 2017).

A related marginalization principle appears in fully Bayesian ensemble filtering. "A generalised and fully Bayesian framework for ensemble updating" writes, at one assimilation time,

$L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$8

and constructs per-member updates by simulating $L_n(\theta)=\sum_{i=1}^n \ell(\theta;x_i),$9 from $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$00, excluding the ensemble member being updated (Loe et al., 2021). The update distribution $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$01 is constrained so that marginalizing over the prior state and the sampled parameter reproduces the assumed posterior. In the linear-Gaussian case this yields a square-root-filter-type update that is optimal under an expected Mahalanobis criterion; in a finite-state hidden Markov model, the paper enforces posterior pairwise marginals through a dynamic-programming construction (Loe et al., 2021). The exclusion of the target ensemble member from the parameter draw is presented as essential to avoid double use of information and to improve uncertainty representation.

For continuous-time latent Markov processes, integral updating can be lifted to path space. "A path integral approach to Bayesian inference in Markov processes" expresses the posterior over trajectories as

$$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$02

where $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$03 acts as a potential (Fujii et al., 2017). The unnormalized posterior density $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$04 then satisfies an imaginary-time Schrödinger, or Feynman–Kac, equation

$$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$05

In linear-Gaussian settings this recovers classical filtering equations; more generally it recasts Bayesian updating in dynamical systems as evolution under a prior generator plus a likelihood-induced sink term (Fujii et al., 2017).

6. Computational formulations, interpretation, and recurrent misconceptions

One computational line treats the integral update itself as an object for acceleration. "Fast Bayesian Updates via Harmonic Representations" expands prior and likelihood in an orthogonal basis and shows that the product update becomes convolution in coefficient space (Zhang, 10 Nov 2025). On a periodic domain,

$$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$06

and the evidence is the zero-frequency coefficient: $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$07 After truncation, the update becomes a circular convolution implementable with FFTs, giving $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$08 complexity instead of the $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$09 cost of naive convolution (Zhang, 10 Nov 2025). The method is deterministic and naturally sequential, but its efficiency depends on smoothness and spectral decay; nonsmooth targets, heavy tails, and high-dimensional parameter spaces weaken the spectral advantage.

A recurrent misconception is to treat every normalizing integral as evidence in the strong Bayesian sense. The generalized-Bayes analysis rejects that equivalence except in the log-loss case: outside a genuine likelihood model, the partition function is not canonical evidence, and Bayes factors are not identified without additional structure (McAlinn et al., 2 Feb 2026). A second misconception is that sequential Bayes is automatically order-invariant even with noninformative priors. That is true with a fixed proper prior, but not when the prior itself depends on the experiment, as in Jeffreys-type objective Bayes; in that setting, order invariance may require aggregation of Fisher information before a single update (Lewis, 2013).

Other limitations are model-specific. Posterior adaptation under changing class priors assumes label shift and calibrated old posteriors; it does not address covariate shift (Davis, 2020). Recursive Monte Carlo schemes can exchange explicit evaluation of $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$10 for proposal-quality problems such as particle depletion or low effective sample size (Scharf, 3 Aug 2025). Sequential variational methods avoid revisiting all past data, but they accumulate approximation error when $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$11 departs materially from the exact $$\pi(\theta\mid x)\propto \pi(\theta)e^{-\eta L(\theta;x)}$$12 (Tomasetti et al., 2019). Hierarchical reliability updating requires identifiable hyperparameters, adequate forward models, and numerically stable rare-event integration (Jia et al., 2024). Iterative model-error correction depends on the accuracy of the induced error distribution and on an independence approximation between state and model discrepancy that is exact only in special cases (Calvetti et al., 2017).

Taken together, these literatures show that integral updating of posteriors is not a single algorithm but a structural pattern. The integral may normalize, marginalize, aggregate information, or define a variational dual quantity. Its meaning depends on the epistemic role of the updated distribution. When the update is generated by a true likelihood, the integral has the status of predictive or marginal likelihood. When the update is loss-based, constraint-based, or auxiliary-variable-based, the same algebra can instead encode a coherent decision rule, an entropy projection, an order-invariant objective update, or a latent-variable marginalization [(McAlinn et al., 2 Feb 2026); (0708.1593); (Lewis, 2013)].