Generating Financial Time Series by Matching Random Convolutional Features
Not on the map. Why?
Abstract (arXiv)
Generating realistic financial time series is challenging as training data is often limited to a single historical path. With such scarce data, overfitting is hard to avoid, especially under adversarial training where a trained discriminator can memorize the training samples. To mitigate this, recent approaches train generators to minimize the discrepancy between untrained feature representations of real and generated time series. In these works, the feature maps are based on path signatures, which can fail to capture relevant time series properties at tractable truncation depths. In this work, we instead train generators by matching random convolutional features of real and generated time series. Existing random convolutional feature maps, such as Rocket and Hydra, have been shown to provide informative representations of real-world time series, but cannot supervise generative models because they are non-differentiable. We introduce SOCK (SOft Competing Kernels), a fully differentiable random convolutional feature map, suited to train generative time series models. We show that generators trained by matching random SOCK features consistently outperform signature and diffusion baselines across a wide range of small-sample financial datasets. We further demonstrate SOCK's expressiveness on two-sample hypothesis testing and time series classification tasks, where SOCK matches or outperforms existing unsupervised feature maps.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 49 of its 76 references that are in the map. First posted on arXiv 3 Jun 2026.
Builds on
49 of 76 references.
References · 49
- 2016Improved Techniques for Training GANscited by 2,970
- 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,367
- 2017Deep Setscited by 1,421
- 2020Training Generative Adversarial Networks with Limited Datacited by 1,186
- 2021Dataset Condensation with Distribution Matchingcited by 365
- 2019ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernelscited by 339
- 2017Real-valued (Medical) Time Series Generation with Recurrent Conditional GANscited by 333
- 2015Generative Moment Matching Networkscited by 257
- 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 254
- 2020MINIROCKET: A Very Fast (Almost) Deterministic Transform for Time Series Classificationcited by 190
- 2024Diffusion-TS: Interpretable Diffusion for General Time Series Generationcited by 184
- 2015Training generative neural networks via Maximum Mean Discrepancy optimizationcited by 151
37 more
- 2015Should we really use post-hoc tests based on mean-ranks?cited by 116
- 2018Deep Hedgingcited by 108
- 2023Bake off redux: a review and experimental evaluation of recent time series classification algorithmscited by 101
- 2016Generative Models and Model Criticism via Optimized Maximum Mean Discrepancycited by 100
- 2021MultiRocket: Multiple pooling operators and transformations for fast and effective time series classificationcited by 90
- 2016Kernels for sequentially ordered datacited by 84
- 2024Theoretical Foundations of Deep Selective State-Space Modelscited by 74
- 2021Sig-Wasserstein GANs for Time Series Generationcited by 60
- 2018Signature moments to characterize laws of stochastic processescited by 56
- 2022HYDRA: Competing convolutional kernels for fast and accurate time series classificationcited by 54
- 2020Signatory: differentiable computations of the signature and logsignature transforms, on both CPU and GPUcited by 46
- 2023Non-adversarial training of Neural SDEs with signature kernel scorescited by 37
- 2020A Data-driven Market Simulator for Small Data Environmentscited by 35
- 2022Signature Methods in Machine Learningcited by 34
- 2021Higher Order Kernel Mean Embeddings to Capture Filtrations of Stochastic Processescited by 27
- 2019Deep Hedging: Learning to Simulate Equity Option Marketscited by 25
- 2023Neural signature kernels as infinite-width-depth-limits of controlled ResNetscited by 25
- 2020Conditional Sig-Wasserstein GANs for Time Series Generationcited by 23
- 2019Generative Adversarial Networks for Financial Trading Strategies Fine-Tuning and Combinationcited by 22
- 2017McGan: Mean and Covariance Feature Matching GANcited by 21
- 2021Multi-Asset Spot and Option Market Simulationcited by 17
- 2023PCF-GAN: generating sequential data via the characteristic function of measures on the path spacecited by 15
- 2022Deep Hedging: Continuous Reinforcement Learning for Hedging of General Portfolios across Multiple Risk Aversionscited by 13
- 2023Signature Methods in Stochastic Portfolio Theorycited by 11
- 2022Applications of Signature Methods to Market Anomaly Detectioncited by 9
- 2022Path Development Network with Finite-dimensional Lie Group Representationcited by 8
- 2024Fast Deep Hedging with Second-Order Optimizationcited by 6
- 2023G-Signatures: Global Graph Propagation With Randomized Signaturescited by 4
- 2023Randomized Signature Methods in Optimal Portfolio Selectioncited by 4
- 2024Universal randomised signatures for generative time series modellingcited by 4
- 2020Signature features with the visibility transformationcited by 3
- 2022On the effectiveness of Randomized Signatures as Reservoir for Learning Rough Dynamicscited by 3
- 2024High Rank Path Development: an approach of learning the filtration of stochastic processescited by 3
- 2022Risk-Neutral Market Simulationcited by 2
- 2025Distributional Adversarial Attacks and Training in Deep Hedgingcited by 2
- 2017Non-Gaussian Autoregressive Processes with Tukey g-and-h Transformationscited by 1
- 2024Infinite-dimensional Mahalanobis Distance with Applications to Kernelized Novelty Detectioncited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Robust Control under Stationary Ambiguitycited by 0
- 2026Robust Control under Stationary Ambiguity5 Aug 2026