Pith. sign in

REVIEW 1 cited by

Rough Transformers for Continuous and Efficient Time-Series Modelling

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 2403.10288 v1 pith:52G4F4BG submitted 2024-03-15 stat.ML cs.AIcs.LG

classification stat.MLcs.AIcs.LG
keywords dependenciesattentioncomputationaldatainputlong-rangemodelsrough
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Time-series data in real-world medical settings typically exhibit long-range dependencies and are observed at non-uniform intervals. In such contexts, traditional sequence-based recurrent models struggle. To overcome this, researchers replace recurrent architectures with Neural ODE-based models to model irregularly sampled data and use Transformer-based architectures to account for long-range dependencies. Despite the success of these two approaches, both incur very high computational costs for input sequences of moderate lengths and greater. To mitigate this, we introduce the Rough Transformer, a variation of the Transformer model which operates on continuous-time representations of input sequences and incurs significantly reduced computational costs, critical for addressing long-range dependencies common in medical contexts. In particular, we propose multi-view signature attention, which uses path signatures to augment vanilla attention and to capture both local and global dependencies in input data, while remaining robust to changes in the sequence length and sampling frequency. We find that Rough Transformers consistently outperform their vanilla attention counterparts while obtaining the benefits of Neural ODE-based models using a fraction of the computational time and memory resources on synthetic and real-world time-series tasks.

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. Full citation record

  1. SigGate: Enhancing Recurrent Neural Networks with Signature-Based Gating Mechanisms

    cs.LG 2025-02 reject novelty 4.0 of 10

    A signature-based forget/reset gate that ignores the hidden state yields small and task-dependent R2 changes on two crypto forecasting tasks, not the consistent improvement claimed.

Pith tools