Pith. sign in

REVIEW 1 cited by

Neural Rough Differential Equations for Long Time Series

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.08295 v4 pith:2ZAKWQ25 submitted 2020-09-17 cs.LG cs.AImath.DSstat.ML

classification cs.LGcs.AImath.DSstat.ML
keywords neuraltimepathseriesdifferentialequationsroughapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neural controlled differential equations (CDEs) are the continuous-time analogue of recurrent neural networks, as Neural ODEs are to residual networks, and offer a memory-efficient continuous-time way to model functions of potentially irregular time series. Existing methods for computing the forward pass of a Neural CDE involve embedding the incoming time series into path space, often via interpolation, and using evaluations of this path to drive the hidden state. Here, we use rough path theory to extend this formulation. Instead of directly embedding into path space, we instead represent the input signal over small time intervals through its \textit{log-signature}, which are statistics describing how the signal drives a CDE. This is the approach for solving \textit{rough differential equations} (RDEs), and correspondingly we describe our main contribution as the introduction of Neural RDEs. This extension has a purpose: by generalising the Neural CDE approach to a broader class of driving signals, we demonstrate particular advantages for tackling long time series. In this regime, we demonstrate efficacy on problems of length up to 17k observations and observe significant training speed-ups, improvements in model performance, and reduced memory requirements compared to existing approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 26 citations worldwide. Full citation record

  1. How Fast Do Signatures Learn? Statistical Theory and Applications for Path Regression

    math.ST 2026-07 conditional novelty 6.0 of 10

    For smooth functionals of Itô diffusions, the level-K truncated signature achieves minimax-optimal squared L2 error of order K^{-2γ}, and this rate propagates through Signature-OLS, Signature-LASSO, and Signature-Logistic.

Pith tools