Searcharxiv⌕ Search

arXiv subjects

Beatrice Acciaio

Publications and source records attributed to Beatrice Acciaio.

35 records · Page 2Linked to original sources

Designing Universal Causal Deep Learning Models: The Geometric (Hyper)Transformer

Several problems in stochastic analysis are defined through their geometry, and preserving that geometric structure is essential to generating meaningful predictions. Nevertheless, how to design principled deep learning (DL) models capable of encoding these geometric structures remains largely unknown. We address this open problem by introducing a universal causal geometric DL framework in which the user specifies a suitable pair of metric spaces $\mathscr{X}$ and $\mathscr{Y}$ and our framework returns a DL model capable of causally approximating any ``regular'' map sending time series in $\mathscr{X}^{\mathbb{Z}}$ to time series in $\mathscr{Y}^{\mathbb{Z}}$ while respecting their forward flow of information throughout time. Suitable geometries on $\mathscr{Y}$ include various (adapted) Wasserstein spaces arising in optimal stopping problems, a variety of statistical manifolds describing the conditional distribution of continuous-time finite state Markov chains, and all Fréchet spaces admitting a Schauder basis, e.g. as in classical finance. Suitable spaces $\mathscr{X}$ are compact subsets of any Euclidean space. Our results all quantitatively express the number of parameters needed for our DL model to achieve a given approximation error as a function of the target map's regularity and the geometric structure both of $\mathscr{X}$ and of $\mathscr{Y}$. Even when omitting any temporal structure, our universal approximation theorems are the first guarantees that Hölder functions, defined between such $\mathscr{X}$ and $\mathscr{Y}$ can be approximated by DL models.

cs.LG↗

Conditional COT-GAN for Video Prediction with Kernel Smoothing

Causal Optimal Transport (COT) results from imposing a temporal causality constraint on classic optimal transport problems, which naturally generates a new concept of distances between distributions on path spaces. The first application of the COT theory for sequential learning was given in Xu et al. (2020), where COT-GAN was introduced as an adversarial algorithm to train implicit generative models optimized for producing sequential data. Relying on (Xu et al., 2020), the contribution of the present paper is twofold. First, we develop a conditional version of COT-GAN suitable for sequence prediction. This means that the dataset is now used in order to learn how a sequence will evolve given the observation of its past evolution. Second, we improve on the convergence results by working with modifications of the empirical measures via kernel smoothing due to (Pflug and Pichler (2016)). The resulting kernel conditional COT-GAN algorithm is illustrated with an application for video prediction.

stat.ML↗

SPATE-GAN: Improved Generative Modeling of Dynamic Spatio-Temporal Patterns with an Autoregressive Embedding Loss

From ecology to atmospheric sciences, many academic disciplines deal with data characterized by intricate spatio-temporal complexities, the modeling of which often requires specialized approaches. Generative models of these data are of particular interest, as they enable a range of impactful downstream applications like simulation or creating synthetic training data. Recent work has highlighted the potential of generative adversarial nets (GANs) for generating spatio-temporal data. A new GAN algorithm COT-GAN, inspired by the theory of causal optimal transport (COT), was proposed in an attempt to better tackle this challenge. However, the task of learning more complex spatio-temporal patterns requires additional knowledge of their specific data structures. In this study, we propose a novel loss objective combined with COT-GAN based on an autoregressive embedding to reinforce the learning of spatio-temporal dynamics. We devise SPATE (spatio-temporal association), a new metric measuring spatio-temporal autocorrelation by using the deviance of observations from their expected values. We compute SPATE for real and synthetic data samples and use it to compute an embedding loss that considers space-time interactions, nudging the GAN to learn outputs that are faithful to the observed dynamics. We test this new objective on a diverse set of complex spatio-temporal patterns: turbulent flows, log-Gaussian Cox processes and global weather data. We show that our novel embedding loss improves performance without any changes to the architecture of the COT-GAN backbone, highlighting our model's increased capacity for capturing autoregressive structures. We also contextualize our work with respect to recent advances in physics-informed deep learning and interdisciplinary work connecting neural networks with geographic and geophysical sciences.

cs.LG↗

