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.

169,291 papers · 148 categories

Trend · papers per month

2555097641,018 · Jun 202019922001200920182026
48 results for signature generation

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 method uses randomised signatures for generating financial time series data.

problem Generating synthetic financial time series data accurately.
method Introduced a Wasserstein-type distance based on discrete-time randomised signatures.
result Demonstrated universal approximation for randomised signatures on continuous functions.

Researchers develop Malliavin calculus for signatures, simplifying option Greeks computation.

problem Lack of tractability and explicit representations in Malliavin calculus.
method Focus on finite linear combinations of time-extended Brownian motion signatures, derive explicit formulas for Malliavin derivative, and compute Greeks for path-dependent options.
result Closed-form expressions for classical operators of Malliavin calculus, providing algebraic formulations.

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 ↗

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.

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.

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.

Generalizes quantum integrability to all signatures for projectively equivalent metrics.

problem Quantum integrability for Beltrami-Laplace operators across various signatures.
method Shows that Killing tensors constructed from projectively equivalent metrics correspond to commuting differential operators.
result Quantum integrability for Beltrami-Laplace operators is established for all signatures.

The paper adapts differential signatures to algebraic curves under group actions.

problem Equivalence problem for complex plane algebraic curves under group actions.
method Adapting differential signature construction to algebraic curves, using classifying invariants.
result Explicit sets of rational classifying invariants and formulas for signature curve degree.

A hyperelliptic broken Lefschetz fibration is a generalization of a hyperelliptic Lefschetz fibration. We construct and compute a local signature of hyperelliptic directed broken Lefschetz fibrations by generalizing Endo's local signature of hyperelliptic Lefschetz fibrations. It is described by his local signature and…

2011-10-24abs ↗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.

Expected signatures map data streams to lower dimensions, improving ML performance.

problem Leveraging model-free embeddings for domain-agnostic machine learning.
method Expected signatures map data streams to lower dimensions, with convergence results bridging empirical and theoretical estimators.
result A modified expected signature estimator with lower mean squared error for martingale processes.

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.

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.

Generative model for TPPs using signatures and distributional discrepancies.

problem Limitations of signature methods for TPPs and lack of global sequence-level loss in neural models.
method Introduce interarrival embedding to lift jump paths to continuous paths of bounded variation, enabling signature methods for discrete event sequences. Develop sigTPP, a signature-based generative model trained on path-level loss.
result sigTPP achieves the best average rank across multiple metrics and outperforms or is within a standard error of the strongest baseline in 64% of dataset-metric pairs.

It was asked by J.Birman, Williams, and L.Rudolph whether nontrivial Lorentz knots have always positive signature. Lorentz knots are examples of positive braids (in our convention they have all crossings negative so they are negative links). It was shown by L.Rudolph that positive braids have positive signature (if the…

2009-05-06abs ↗pdf ↗

New bounds refine how multivariable signature and nullity change under link cobordisms.

problem Understanding how multivariable signature and nullity change under link cobordisms.
method Refined bounds on multivariable signature and nullity using link cobordisms and 0.50.5-solvable cobordism.
result Multivariable signature and nullity are invariant under 0.50.5-solvable cobordism.

Average signature measures geodesics in Lie groups.

problem Understanding geometric properties of Lie groups through geodesic paths.
method Introducing average signature A(G)\mathbb A(G) and using it with trace operation to recover geometric properties.
result Average signature can recover geometric properties like dimension, diameter, volume, and scalar curvature.

We study the behavior of the signature of colored links [Flo05, CF08] under the splice operation. We extend the construction to colored links in integral homology spheres and show that the signature is almost additive, with a correction term independent of the links. We interpret this correction term as the signature o…

2014-09-20abs ↗pdf ↗

Novel signature approach for pricing and hedging path-dependent options with market frictions.

problem Pricing and hedging path-dependent options with market frictions.
method Signature approach, mean-quadratic variation criterion, non-standard infinite-dimensional Riccati equations, time-augmented signature, non-Markovian stochastic control problem.
result Effective hedging strategies in frictional markets with low-truncated signature approximations.

The visibility transformation embeds data position into signature features for efficient pattern recognition.

problem Embedding absolute position into signature features for efficient pattern recognition.
method The visibility transformation is put on a theoretical footing and used to embed absolute position into signature features efficiently.
result The generated feature set simplifies pattern recognition by accommodating nonlinear functions of absolute and relative values.

Paper proposes an ensemble model for writer-independent offline signature verification using deep learning.

problem Difficulty in distinguishing genuine signatures from skilled forgeries in writer-independent offline signature verification.
method Used an ensemble model with two CNNs for feature extraction, RGBT for classification, and stacking for final prediction.
result Achieved state-of-the-art performance on various datasets.

In this paper, we use `generalized Seifert surfaces' to extend the Levine-Tristram signature to colored links in S^3. This yields an integral valued function on the m-dimensional torus, where m is the number of colors of the link. The case m=1 corresponds to the Levine-Tristram signature. We show that many remarkable p…

2005-05-10abs ↗pdf ↗

We define a set of "second-order" L^(2)-signature invariants for any algebraically slice knot. These obstruct a knot's being a slice knot and generalize Casson-Gordon invariants, which we consider to be "first-order signatures". As one application we prove: If K is a genus one slice knot then, on any genus one Seifert …

2008-08-11abs ↗pdf ↗

New criteria ensure uniqueness of curve signatures, robust to metric variations.

problem Ensuring uniqueness of curve signatures in differential geometry.
method Introducing new methods through differential equations and higher order derivatives.
result New criteria for curve signature uniqueness in general settings.

We compute the average Tristram---Levine signature of any graph link with positive weights in a three sphere, generalizing the results of Kirby and Melvin. The main tools are the Neumann's algorithm for computing the equivariant signatures of graph links and the Reciprocity Law for Dedekind sums.

2013-05-07abs ↗pdf ↗

Quantum modularity proved for SU(2) TQFT signature on genus 2 surfaces.

problem Proving quantum modularity of SU(2) TQFT signature for genus 2 surfaces.
method Using quantum modularity of generalized Dedekind sums associated with modular forms and trigonometric sum expressions.
result Quantum modularity of SU(2) TQFT signature on genus 2 surfaces proved.

This paper develops a path-first theory using signatures and jump lifts for self-exiting processes.

problem Developing a universal coordinate system for various types of paths and processes.
method Using signatures, jump lifts, and expected signatures, the paper presents a geometricity framework with algebraic properties and obstructions.
result The framework links various mathematical concepts and offers four main contributions to understanding and modeling self-exiting processes.