The insertion method to invert the signature of a path
The signature is a representation of a path as an infinite sequence of its iterated integrals. Under certain assumptions, the signature characterizes the path, up to translation and reparameterization. Therefore, a crucial question of interest is the development of efficient algorithms to invert the...
Main Authors: | , , , |
---|---|
Format: | Journal article |
Jezik: | English |
Izdano: |
Cornell University
2023
|
_version_ | 1826310099130384384 |
---|---|
author | Fermanian, A Chang, J Lyons, T Biau, G |
author_facet | Fermanian, A Chang, J Lyons, T Biau, G |
author_sort | Fermanian, A |
collection | OXFORD |
description | The signature is a representation of a path as an infinite sequence of its iterated integrals. Under certain assumptions, the signature characterizes the path, up to translation and reparameterization. Therefore, a crucial question of interest is the development of efficient algorithms to invert the signature, i.e., to reconstruct the path from the information of its (truncated) signature. In this article, we study the insertion procedure, originally introduced by Chang and Lyons (2019), from both a theoretical and a practical point of view. After describing our version of the method, we give its rate of convergence for piecewise linear paths, accompanied by an implementation in Pytorch. The algorithm is parallelized, meaning that it is very efficient at inverting a batch of signatures simultaneously. Its performance is illustrated with both real-world and simulated examples. |
first_indexed | 2024-03-07T07:47:10Z |
format | Journal article |
id | oxford-uuid:91fbe0a7-a59c-470f-a291-a5fd20c1f9ed |
institution | University of Oxford |
language | English |
last_indexed | 2024-03-07T07:47:10Z |
publishDate | 2023 |
publisher | Cornell University |
record_format | dspace |
spelling | oxford-uuid:91fbe0a7-a59c-470f-a291-a5fd20c1f9ed2023-06-12T12:41:57ZThe insertion method to invert the signature of a pathJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:91fbe0a7-a59c-470f-a291-a5fd20c1f9edEnglishSymplectic ElementsCornell University2023Fermanian, AChang, JLyons, TBiau, GThe signature is a representation of a path as an infinite sequence of its iterated integrals. Under certain assumptions, the signature characterizes the path, up to translation and reparameterization. Therefore, a crucial question of interest is the development of efficient algorithms to invert the signature, i.e., to reconstruct the path from the information of its (truncated) signature. In this article, we study the insertion procedure, originally introduced by Chang and Lyons (2019), from both a theoretical and a practical point of view. After describing our version of the method, we give its rate of convergence for piecewise linear paths, accompanied by an implementation in Pytorch. The algorithm is parallelized, meaning that it is very efficient at inverting a batch of signatures simultaneously. Its performance is illustrated with both real-world and simulated examples. |
spellingShingle | Fermanian, A Chang, J Lyons, T Biau, G The insertion method to invert the signature of a path |
title | The insertion method to invert the signature of a path |
title_full | The insertion method to invert the signature of a path |
title_fullStr | The insertion method to invert the signature of a path |
title_full_unstemmed | The insertion method to invert the signature of a path |
title_short | The insertion method to invert the signature of a path |
title_sort | insertion method to invert the signature of a path |
work_keys_str_mv | AT fermaniana theinsertionmethodtoinvertthesignatureofapath AT changj theinsertionmethodtoinvertthesignatureofapath AT lyonst theinsertionmethodtoinvertthesignatureofapath AT biaug theinsertionmethodtoinvertthesignatureofapath AT fermaniana insertionmethodtoinvertthesignatureofapath AT changj insertionmethodtoinvertthesignatureofapath AT lyonst insertionmethodtoinvertthesignatureofapath AT biaug insertionmethodtoinvertthesignatureofapath |