SearcharxivSearch

arXiv · 2509.11825

Rough stochastic filtering

Abstract

This article is concerned with the well-posedness of the "filtering equations", due to Zakai and Kushner-Stratonovich, arising in nonlinear stochastic filtering. In general situations, notably in correlated diffusion models and when signal coefficients depend on the observation process, the well-posedness is a difficult problem, mainly due to conflicting martingale structures of the involved forward and backward equations. Crisan-Pardoux (2024) address this classical problem with BSPDE techniques, Du et al. (2013), a Sobolev-based approach that however requires increasingly strong regularity assumptions in high dimensions. In this work, we take a new mixed rough stochastic perspective which allows us to derive well-posed rough counterparts of the filtering equations. Importantly, the rough filtering equations are seen, upon randomization, to coincide with the classical filtering equations. Our framework yields well-posedness (existence, uniqueness, stability) under dimension-independent regularity assumptions, providing a robust and conceptually unified solution to a longstanding problem in stochastic filtering theory. To illustrate the flexibility of the method, we also treat rough versions of the classical Kalman-Bucy filter, with characteristics described by a new class of RDEs of rough Riccati type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fabio Bugini, Peter K. Friz, Khoa Lê, Huilin Zhang. 2025-09-15. Rough stochastic filtering. https://arxiv.org/abs/2509.11825

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR