Universal approximation with signatures of non-geometric rough paths

• URL: http://arxiv.org/abs/2602.05898v1
• Date: Thu, 05 Feb 2026 17:16:25 GMT
• Title: Universal approximation with signatures of non-geometric rough paths
• Abstract summary: We prove that linear functionals of the signature of the resulting rough paths approximate continuous functionals on rough path spaces uniformly on compact sets.<n>We construct the signature of a path extended by its pathwise quadratic variation terms based on general pathwise integration la Fllmer.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We establish a universal approximation theorem for signatures of rough paths that are not necessarily weakly geometric. By extending the path with time and its rough path bracket terms, we prove that linear functionals of the signature of the resulting rough paths approximate continuous functionals on rough path spaces uniformly on compact sets. Moreover, we construct the signature of a path extended by its pathwise quadratic variation terms based on general pathwise stochastic integration à la Föllmer, in particular, allowing for pathwise Itô, Stratonovich, and backward Itô integration. In a probabilistic setting, we obtain a universal approximation result for linear functionals of the signature of continuous semimartingales extended by the quadratic variation terms, defined via stochastic Itô integration. Numerical examples illustrate the use of signatures when the path is extended by time and quadratic variation in the context of model calibration and option pricing in mathematical finance.

Related papers

• Consistent Geometric Deep Learning via Hilbert Bundles and Cellular Sheaves [68.683840670745]
  We introduce a novel convolutional learning framework for possibly infinite-dimensional signals supported on a manifold.<n>We make HilbNets and, more generally, the convolution operation, implementable via a two-stage sampling procedure.<n>Our results broaden the scope of geometric learning as a whole by lifting classical Laplacian-based frameworks to settings where the signal at each point lives in its own Hilbert space.
  arXiv  Detail & Related papers  (2026-05-07T15:08:58Z)
• Global universality via discrete-time signatures [0.0]
  We show that piecewise linears of Brownian motion satisfies this integrability condition.<n>We obtain $Lp$-approximation results for path-dependent functionals, random ordinary differential equations, and differential equations driven by Brownian motion.
  arXiv  Detail & Related papers  (2026-03-10T15:12:03Z)
• Global universal approximation with Brownian signatures [0.0]
  We show that linear functionals acting on signatures of time-extended rough paths are dense with respect to an $Lp$-distance.<n>We demonstrate that these $Lp$-type universal approximation theorems apply in particular to Brownian motion.
  arXiv  Detail & Related papers  (2025-12-18T10:49:20Z)
• Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations [57.179679246370114]
  We identify the distribution of random perturbations that minimizes the estimator's variance as the perturbation stepsize tends to zero.<n>Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length.
  arXiv  Detail & Related papers  (2025-10-22T19:06:39Z)
• Local regression on path spaces with signature metrics [0.669087470775851]
  We study non-parametric regression and classification for path-valued data.<n>We introduce a functional Nadaraya-Watson estimator that combines the signature transform from rough path theory with local kernel regression.
  arXiv  Detail & Related papers  (2025-10-19T06:40:51Z)
• Generalized Gradient Norm Clipping & Non-Euclidean $(L_0,L_1)$-Smoothness [51.302674884611335]
  This work introduces a hybrid non-Euclidean optimization method which generalizes norm clipping by combining steepest descent and conditional gradient approaches.<n>We discuss how to instantiate the algorithms for deep learning and demonstrate their properties on image classification and language modeling.
  arXiv  Detail & Related papers  (2025-06-02T17:34:29Z)
• A Generalized Version of Chung's Lemma and its Applications [10.570672679063394]
  We develop a generalized version of Chung's lemma, which provides a simple non-asymptotic convergence framework for a more general family of step size rules. As a by-product of our analysis, we observe that exponential step sizes can adapt to the objective function's geometry, achieving the optimal convergence rate without requiring exact knowledge of the underlying landscape.
  arXiv  Detail & Related papers  (2024-06-09T04:25:10Z)
• Adversarial flows: A gradient flow characterization of adversarial attacks [1.8749305679160366]
  A popular method to perform adversarial attacks on neuronal networks is the so-called fast gradient sign method.<n>We show convergence of the discretization to the associated gradient flow.
  arXiv  Detail & Related papers  (2024-06-08T07:05:26Z)
• A Unified Theory of Stochastic Proximal Point Methods without Smoothness [52.30944052987393]
  Proximal point methods have attracted considerable interest owing to their numerical stability and robustness against imperfect tuning. This paper presents a comprehensive analysis of a broad range of variations of the proximal point method (SPPM)
  arXiv  Detail & Related papers  (2024-05-24T21:09:19Z)
• Action formalism for geometric phases from self-closing quantum trajectories [55.2480439325792]
  We study the geometric phase of a subset of self-closing trajectories induced by a continuous Gaussian measurement of a single qubit system. We show that the geometric phase of the most likely trajectories undergoes a topological transition for self-closing trajectories as a function of the measurement strength parameter.
  arXiv  Detail & Related papers  (2023-12-22T15:20:02Z)
• Nonconvex Stochastic Scaled-Gradient Descent and Generalized Eigenvector Problems [98.34292831923335]
  Motivated by the problem of online correlation analysis, we propose the emphStochastic Scaled-Gradient Descent (SSD) algorithm. We bring these ideas together in an application to online correlation analysis, deriving for the first time an optimal one-time-scale algorithm with an explicit rate of local convergence to normality.
  arXiv  Detail & Related papers  (2021-12-29T18:46:52Z)
• q-Paths: Generalizing the Geometric Annealing Path using Power Means [51.73925445218366]
  We introduce $q$-paths, a family of paths which includes the geometric and arithmetic mixtures as special cases. We show that small deviations away from the geometric path yield empirical gains for Bayesian inference.
  arXiv  Detail & Related papers  (2021-07-01T21:09:06Z)
• On Riemannian Stochastic Approximation Schemes with Fixed Step-Size [21.434285400536094]
  A fixed step-size scheme defines a family of time-homogeneous Markov chains, parametrized by the step-size. For any step-size, the corresponding Markov chain is proved to admit a unique stationary distribution, and to be geometrically ergodic. The rate of convergence is established, through an expansion of the bias, and a central limit theorem.
  arXiv  Detail & Related papers  (2021-02-15T14:56:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.