Cournot-Nash equilibrium and optimal transport in a dynamic setting

We consider a large population dynamic game in discrete time. The peculiarity of the game is that players are characterized by time-evolving types, and so reasonably their actions should not anticipate the future values of their types. When interactions between players are of mean-field kind, we relate Nash equilibria for such games to an asymptotic notion of dynamic Cournot-Nash equilibria. Inspired by the works of Blanchet and Carlier for the static situation, we interpret dynamic Cournot-Nash equilibria in the light of causal optimal transport theory. Further specializing to games of potential type, we establish existence, uniqueness and characterization of equilibria. Moreover we develop, for the first time, a numerical scheme for causal optimal transport, which is then leveraged in order to compute dynamic Cournot-Nash equilibria. This is illustrated in a detailed case study of a congestion game.

math.OC↗

COT-GAN: Generating Sequential Data via Causal Optimal Transport

We introduce COT-GAN, an adversarial algorithm to train implicit generative models optimized for producing sequential data. The loss function of this algorithm is formulated using ideas from Causal Optimal Transport (COT), which combines classic optimal transport methods with an additional temporal causality constraint. Remarkably, we find that this causality condition provides a natural framework to parameterize the cost function that is learned by the discriminator as a robust (worst-case) distance, and an ideal mechanism for learning time dependent data distributions. Following Genevay et al.\ (2018), we also include an entropic penalization term which allows for the use of the Sinkhorn algorithm when computing the optimal transport cost. Our experiments show effectiveness and stability of COT-GAN when generating both low- and high-dimensional time series data. The success of the algorithm also relies on a new, improved version of the Sinkhorn divergence which demonstrates less bias in learning.

stat.ML↗

Model-independent pricing with insider information: a Skorokhod embedding approach

In this paper, we consider the pricing and hedging of a financial derivative for an insider trader, in a model-independent setting. In particular, we suppose that the insider wants to act in a way which is independent of any modelling assumptions, but that she observes market information in the form of the prices of vanilla call options on the asset. We also assume that both the insider's information, which takes the form of a set of impossible paths, and the payoff of the derivative are time-invariant. This setup allows us to adapt recent work of Beiglboeck, Cox and Huesmann (2016) to prove duality results and a monotonicity principle, which enables us to determine geometric properties of the optimal models. Moreover, we show that this setup is powerful, in that we are able to find analytic and numerical solutions to certain pricing and hedging problems.

q-fin.MF↗

Inversion of Convex Ordering: Local Volatility Does Not Maximize the Price of VIX Futures

It has often been stated that, within the class of continuous stochastic volatility models calibrated to vanillas, the price of a VIX future is maximized by the Dupire local volatility model. In this article we prove that this statement is incorrect: we build a continuous stochastic volatility model in which a VIX future is strictly more expensive than in its associated local volatility model. More generally, in this model, strictly convex payoffs on a squared VIX are strictly cheaper than in the associated local volatility model. This corresponds to an inversion of convex ordering between local and stochastic variances, when moving from instantaneous variances to squared VIX, as convex payoffs on instantaneous variances are always cheaper in the local volatility model. We thus prove that this inversion of convex ordering, which is observed in the SPX market for short VIX maturities, can be produced by a continuous stochastic volatility model. We also prove that the model can be extended so that, as suggested by market data, the convex ordering is preserved for long maturities.

q-fin.MF↗

Extended Mean Field Control Problems: stochastic maximum principle and transport perspective

We study Mean Field stochastic control problems where the cost function and the state dynamics depend upon the joint distribution of the controlled state and the control process. We prove suitable versions of the Pontryagin stochastic maximum principle, both in necessary and in sufficient form, which extend the known conditions to this general framework. Furthermore, we suggest a variational approach to study a weak formulation of these control problems. We show a natural connection between this weak formulation and optimal transport on path space, which inspires a novel discretization scheme.

math.OC↗

Causal optimal transport and its links to enlargement of filtrations and continuous-time stochastic optimization

