Paper: arXiv 2410.09196
Authors: Andrew Alden, Carmine Ventre, Blanka Horvath
Abstract
Distribution Regression (DR) on stochastic processes describes the learning task of regression on collections of time series. Path signatures, a technique prevalent in stochastic analysis, have been used to solve the DR problem. Recent works have demonstrated the ability of such solutions to leverage the information encoded in paths via signature-based features. However, current state of the art DR solutions are memory intensive and incur a high computation cost. This leads to a trade-off between path length and the number of paths considered. This computational bottleneck limits the application to small sample sizes which consequently introduces estimation uncertainty. In this paper, we present a methodology for addressing the above issues; resolving estimation uncertainties whilst also proposing a pipeline that enables us to use DR for a wide variety of learning tasks. Integral to our approach is our novel distance approximator. This allows us to seamlessly apply our methodology across different application domains, sampling rates, and stochastic process dimensions. We show that our model performs well in applications related to estimation theory, quantitative finance, and physical sciences. We demonstrate that our model generalises well, not only to unseen data within a given distribution, but also under unseen regimes (unseen classes of stochastic models).
Complexity vs Empirical Score
- Math Complexity: 8.0/10
- Empirical Rigor: 7.0/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper provides a strong theoretical framework combining path signatures, kernel mean embeddings (KMEs), and higher-order Maximum Mean Discrepancy (MMD) to address scalable distribution regression. It effectively balances advanced stochastic analysis mathematics with practical algorithmic improvements using reference sets and empirical distance approximators.
Research Flowchart
flowchart TD
A["Research Goal: Scale Distribution Regression (DR) for Stochastic Processes"] --> B["Input: High-Dim Time Series & Stochastic Process Collections"]
B --> C["Compute Path Signatures & Novel Distance Approximator"]
C --> D["Reference Set Reduction Pipeline"]
D --> E["Train Scalable Signature-Based DR Model"]
E --> F["Outcomes: High Efficiency & Strong Generalization across Finance & Science"]
Cited References (61)
- Optimal Stopping via Distribution Regression: a Higher Rank Signature Approach (2023) — link
- Model-Agnostic Pricing of Exotic Derivatives Using Signatures (2022) — link
- Higher Order Kernel Mean Embeddings to Capture Filtrations of Stochastic Processes (2021) — link
- The Wasserstein space of stochastic processes (2021) — link
- Optimal Stopping via Randomized Neural Networks (2021) — link
- Neural Rough Differential Equations for Long Time Series (2020) — link
- The Signature Kernel Is the Solution of a Goursat PDE (2020) — link
- A Data-driven Market Simulator for Small Data Environments (2020) — link
and 53 more
- Distribution Regression for Sequential Data (2020) — link
- Adapted topologies and higher rank signatures (2020) — link
- Embedding and learning with signatures (2019) — link
- Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networks (2019) — link
- On the Limitations of Representing Functions on Sets (2019) — link
- Intraoperative Brain Shift Compensation Using a Hybrid Mixture Model (2018) — link
- Causal Inference via Kernel Deviance Measures (2018) — link
- Decoupled Weight Decay Regularization (2017)
- Functional central limit theorems for rough volatility (2017) — link
- Turbocharging Monte Carlo pricing for the rough Bergomi model (2017) — link
- Bayesian Approaches to Distribution Regression (2017) — link
- Deep Sets (2017) — link
- Multiple instance learning: A survey of problem characteristics and applications (2016) — link
- Understanding the 2016 US Presidential Election using ecological inference and distribution regression with census microdata (2016) — link
- A Primer on the Signature Method in Machine Learning (2016) — link
- Bayesian Learning of Kernel Embeddings (2016) — link
- Kernels for sequentially ordered data (2016) — link
- DYNAMICAL MASS MEASUREMENTS OF CONTAMINATED GALAXY CLUSTERS USING MACHINE LEARNING (2015) — link
- Chinese character-level writer identification using path signature feature, DropStroke and deep CNN (2015) — link
- Who Supported Obama in 2012?: Ecological Inference through Distribution Regression (2015) — link
- Pricing under rough volatility (2015) — link
- Learning Theory for Distribution Regression (2014) — link
- A MACHINE LEARNING APPROACH FOR DYNAMICAL MASS MEASUREMENTS OF GALAXY CLUSTERS (2014) — link
- Rough paths, Signatures and the modelling of functions on streams (2014) — link
- Characteristic functions of measures on geometric rough paths (2013) — link
- Distribution-Free Distribution Regression (2013) — link
- A Kernel Two-Sample Test (2012) — link
- Finite Mixture Models (2008)
- Option pricing based on mixtures of distributions: Evidence from the Eurex index and interest rate futures options market (2005) — link
- Dimensionality Reduction for Supervised Learning with Reproducing Kernel Hilbert Spaces (2004) — link
- Unconstrained fitting of implied volatility surfaces using a mixture of normals (2004) — link
- Monte Carlo Methods in Financial Engineering (2003) — link
- Lognormal-mixture dynamics and calibration to market volatility smiles (2002) — link
- Multiple Instance Regression (2001)
- Di erential equations driven by rough signals (1998) — link
- Contingent Claims and Market Completeness in a Stochastic Volatility Model (1997) — link
- Solving the Multiple Instance Problem with Axis-Parallel Rectangles (1997) — link
- The Constant Elasticity of Variance Option Pricing Model (1996) — link
- A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options (1993) — link
- CALL OPTION VALUATION FOR DISCRETE NORMAL MIXTURES (1990) — link
- The Pricing of Options and Corporate Liabilities (1973) — link
- Quelques applications de la formule de changement de variables pour les semimartingales (1970) — link
- INTEGRATION OF PATHS—A FAITHFUL REPRE- SENTATION OF PATHS BY NONCOMMUTATIVE FORMAL POWER SERIES (1958) — link
- Set transformer: A framework for attention-based permutation-invariant neural networks (2019)
- Deep Learning (2016) — link
- Equilibrium Thermodynamics I: (2016)
- Kernel Bayes’ rule: Bayesian inference with positive definite kernels (2013) — link
- Differential equations driven by rough paths (2007) — link
- Monte Carlo Methods in Finance (2002)
- III. Contributions to the mathematical theory of evolution — link
- UvA-DARE (Digital Academic Repository) Attention-based Deep Multiple Instance Learning Attention-based Deep Multiple Instance Learning
- 25 = 1 2 0 = 0 1 = − 0 85. kernel features took 2 hours. Training of the baseline models was performed on a GTX 1660 Ti GPU and lasted under 20 minutes. 24
- A detailed example of how to generate your data in parallel with PyTorch
0 of 61 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2518 linked papers.