Arcade Processes for Informed Martingale Interpolation and Transport

01/14/2023
by   Georges Kassis, et al.
0

Arcade processes are a class of continuous stochastic processes that interpolate in a strong sense, i.e., omega by omega, between zeros at fixed pre-specified times. Their additive randomization allows one to match any finite sequence of target random variables, indexed by the given fixed dates, on the whole probability space. The randomized arcade processes can thus be interpreted as a generalization of anticipative stochastic bridges. The filtrations generated by these processes are utilized to construct a class of martingales which interpolate between the given target random variables. These so-called filtered arcade martingales (FAMs) are almost-sure solutions to the martingale interpolation problem and reveal an underlying stochastic filtering structure. In the special case of nearly-Markov randomized arcade processes, the dynamics of FAMs are informed through Bayesian updating. FAMs can be connected to martingale optimal transport (MOT) by considering optimally-coupled target random variables. Moreover, FAMs allow to formulate the information-based martingale optimal transport problem, which enables the introduction of noise in MOT, in a similar fashion to how Schrödinger's problem introduces noise in optimal transport. This information-based transport problem is concerned with selecting an optimal martingale coupling for the target random variables under the influence of the noise that is generated by an arcade process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2020

Fast Unbalanced Optimal Transport on Tree

This study examines the time complexities of the unbalanced optimal tran...
research
10/07/2021

Score-based Generative Neural Networks for Large-Scale Optimal Transport

We consider the fundamental problem of sampling the optimal transport co...
research
04/28/2016

Optimal Transport vs. Fisher-Rao distance between Copulas for Clustering Multivariate Time Series

We present a methodology for clustering N objects which are described by...
research
03/02/2022

Discrete Optimal Transport with Independent Marginals is #P-Hard

We study the computational complexity of the optimal transport problem t...
research
07/15/2022

Weak limits of entropy regularized Optimal Transport; potentials, plans and divergences

This work deals with the asymptotic distribution of both potentials and ...
research
04/23/2014

Probabilistic graphs using coupled random variables

Neural network design has utilized flexible nonlinear processes which ca...
research
01/20/2018

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics

This chapter collects several probabilistic tools that proved to be usef...

Please sign up or login with your details

Forgot password? Click here to reset