Random Controlled Differential Equations
Not on the map. Why?
Abstract (arXiv)
We introduce a training-efficient framework for time-series learning that combines random features with controlled differential equations (CDEs). In this approach, large randomly parameterized CDEs act as continuous-time reservoirs, mapping input paths to rich representations. Only a linear readout layer is trained, resulting in fast, scalable models with strong inductive bias. Building on this foundation, we propose two variants: (i) Random Fourier CDEs (RF-CDEs): these lift the input signal using random Fourier features prior to the dynamics, providing a kernel-free approximation of RBF-enhanced sequence models; (ii) Random Rough DEs (R-RDEs): these operate directly on rough-path inputs via a log-ODE discretization, using log-signatures to capture higher-order temporal interactions while remaining stable and efficient. We prove that in the infinite-width limit, these model induces the RBF-lifted signature kernel and the rough signature kernel, respectively, offering a unified perspective on random-feature reservoirs, continuous-time deep architectures, and path-signature theory. We evaluate both models across a range of time-series benchmarks, demonstrating competitive or state-of-the-art performance. These methods provide a practical alternative to explicit signature computations, retaining their inductive bias while benefiting from the efficiency of random features.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 39 references that are in the map. First posted on arXiv 29 Dec 2025.
Builds on
20 of 39 references.
References · 20
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2020Neural Controlled Differential Equations for Irregular Time Seriescited by 501
- 2018The UCR Time Series Archivecited by 421
- 2020Neural Rough Differential Equations for Long Time Seriescited by 140
- 2016A Primer on the Signature Method in Machine Learningcited by 100
- 2016Kernels for sequentially ordered datacited by 83
- 2020The Signature Kernel is the solution of a Goursat PDEcited by 58
- 2020Distribution Regression for Sequential Datacited by 31
- 2021Attentive Neural Controlled Differential Equations for Time-series Classification and Forecastingcited by 28
- 2021Higher Order Kernel Mean Embeddings to Capture Filtrations of Stochastic Processescited by 27
- 2023Neural signature kernels as infinite-width-depth-limits of controlled ResNetscited by 25
8 more
- 2020Discrete-time signatures and randomness in reservoir computingcited by 23
- 2021SigGPDE: Scaling Sparse Gaussian Processes on Sequential Datacited by 22
- 2021SK-Tree: a systematic malware detection algorithm on streaming trees via the signature kernelcited by 16
- 2024Lecture notes on rough paths and applications to machine learningcited by 13
- 2023Random Fourier Signature Featurescited by 9
- 2024Universal randomised signatures for generative time series modellingcited by 4
- 2022On the effectiveness of Randomized Signatures as Reservoir for Learning Rough Dynamicscited by 3
- 2025Numerical Schemes for Signature Kernelscited by 3
Built on by
Not cited yet.