AI & ML
Branched Signature Model
arXiv cs.NA0 views
arXiv:2511.00018v2 Announce Type: replace Abstract: In this paper, we introduce the branched signature model, motivated by the branched rough path framework of [Gubinelli, Journal of Differential Equations, 248(4), 2010], which generalizes the classical geometric rough path. We establish a universal approximation theorem for the branched signature model and demonstrate that iterative compositions of lower-level signature maps can approximate higher-level signatures. Furthermore, building on the existence of the extension map proposed in [Hairer-Kelly. Annales de l'Institue Henri Poincar\'e, Probabilit\'es et Statistiques 51, no. 1 (2015)], we show how to explicitly construct the extension of the original paths into higher-dimensional spaces via a map $\Psi$, so that the branched signature can be realized as the classical geometric signature of the extended path. This framework not only provides an efficient computational scheme for branched signatures but also opens new avenues for data-driven modeling and applications. We demonstrate the effectiveness of the proposed framework through two representative applications: rough volatility calibration and optimal execution.
Source:https://arxiv.org/abs/2511.00018PreviousAudit trail software may create an appearance of control without proving controlNextSmoothing Newton Methods for Evolving Piecewise Smooth Systems Arising from Parabolic PDEs with Hysteresis
Related posts
How to Turn a Process Document Into a Working App With AI
0dev.to Machine Learning
Which AI subscription should I buy?
0dev.to Machine Learning
Your Classifier Says 0.97. Six Ways That Number Lies in .NET 10
0dev.to Machine Learning
Which AI song generator fits a lyrics-first workflow?
0dev.to Tutorial
Anima 2.9B in ComfyUI: Six Workflows, From Official T2I to Tiled Redraw and Smart Img2Img
0dev.to Tutorial
How to calculate how many cartons fit on a pallet (with a worked example)
0dev.to Tutorial