Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

336598130 · Jun 202019922001200920172026
48 results for memory signatures

Introduces Exponentially Weighted Signature for better path representation.

problem Uniform treatment of historical information in signatures.
method Generalizes EFM signature to bounded linear operators, enabling contextualised temporal weighting.
result EWS is the unique solution to a linear controlled differential equation and generalizes state-space models.

Path signatures improve hedging of exotic derivatives in non-Markovian models.

problem Hedging exotic derivatives under non-Markovian stochastic volatility models.
method Investigates path signatures in deep and shallow learning contexts, comparing neural networks and regression approaches.
result Path signatures outperform LSTM in most cases and yield more accurate results in hedging.

New algorithms compute Volterra signature efficiently for time series analysis.

problem Efficient computation of Volterra signature with matrix-valued kernels.
method Decomposed Chen-type convolution relation, introduced FFT-based and exact recursion algorithms.
result Efficient algorithms for Volterra signature computation with various complexities.

Volterra signature provides a clear, interpretable feature for history-dependent systems.

problem Learning from non-Markovian time series with implicit memory mechanisms.
method Develops Volterra signature as a tensor algebra representation weighted by a temporal kernel, proving injectivity and universal approximation.
result Volterra signature leads to linear functionals and universal approximation, improving dynamic learning tasks.

Bayesian time series forecasting improves by dynamically adapting to recent information.

problem Lack of forgetting mechanism in signature kernel for time series forecasting.
method Introducing a novel forgetting mechanism for signature features using Random Fourier Decayed Signature Features (RFDSF) with Gaussian processes (GPs).
result Demonstrates superior performance compared to other GP-based alternatives and state-of-the-art probabilistic time series forecasting algorithms.

Rough Transformers improve time series modeling with lower costs and better performance.

problem Inefficient modeling of irregularly sampled time series data.
method Signature patching for continuous-time representations, reducing computational costs.
result Rough Transformers outperform vanilla Transformers and Neural ODE models.

Gravitational wave memory increases faster than Brownian motion in early universe and astrophysical sources.

problem Detecting gravitational wave memory from early universe and astrophysical sources.
method Investigated gravitational wave sources in early universe and astrophysical settings, showing memory increases faster than Brownian motion.
result Gravitational wave memory increases following a power law, faster than the t\sqrt{t} scaling law of Brownian motion.

Paper introduces non-adversarial training for Neural SDEs using signature kernel scores.

problem Stability and mode collapse issues in adversarial training of Neural SDEs.
method Uses signature kernel scores as objective function for non-adversarial training.
result Non-adversarial training leads to better performance and more stable models.

The paper revisits expected signatures in semimartingale models, providing new formulae and simplifying complexity.

problem Computing expected signatures in semimartingale models.
method Revisits and provides new formulae for computing expected signatures in a general semimartingale setting.
result Log-transform of expected signatures simplifies complexity, leading to signature cumulants.

New explanation of reservoir computing using random projections.

problem Understanding the randomness in reservoir computing.
method Constructing strongly universal reservoir systems as random projections of state-space systems.
result Approximation of any fading memory filters class by training a linear readout for each filter.

A well-known property of the signature of closed oriented 4n-dimensional manifolds is Novikov additivity, which states that if a manifold is split into two manifolds with boundary along an oriented smooth hypersurface, then the signature of the original manifold equals the sum of the signatures of the resulting manifol…

2009-11-19abs ↗pdf ↗

New findings on mesh group-planes validate Signature-inverse Theorem under specific conditions.

problem Invalidity of existing inverse theorems for mesh group-planes.
method Classification of three and five point meshes, analysis of joint invariant signatures.
result Valid conditions for the Signature-inverse Theorem in mesh group-planes.

Introduces flat discrete signatures for financial data analysis.

problem Representing financial data for machine learning without continuous transformation.
method Introduced flat discrete signatures and discrete signatures, generalizing flat discrete signatures.
result Flat discrete signatures can represent quadratic variation relevant in finance.

This is a sequel to the paper "The signature package on Witt spaces, I. Index classes" by the same authors. In the first part we investigated, via a parametrix construction, the regularity properties of the signature operator on a stratified Witt pseudomanifold, proving, in particular, that one can define a K-homology …

2009-11-04abs ↗pdf ↗

The paper examines the consistency of Lasso regression applied to signature analysis of time series data.

problem Consistency of Lasso regression in signature analysis of time series data.
method The paper studies the consistency of Lasso regression applied to signature analysis of time series data, both theoretically and numerically.
result The Lasso regression is consistent both asymptotically and in finite sample for certain types of time series and processes.

Study signatures of torus links and their cores using Neumann's equivariant signatures and Hirzebruch's formula.

problem Computing signatures of torus links and their cores.
method Use Neumann's equivariant signatures and rewrite Hirzebruch's formula for torus links (without cores) in terms of integral points in a parallelogram.
result Rewritten Hirzebruch's formula for torus links with cores using integral points in a parallelogram.

This paper extends the C*-signature to non-Witt spaces using noncommutative geometric methods.

problem Extending the signature to non-Witt spaces with noncommutative geometric methods.
method Noncommutative geometric methods, combinatorial framework, and comparison with analytical signature.
result Constructing the C*-signature on non-Witt spaces.

Paper generalizes path signature using fractional calculus for improved machine learning.

problem Improving path signature for machine learning applications.
method Introduces two new signatures inspired by fractional calculus and machine learning considerations.
result Significant accuracy improvements in handwritten digit recognition.

We present a novel method for extracting cancer signatures by applying statistical risk models (http://ssrn.com/abstract=2732453) from quantitative finance to cancer genome data. Using 1389 whole genome sequenced samples from 14 cancers, we identify an "overall" mode of somatic mutational noise. We give a prescription …

2016-04-29abs ↗pdf ↗

Paper introduces branched signature model for efficient computation and data-driven applications.

problem Efficient computation and data-driven modeling of branched rough paths.
method Develops a universal approximation theorem and constructs an extension map to realize branched signatures.
result Explicit construction of branched signatures via an extension map for efficient computation.

Rough Transformers improve efficiency for medical time-series data.

problem Efficiently modeling irregularly sampled, long-range time-series data.
method Introducing Rough Transformers, a Transformer variant with continuous-time representations and multi-view signature attention.
result Rough Transformers outperform vanilla Transformers while using less computational resources.

In this note, we lay the groundwork for a new approach to the problem of group-signature classification of group actions on closed Riemann surfaces. This new approach first focuses on analyzing the low level arithmetic conditions on signatures before invoking the more complicated group theory. We provide the complete f…

2018-10-02abs ↗pdf ↗

The study explains why signature methods work in commodity futures term structure classification.

problem Lack of interpretability in signature methods for term structure classification.
method Introducing signature perturbations to explain the success of signature-based classification.
result The volatility of the convenience yield is the major discriminant for commodity markets classification.