Bryson–Frazier Smoother

• Bryson–Frazier smoother is a two-filter algorithm that recasts the backward pass in the information domain, enhancing state estimation in linear and nonlinear models.
• It leverages a backward information filter and Riccati-like equations to compute smoothing errors without expensive covariance inversions.
• Recent advances extend its application to nonlinear, regime-switching, and factor-graph models, improving performance in sensor fusion, tracking, and navigation.

The Bryson–Frazier smoother is a two-filter smoothing algorithm for estimating the hidden state in linear (and certain nonlinear) state-space models, formulated in either discrete or continuous time. Unlike the Rauch–Tung–Striebel (RTS) smoother, which combines forward-filtering and backward-recursions using covariance-based updates, the Bryson–Frazier approach recasts the backward pass in the information domain, yielding computational, numerical, and structural advantages. Recent advances have provided rigorous derivations of the continuous-time Bryson–Frazier smoother, pathwise representations, and extensions to conditionally linear, regime-switching, and nonlinear models (Kurisaki, 5 Jan 2026, Nguyen et al., 2017, Petersen et al., 2019).

1. Foundational Framework for the Continuous-Time Bryson–Frazier Smoother

The filtering and smoothing problem is considered in the context of a continuous-time linear Gaussian model: $$\begin{aligned} dX_t &= a(t) X_t\,dt + b(t)\,dV_t, \quad X_0 \sim \mathcal N(m_0, P_0), \ dY_t &= c(t) X_t\,dt + \sigma(t)\,dW_t, \quad Y_0 = 0, \end{aligned}$$ where $X_t$ is the $d_1$-dimensional unobserved process, $Y_t$ is the $d_2$-dimensional observation, $V_t$ and $W_t$ are independent standard Brownian motions, and the time-varying system matrices $a(t), b(t), c(t), \sigma(t)$ are measurable and bounded, with $\sigma(t)\sigma(t)^\top \succ 0$ for all $t$ (Kurisaki, 5 Jan 2026).

The forward Kalman–Bucy filter computes the conditional mean and covariance of $X_t$0 given $X_t$1, while the smoothing distribution $X_t$2 seeks to condition on all observations up to terminal time $X_t$3 for each $X_t$4.

2. Pathwise Representation and Smoothing Error Dynamics

A key insight is the pathwise representation of the smoothing error: for fixed $X_t$5, define a backward Riccati-like matrix $X_t$6 as the unique negative-semidefinite solution of

$X_t$7

An auxiliary process $X_t$8 is defined on $X_t$9 by

$d_1$0

where $d_1$1 is independent Brownian motion, and the initial covariance $d_1$2 is specified so that $d_1$3 matches the smoothing error covariance.

The main theorem states that $d_1$4 has the same law as $d_1$5, i.e., the smoothing error is Ornstein–Uhlenbeck–type. The full smoothing mean and covariance are given by

$d_1$6

$d_1$7

(Kurisaki, 5 Jan 2026).

3. Bryson–Frazier Backward Recursion

The pathwise mean formula is exact but not a recursive equation. The Bryson–Frazier smoother introduces a backward “information” process $d_1$8: $d_1$9 where $Y_t$0 solves

$Y_t$1

The smoothed mean then solves the backward ODE–SDE: $Y_t$2 The backward Riccati $Y_t$3, mean $Y_t$4, and $Y_t$5 are integrated backward in $Y_t$6 from $Y_t$7 to $Y_t$8 (Kurisaki, 5 Jan 2026).

This yields the Bryson–Frazier cooler for the continuous-time linear model, which contains as particular cases the Kalman–Bucy (filtering) and RTS (smoothing) equations.

4. Two-Filter Smoothers and Information Formulation

In discrete time, the Bryson–Frazier smoother is best characterized as a two-filter approach. One runs:

• A forward Kalman filter producing $Y_t$9,
• A backward information filter with information parameters $d_2$0:

$d_2$1

The smoothed distribution is computed by combining the forward Gaussian parameters with the backward information parameters using closed-form expressions (Nguyen et al., 2017).

This structure naturally generalizes to hybrid models with conditionally linear–Gaussian structure, as well as to Rao–Blackwellized SMC smoothers using the two-filter Bryson–Frazier formalism.

5. Extensions to Nonlinear, Regime-Switching, and Factor-Graph Settings

For nonlinear state-space models, the Bryson–Frazier methodology underpins the modified Bryson–Frazier (MBF) smoother, which extends to the setting of approximate Gaussian message passing on Forney-style factor graphs. The MBF smoother computes forward and backward Gaussian messages through deterministic nonlinear nodes using numerical quadrature (e.g., Unscented Transform, cubature, Gauss–Hermite) for the forward pass and a Rauch–Tung–Striebel-type backward pass: $d_2$2 Only one matrix inversion is required per step in the backward pass, yielding computational efficiency and numerical robustness (Petersen et al., 2019).

The Bryson–Frazier and MBF smoothers are suitable for large-scale sensor fusion, SLAM, navigation, and tracking contexts where regime switching, conditional linearity, or model nonlinearity are encountered.

6. Pathwise Sampling and Monte Carlo Evaluation

The pathwise representation enables exact sampling from the smoothing distribution. The recipe is:

1. Solve the forward Riccati and filter mean;
2. Integrate the backward Riccati $d_2$3 to obtain the necessary backward information;
3. Simulate an auxiliary Brownian motion and initial Gaussian variable for the Ornstein–Uhlenbeck-type error process $d_2$4;
4. Evolve $d_2$5 via its SDE;
5. Form smoothed sample paths $d_2$6.

Each trajectory is distributed exactly according to the smoothing law, enabling estimation of path-dependent functionals, Monte Carlo EM Q-functions, and construction of confidence bands (Kurisaki, 5 Jan 2026).

7. Computational Properties and Implementation Considerations

The Bryson–Frazier smoother avoids explicit inversion of state covariances and requires the integration of a small set of ordinary and stochastic differential equations (three matrix-valued ODEs and one linear SDE in continuous time). Standard solvers are applicable. The only invertibility assumption pertains to the observation noise covariance $d_2$7, which ensures equivalence of measures and positiveness of $d_2$8 (Kurisaki, 5 Jan 2026).

In discrete-time regime-switching models, computational complexity is $d_2$9 per time step for Rao–Blackwellized SMC smoothers with $V_t$0 particles and $V_t$1 regimes. The use of particle rejuvenation in the backward pass, in tandem with the Bryson–Frazier formalism, improves variance and accuracy in smoothing with complex regime-switching models (Nguyen et al., 2017).

---

References:

• (Kurisaki, 5 Jan 2026) "Pathwise Representation of the Smoothing Distribution in Continuous-Time Linear Gaussian Models"
• (Nguyen et al., 2017) "Particle rejuvenation of Rao-Blackwellized Sequential Monte Carlo smoothers for Conditionally Linear and Gaussian models"
• (Petersen et al., 2019) "On Approximate Nonlinear Gaussian Message Passing On Factor Graphs"