Universal randomised signatures for generative time series modelling

Francesca Biagini, Lukas Gonon, Niklas Walter
6/14/2024
cs.LGq-fin.MFstat.ML

No official code found. Best implementation: niklaswalter/Randomised-Signature-TimeSeries-Generation (3 stars, last commit 2026-02-14).

Abstract

Randomised signature has been proposed as a flexible and easily implementable alternative to the well-established path signature. In this article, we employ randomised signature to introduce a generative model for financial time series data in the spirit of reservoir computing. Specifically, we propose a novel Wasserstein-type distance based on discrete-time randomised signatures. This metric on the space of probability measures captures the distance between (conditional) distributions. Its use is justified by our novel universal approximation results for randomised signatures on the space of continuous functions taking the underlying path as an input. We then use our metric as the loss function in a non-adversarial generator model for synthetic time series data based on a reservoir neural stochastic differential equation. We compare the results of our model to benchmarks from the existing literature.

View on arXivView PDF

Code Implementations(1)

32PythonJun 11, 20248 months ago

Similar Papers

Cite this paper

@article{biagini2024universal,
  title  = {Universal randomised signatures for generative time series modelling},
  author = {Francesca Biagini and Lukas Gonon and Niklas Walter},
  year   = {2024},
  eprint = {2406.10214},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.10214v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.10214.svg)](https://codeofpaper.com/paper/2406.10214)

Discussion