New methods price American options in rough volatility models.
problem Pricing American options under rough volatility.
method Integrating deep-signature and signature-kernel learning into optimal stopping problem solutions.
result Performance comparison in rough Heston and rough Bergomi models.
We introduce a new method to measure model risk using optimal transport on path signatures.
problem Measuring model risk in financial and insurance models.
method Signature-induced optimal transport framework.
result Explicit robust bounds and a budget-aware sparse surrogate method.
Paper tackles DR problem with scalable signature-based approach.
problem Memory and computation cost issues in DR solutions.
method Signature-based features, novel distance approximator.
result Proposes scalable DR solution with reduced estimation uncertainty.
Framework uses optimal transport to quantify model risk in stochastic path laws.
problem Model risk in stochastic path laws.
method Signature-induced optimal transport framework.
result Explicit robust bounds and budget-aware sparse surrogate method.
Nonparametric pricing and hedging of exotic derivatives using signature payoffs.
problem Pricing and hedging exotic derivatives accurately and efficiently.
method Introducing signature payoffs and using them to approximate and price exotic derivatives nonparametrically.
result Signature payoffs enable accurate and computationally tractable pricing and hedging of exotic derivatives.
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.
A novel signature method improves sequential data prediction accuracy.
problem Improving prediction accuracy for sequential and temporal data.
method Signature method based on rough path theory, with a specific embedding called lead-lag.
result Lead-lag embedding consistently outperforms other embeddings across various datasets and algorithms.
Scalable machine learning with path signatures for time series and graphs.
problem Challenges in real-world time series and graph data.
method Combines rough path theory with probabilistic, deep, and kernel methods.
result Scalable models for time series and graph data.
New methods for volatility modeling using rough paths and signatures.
problem Calibrating implied volatility surfaces in various stochastic models.
method Analytical approximations and signature-based models based on rough path theory.
result Signature-based models achieve comparable accuracy to analytical expansions and can capture more complex dynamics.
Machine learning identifies distinctive mood patterns in bipolar and borderline personality disorders.
problem Challenges in diagnosing bipolar and borderline personality disorders using retrospective mood recall.
method Signature-based machine learning model using daily mood ratings from smartphone apps.
result The model effectively separates participants into three groups with high accuracy.
The development of molecular signatures for the prediction of time-to-event outcomes is a methodologically challenging task in bioinformatics and biostatistics. Although there are numerous approaches for the derivation of marker combinations and their evaluation, the underlying methodology often suffers from the proble…
New SigSwap model for path-dependent financial risk.
problem Managing complex, path-dependent financial risks.
method Geometry-based approach using path-signature and Signature Expected Shortfall.
result Path-dependent risks can be converted into transparent risk factors.
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.
We introduce the functional mean-shift algorithm, an iterative algorithm for estimating the local modes of a surrogate density from functional data. We show that the algorithm can be used for cluster analysis of functional data. We propose a test based on the bootstrap for the significance of the estimated local modes …
Defines knot signature invariant using G-signature theorem.
problem No specific problem stated; focuses on knot theory.
method Uses G-signature theorem to define knot invariant.
result Defines an invariant for strongly invertible knots.
Deep signature/log-signature FBSDE algorithm improves accuracy and training time.
problem Solving FBSDEs with state and path dependent features.
method Incorporates deep signature/log-signature transformation into RNN model.
result Improves accuracy and training time compared to existing methods.
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…
Maximum Levine-Tristram signature of torus knots follows a reduction formula.
problem Determining the maximum Levine-Tristram signature for torus knots.
method Proved a reduction formula analogous to Gordon-Litherland-Murasugi's classical signature result.
result Maximum Levine-Tristram signature of torus knots satisfies a reduction formula.
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 …
We define the Analytical signature, the Hodge signature and the de Rham signature for a foliated manifold with boundary with foliation transverse to the boundary. We show that all these signatures coincide and a Hirzebruch formula is valid.
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.
New signatures for knotted graphs linked to classical knot signatures.
problem Defining invariants for knotted trivalent graphs.
method Using branched covers to define and relate new signatures to classical knot signatures.
result Computable invariants for Kinoshita's knotted theta graph.
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.
New method classifies signatures of group actions on Riemann surfaces.
problem Classifying signatures of group actions on Riemann surfaces.
method Analyzes arithmetic conditions first, then uses group theory.
result Complete list of signatures for every genus, subset that appears as group action.
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 …
pySigLib speeds up signature-based computations on CPUs and GPUs.
problem Efficient signature-based computations on large datasets and long sequences.
method Optimised Python library for CPU and GPU, novel differentiation scheme.
result Accurate gradients at a fraction of the runtime of existing libraries.
Efficiently computes sparse signature coefficients using kernels.
problem Lack of efficient methods for sparse signature coefficients.
method Signature kernels and PDE-based methods.
result Sparse groups of signature coefficients can be isolated effectively.
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.
New method calculates signatures of biquotients.
problem Signature calculation for homogeneous spaces.
method Generalization of Hirzebruch's computation to biquotients.
result Signature of biquotients computed for equal rank cases.
Link signature limit depends on linking matrix under specific polynomial condition.
problem Limits of Tristam-Levine signature function under precise polynomial conditions.
method Analysis of Alexander polynomial and linking matrix.
result Limit of Tristam-Levine signature at 1 determined by linking matrix under specific polynomial condition.
Paper provides methods for quantizing norm and action in pseudo-Riemann manifolds.
problem Signature consequences in Riemann and pseudo-Riemann manifolds hinder physics applications.
method Uses linear independence of canonical classes instead of positive norm.
result Quantization of norm and action as a property of topology and cohomology.
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.
Knot signature function defined and conditions for its existence are given.
problem Defining and characterizing the signature function of knots.
method Presentation of necessary and sufficient conditions for a function to be a knot signature function.
result Conditions for a function to be the signature function of a knot are established.
Develops a new family of signature-changing models on metric manifolds.
problem Signature changes in metric manifolds.
method One-parameter family of Lorentz-Riemann models, local expressions around change.
result Generalizes existing signature-changing models.
We prove that the signature of an even, symmetric form on a finite rank integral lattice, has signature divisible by 8, provided its associated linking form vanishes in the Witt group of linking forms. Our result generalizes the well know fact that an even, unimodular form has signature divisible by 8. We give applicat…
Paper confirms Kashaev's signature conjecture for links.
problem Proving Kashaev's conjecture about link invariants.
method Using Seifert surface definition and diagrammatic approach.
result Established Kashaev's conjecture, providing a new formula for Alexander polynomial.
The paper defines signatures for Witt spaces with boundary and proves their equality.
problem Defining and proving signatures for Witt spaces with boundary.
method Introducing de Rham and Hodge signatures, extending index theory, and using von Neumann algebras.
result Equality of de Rham and Hodge signatures on Witt spaces with boundary.
A new method uses signatures to classify shapes efficiently.
problem Classifying shapes succinctly and invariantly.
method Proposes a method using signatures for shape classification.
result Outperforms current methods like SRV transform and dynamic programming.
Deep neural network for cancer classification using autoencoders.
problem Cancer classification using molecular information.
method Using a Denoising Autoencoder (DAE) as weight initialization for a deep neural network, comparing two approaches: fixed weights and fine-tuning. Embedding strategies included encoding layers and complete autoencoder.
result Best F1 score of 98.04% for identifying thyroid cancer samples.
A new deep learning approach enhances signature transforms for data analysis.
problem Improving data analysis through more flexible signature transforms.
method Combining deep learning with signature transforms to select terms data-dependently.
result Signature transform can be used as a pooling operation within neural networks.
A new graph signature invariant to graph automorphisms.
problem Graph symmetry and feature generation.
method Power spectrum signature derived from squared graph Fourier transform.
result Power spectrum signature is stable under graph perturbations.
Study finds infinitely many surface bundle types with zero signature.
problem Characterizing homeomorphism types of surface bundles with specific signatures.
method Analyzing atoroidal surface bundles over surfaces.
result Infinitely many homeomorphism types of atoroidal surface bundles over surfaces with signature zero.
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.
New approach treats coordination as an architectural layer to improve LLM-based multi-agent systems.
problem Coordination defects lead to high failure rates in LLM-based multi-agent systems.
method Treats coordination as a configurable architectural layer separable from agent logic and information access.
result Configurations leave distinguishable signatures, enabling architectural reasoning and Pareto frontiers.