Signature asymptotics, empirical processes, and optimal transport

被引:0
作者
Cass, Thomas [1 ,2 ,3 ]
Messadene, Remy [1 ]
Turner, William F. [1 ]
机构
[1] Imperial Coll London, London, England
[2] Inst Adv Study, London, England
[3] Alan Turing Inst, London, England
来源
ELECTRONIC JOURNAL OF PROBABILITY | 2023年 / 28卷
基金
英国工程与自然科学研究理事会;
关键词
rough analysis; signatures; empirical processes; optimal transport; STRATONOVICHS SIGNATURES; PATH; UNIQUENESS; INVERSION;
D O I
10.1214/23-EJP1048
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Rough path theory [15] provides one with the notion of the signature, a graded family of tensors which characterise, up to a negligible equivalence class, an ordered stream of vector-valued data. In this article, we lay down the theoretical foundations for a connection between signature asymptotics, the theory of empirical processes, and Wasserstein distances, opening up the landscape and toolkit of the second and third in the study of the first. Our main contribution is to show that the Hilbert-Schmidt norm of the signature can be reinterpreted as a statement about the asymptotic behaviour of Wasserstein distances between two independent empirical measures of samples from the same underlying distribution. In the setting studied here, these measures are derived from samples from a probability distribution which is directly determined by geometrical properties of the underlying path. The general question of rates of convergence for these objects has been studied in depth in the recent monograph of Bobkov and Ledoux [2]. To illustrate this new connection, we show how the above main result can be used to prove a more general version of the original asymptotic theorem of Hambly and Lyons [19]. We conclude by providing an explicit way to compute that limit in terms of a second-order differential equation.
引用
收藏
页数:19
相关论文
共 32 条
  • [1] Billingsley P, 1999, CONVERGE PROBAB MEAS, DOI 10.1002/9780470316962
  • [2] One-Dimensional Empirical Measures, Order Statistics, and Kantorovich Transport Distances
    Bobkov, Sergey
    Ledoux, Michel
    [J]. MEMOIRS OF THE AMERICAN MATHEMATICAL SOCIETY, 2019, 261 (1259) : 1 - +
  • [3] TAIL ASYMPTOTICS OF THE BROWNIAN SIGNATURE
    Boedihardjo, H.
    Geng, X.
    [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2019, 372 (01) : 585 - 614
  • [4] The uniqueness of signature problem in the non-Markov setting
    Boedihardjo, H.
    Geng, X.
    [J]. STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2015, 125 (12) : 4674 - 4701
  • [5] Path developments and tail asymptotics of signature for pure rough paths
    Boedihardjo, Horatio
    Geng, Xi
    Souris, Nikolaos P.
    [J]. ADVANCES IN MATHEMATICS, 2020, 364
  • [6] A non-vanishing property for the signature of a path
    Boedihardjo, Horatio
    Geng, Xi
    [J]. COMPTES RENDUS MATHEMATIQUE, 2019, 357 (02) : 120 - 129
  • [7] The signature of a rough path: Uniqueness
    Boedihardjo, Horatio
    Geng, Xi
    Lyons, Terry
    Yang, Danyu
    [J]. ADVANCES IN MATHEMATICS, 2016, 293 : 720 - 737
  • [8] Super-multiplicativity and a lower bound for the decay of the signature of a path of finite length
    Chang, Jiawei
    Lyons, Terry
    Ni, Hao
    [J]. COMPTES RENDUS MATHEMATIQUE, 2018, 356 (07) : 720 - 724
  • [9] CHARACTERISTIC FUNCTIONS OF MEASURES ON GEOMETRIC ROUGH PATHS
    Chevyrev, Ilya
    Lyons, Terry
    [J]. ANNALS OF PROBABILITY, 2016, 44 (06) : 4049 - 4082
  • [10] SK-Tree: a systematic malware detection algorithm on streaming trees via the signature kernel
    Cochrane, Thomas
    Foster, Peter
    Chhabra, Varun
    Lemercier, Maud
    Lyons, Terry
    Salvi, Cristopher
    [J]. PROCEEDINGS OF THE 2021 IEEE INTERNATIONAL CONFERENCE ON CYBER SECURITY AND RESILIENCE (IEEE CSR), 2021, : 35 - 40