SearcharxivSearch

arXiv · 2603.03058

Universal approximation by signatures for infinite-dimensional rough paths

Abstract

We establish universal approximation theorems for infinite-dimensional geometric rough paths, i.e., we show that continuous functions on the space of infinite-dimensional weakly geometric H\"older continuous rough paths can be approximated by functions that are linear in the signature of the path. The underlying topology determining continuity and compactness can be either the norm topology or the weak$^*$ topology. Whereas considerably more effort is required to obtain the universal approximation theorem with respect to the weak$^*$ topology, this setting ensures uniform approximation on norm-bounded sets. The motivation for establishing universal approximation theorems lies in the desire to approximate quantities derived from the solution of a stochastic partial differential equation. More specifically, our universal approximation theorems form the foundations of a novel approach to e.g. pricing of forward rates within the Heath--Jarrow--Morton--Musiela framework.

Explore related subjects

Keep this discovery

BibTeXRIS

Sonja Cox, Asma Khedher, Thijs Maessen. 2026-03-03. Universal approximation by signatures for infinite-dimensional rough paths. https://arxiv.org/abs/2603.03058

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