The martingale part in the semimartingale decomposition of a Brownian motion with respect to an enlargement of its filtration, is an anticipative mapping of the given Brownian motion. In analogy to optimal transport theory, we define causal transport plans in the context of enlargement of filtrations, as the Kantorovich counterparts of the aforementioned non-adapted mappings. We provide a necessary and sufficient condition for a Brownian motion to remain a semimartingale in an enlarged filtration, in terms of certain minimization problems over sets of causal transport plans. The latter are also used in order to give robust transport-based estimates for the value of having additional information, as well as model sensitivity with respect to the reference measure, for the classical stochastic optimization problems of utility maximization and optimal stopping. Our results have natural extensions to the case of general multidimensional continuous semimartingales.

math.PR↗

Characterization of max-continuous local martingales vanishing at infinity

We provide a characterization of the family of non-negative local martingales that have continuous running supremum and vanish at infinity. This is done by describing the class of random times that identify the times of maximum of such processes. In this way we extend to the case of general filtrations a result proved by Nikeghbali and Yor [NY06] for continuous filtrations. Our generalization is complementary to the one presented by Kardaras [Kar14], and is obtained by means of similar tools.

math.PR↗

Semi-static completeness and robust pricing by informed investors

We consider a continuous-time financial market that consists of securities available for dynamic trading, and securities only available for static trading. We work in a robust framework where a set of non-dominated models is given. The concept of semi-static completeness is introduced: it corresponds to having exact replication by means of semi-static strategies. We show that semi-static completeness is equivalent to an extremality property, and give a characterization of the induced filtration structure. Furthermore, we consider investors with additional information and, for specific types of extra information, we characterize the models that are semi-statically complete for the informed investors. Finally, we provide some examples where robust pricing for informed and uninformed agents can be done over semi-statically complete models.

math.PR↗

The space of outcomes of semi-static trading strategies need not be closed

Semi-static trading strategies make frequent appearances in mathematical finance, where dynamic trading in a liquid asset is combined with static buy-and-hold positions in options on that asset. We show that the space of outcomes of such strategies can have very poor closure properties when all European options for a fixed date $T$ are available for static trading. This causes problems for optimal investment, and stands in sharp contrast to the purely dynamic case classically considered in mathematical finance.

q-fin.MF↗

Arbitrage of the first kind and filtration enlargements in semimartingale financial models

In a general semimartingale financial model, we study the stability of the No Arbitrage of the First Kind (NA1) (or, equivalently, No Unbounded Profit with Bounded Risk) condition under initial and under progressive filtration enlargements. In both cases, we provide a simple and general condition which is sufficient to ensure this stability for any fixed semimartingale model. Furthermore, we give a characterisation of the NA1 stability for all semimartingale models.

math.PR↗

A model-free version of the fundamental theorem of asset pricing and the super-replication theorem

We propose a Fundamental Theorem of Asset Pricing and a Super-Replication Theorem in a model-independent framework. We prove these theorems in the setting of finite, discrete time and a market consisting of a risky asset S as well as options written on this risky asset. As a technical condition, we assume the existence of a traded option with a super-linearly growing payoff-function, e.g., a power option. This condition is not needed when sufficiently many vanilla options maturing at the horizon T are traded in the market.

math.PR↗

Risk assessment for uncertain cash flows: Model ambiguity, discounting ambiguity, and the role of bubbles

We study the risk assessment of uncertain cash flows in terms of dynamic convex risk measures for processes as introduced in Cheridito, Delbaen, and Kupper (2006). These risk measures take into account not only the amounts but also the timing of a cash flow. We discuss their robust representation in terms of suitably penalized probability measures on the optional sigma-field. This yields an explicit analysis both of model and discounting ambiguity. We focus on supermartingale criteria for different notions of time consistency. In particular we show how bubbles may appear in the dynamic penalization, and how they cause a breakdown of asymptotic safety of the risk assessment procedure.

q-fin.RM↗

Dynamic risk measures

This paper gives an overview of the theory of dynamic convex risk measures for random variables in discrete time setting. We summarize robust representation results of conditional convex risk measures, and we characterize various time consistency properties of dynamic risk measures in terms of acceptance sets, penalty functions, and by supermartingale properties of risk processes and penalty functions.

q-fin.RM↗