Signature Methods in Stochastic Portfolio Theory
Not on the map. Why?
Abstract (arXiv)
In the context of stochastic portfolio theory we introduce a novel class of portfolios which we call linear path-functional portfolios. These are portfolios which are determined by certain transformations of linear functions of a collections of feature maps that are non-anticipative path functionals of an underlying semimartingale. As main example for such feature maps we consider the signature of the (ranked) market weights. We prove that these portfolios are universal in the sense that every continuous, possibly path-dependent, portfolio function of the market weights can be uniformly approximated by signature portfolios. We also show that signature portfolios can approximate the growth-optimal portfolio in several classes of non-Markovian market models arbitrarily well and illustrate numerically that the trained signature portfolios are remarkably close to the theoretical growth-optimal portfolios. Besides these universality features, the main numerical advantage lies in the fact that several optimization tasks like maximizing (expected) logarithmic wealth or mean-variance optimization within the class of linear path-functional portfolios reduce to a convex quadratic optimization problem, thus making it computationally highly tractable. We apply our method also to real market data based on several indices. Our results point towards out-performance on the considered out-of-sample data, also in the presence of transaction costs.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Oct 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 4; 2026: 4.
11 papers.
- 2025pySigLib -- Fast Signature-Based Computations on CPU and GPUcited by 6
- 2023Randomized Signature Methods in Optimal Portfolio Selectioncited by 4
- 2024Universal randomised signatures for generative time series modellingcited by 4
- 2026Universal approximation with signatures of non-geometric rough pathscited by 4
- 2025Global universal approximation with Brownian signaturescited by 2
- 2026Deep Hilbert--Galerkin Methods for Infinite-Dimensional PDEs and Optimal Controlcited by 2
- 2024Infinite-dimensional Mahalanobis Distance with Applications to Kernelized Novelty Detectioncited by 1
- 2025Kernel Learning for Mean-Variance Trading Strategiescited by 1
- 2026Generating Financial Time Series by Matching Random Convolutional Featurescited by 1
- 2025Novelty detection on path spacecited by 0
- 2026Global universality via discrete-time signaturescited by 0
- 2026Generating Financial Time Series by Matching Random Convolutional Features3 Jun 2026
- 2026Deep Hilbert--Galerkin Methods for Infinite-Dimensional PDEs and Optimal Control19 Mar 2026
- 2026Global universality via discrete-time signatures10 Mar 2026
- 2026Universal approximation with signatures of non-geometric rough paths5 Feb 2026
- 2025Global universal approximation with Brownian signatures18 Dec 2025
- 2025Novelty detection on path space2 Dec 2025
- 2025pySigLib -- Fast Signature-Based Computations on CPU and GPU12 Sep 2025
- 2025Kernel Learning for Mean-Variance Trading Strategies14 Jul 2025
- 2024Infinite-dimensional Mahalanobis Distance with Applications to Kernelized Novelty Detection16 Jul 2024
- 2024Universal randomised signatures for generative time series modelling14 Jun 2024
- 2023Randomized Signature Methods in Optimal Portfolio Selection27 Dec 2023