mlsanityData to 14 Oct 2026

Probabilistic Signature Inversion: Learning Conditional Distributions from Truncated Signatures

arXiv 2606.15332 ↗First posted 13 Jun 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The signature transform is a principled feature map for continuous-time paths, valued for its uniqueness and universality. Recovering a path from its truncated signature is, however, structurally ill-posed because the truncated signature map is not injective. We therefore reframe truncated signature inversion as a probabilistic problem -- learning the conditional distribution of a path given its truncated signature -- and adopt a signature-conditioned flow matching model as a practical estimator. This probabilistic formulation elucidates the fundamental difficulty of inversion: Bayes reconstruction error quantifies the irreducible uncertainty remaining after conditioning on a statistic. We derive the Bayes-optimal error under linear statistics, obtaining a closed form for log-GBM and numerically tractable formulas for log-fBM and OU, yielding a concrete theoretical baseline for model validation. This baseline upper-bounds the Bayes error under truncated-signature conditioning, since truncated signatures provide richer information than linear statistics. Experiments show that empirical reconstruction errors under linear-statistics conditioning faithfully align with the theory-derived baseline, while errors decrease when the statistic is replaced with truncated signatures. Moreover, generated paths faithfully recover the conditioning signature while preserving key distributional and temporal structures, indicating that the estimator is well-calibrated to the target conditional distribution. Together, these results establish a well-posed probabilistic framework for truncated-signature inversion, with applicability demonstrated on real financial data beyond the parametric process families covered by theory.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 29 references that are in the map. First posted on arXiv 13 Jun 2026.

Builds on

13 of 29 references.

References · 13

  1. 2022Scalable Diffusion Models with Transformerscited by 6,054
  2. 2022Flow Matching for Generative Modelingcited by 5,702
  3. 2021CSDI: Conditional Score-based Diffusion Models for Probabilistic Time Series Imputationcited by 582
  4. 2021Autoregressive Denoising Diffusion Models for Multivariate Probabilistic Time Series Forecastingcited by 337
  5. 2024Diffusion-TS: Interpretable Diffusion for General Time Series Generationcited by 184
  6. 2016A Primer on the Signature Method in Machine Learningcited by 104
  7. 2019Deep Signature Transformscited by 75
  8. 2021Sig-Wasserstein GANs for Time Series Generationcited by 60
  9. 2020Signatory: differentiable computations of the signature and logsignature transforms, on both CPU and GPUcited by 46
  10. 2020A Data-driven Market Simulator for Small Data Environmentscited by 35
  11. 2020Conditional Sig-Wasserstein GANs for Time Series Generationcited by 23
  12. 2023On Consistency of Signature Using Lassocited by 5
1 more
  1. 2023The insertion method to invert the signature of a pathcited by 3

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Uncertainty in a Single Pass: A Closed-Form Identity for One-Step Flow Matching
  2. 2026When Can Conditional Flow Matching Replace Pointwise Negative Log-Likelihood?
  3. 2025Bayesian Inverse Problems Meet Flow Matching: Efficient and Flexible Inference via Transformers
  4. 2026Drift Variation Autoencoder: Unifying Generation and Representation Learning through Conditional Posterior Flow Matching
  5. 2026From Path Signatures to Sequential Modeling: Incremental Signature Contributions for Offline RL
  6. 2026Flow Matching for Fast Posterior Sampling in Bayesian Inverse Problems
  7. 2026Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching
  8. 2025Conditional Flow Matching for Bayesian Posterior Inference