Pathwise Representation of the Smoothing Distribution in Continuous-Time Linear Gaussian Models
Masahiro Kurisaki
TL;DR
This work provides a pathwise, probabilistically rigorous representation of the smoothing distribution in continuous-time linear Gaussian models by showing the smoothing error evolves as an Ornstein–Uhlenbeck process. The authors derive a general Gaussian conditional law for the hidden state with mean and covariance given by explicit kernel- and Riccati-based equations, from which the Kalman–Bucy filter, RTS smoother, and the Bryson–Frazier smoother follow as corollaries. A key advance is the explicit, pathwise description that enables direct sampling from the smoothing distribution, enhancing Monte Carlo evaluation of nonlinear path functionals and enabling refined estimation procedures. The framework also supports practical applications such as Monte Carlo EM, EKF-based linearizations, and simultaneous confidence bands for the hidden trajectory, strengthening both theoretical understanding and computational capabilities in continuous-time smoothing.
Abstract
We study the filtering and smoothing problem for continuous-time linear Gaussian systems. While classical approaches such as the Kalman-Bucy filter and the Rauch-Tung-Striebel (RTS) smoother provide recursive formulas for the conditional mean and covariance, we present a pathwise perspective that characterizes the smoothing error dynamics as an Ornstein-Uhlenbeck process. As an application, we show that standard filtering and smoothing equations can be uniformly derived as corollaries of our main theorem. In particular, we provide the first mathematically rigorous derivation of the Bryson-Frazier smoother in the continuous-time setting. Beyond offering a more transparent understanding of the smoothing distribution, our formulation enables pathwise sampling from it, which facilitates Monte Carlo methods for evaluating nonlinear functionals.
