SearcharxivSearch

arXiv subjects

Beatrice Acciaio

Publications and source records attributed to Beatrice Acciaio.

At least 19 recordsLinked to original sources

Fixed Points for the $q$-Bass Martingale: Existence, Stability, and Convergence

We establish existence, uniqueness, stability, and convergence results for one-dimensional $q$-Bass martingales, characterized as the martingales with prescribed initial and terminal marginals whose transition kernels are closest to a reference measure $q$. Their existence is equivalent to the solvability of a fixed-point problem for probability distributions. Building on Acciaio and Marini (2026), that requires the first marginal to be supported on finitely many points, we study the case of general marginals in convex order. Under the assumption that $q\llλ$, we prove existence, uniqueness and stability of fixed-point distributions, $\mathcal{W}_\infty$-convergence of the fixed-point iteration, and support-diameter estimates. We also extend the martingale Benamou-Brenier formula from Brownian motion to any additive reference process $X$ and show that the corresponding $X$-Bass martingale is optimal whenever it exists, with an interpretation as an adapted Wasserstein projection of $X$.

math.PR

Existence of $q$-Bass martingales in the semidiscrete setting

The class of $q$-Bass martingales provides a natural answer to a central question in martingale optimal transport: how to construct martingales with prescribed initial and terminal marginals whose transition kernel remains as close as possible to a given reference measure $q$. We prove the existence of $q$-Bass martingales when the initial marginal is supported on finitely many atoms, and establish uniqueness, up to an additive translation constant, of the associated Bass measure. Our approach is geometric and relies on the analysis of a suitable parametrization of convex polygonal chains.

math.PR

Schrödinger's problem with constraints

Motivated by the connection between the Kyle equilibrium with static private signal and the Brownian bridge, we study a much broader class of bridges that allow one to consider more general equilibrium models, for example ones including trading costs and default risk. We show that such bridges are solutions to problems of the Schrödinger-type. Leveraging this connection, we obtain that the equilibria in models with trading costs converge to equilibria in the classical Kyle model.

math.PR

Implicit Regularization of Large Neural Networks via Mean-Field Formulation

We propose a mathematical framework to explain implicit regularization from early stopping during the training of overparametrized neural networks. In the mean-field limit, the parameter distribution evolves according to a gradient flow on the space of probability measures. We show that these dynamics admit an equivalent McKean-Vlasov stochastic control formulation through the corresponding Hamilton-Jacobi-Bellman (HJB) equation. The control viewpoint yields a Dynamic Programming Principle (DPP), which we use to define a new metric on probability measures. This metric can be viewed as a mean-field generalization of the control representation of the Wasserstein-2 distance, and it naturally appears as a regularization term selected by early stopping. We further obtain non-asymptotic bounds describing how the induced regularization depends on the stopping time.

math.OC

The geometry of the adapted Bures--Wasserstein space

The adapted Bures--Wasserstein space consists of Gaussian processes endowed with the adapted Wasserstein distance. It can be viewed as the analogue of the classical Bures--Wasserstein space in optimal transport for the setting of stochastic processes, where the standard Wasserstein distance is inadequate and has to be replaced by its adapted counterpart. We develop a comprehensive geometric theory for the adapted Bures--Wasserstein space, thereby also providing the first results on the fine geometric structure of adapted optimal transport. In particular, we show that the adapted Bures--Wasserstein space is an Alexandrov space with non-negative curvature and provide explicit descriptions of tangent cones and exponential maps. Moreover, we show that Gaussian processes satisfying a natural non-degeneracy condition form a geodesically convex subspace. This subspace is characterized precisely by the property that its tangent cones are linear and hence coincide with the tangent space.

math.PR

Dynamic reinsurance via martingale transport

We formulate a dynamic reinsurance problem in which the insurer seeks to control the terminal distribution of its surplus while minimizing the L2-norm of the ceded risk. Using techniques from martingale optimal transport, we show that, under suitable assumptions, the problem admits a tractable solution analogous to the Bass martingale. We first consider the case where the insurer wants to match a given terminal distribution of the surplus process, and then relax this condition by only requiring certain moment or risk-based constraints.

q-fin.RM

Estimating causal distances with non-causal ones

The adapted Wasserstein ($AW$) distance refines the classical Wasserstein ($W$) distance by incorporating the temporal structure of stochastic processes. This makes the $AW$-distance well-suited as a robust distance for many dynamic stochastic optimization problems where the classical $W$-distance fails. However, estimating the $AW$-distance is a notably challenging task, compared to the classical $W$-distance. In the present work, we build a sharp estimate for the $AW$-distance in terms of the $W$-distance, for smooth measures. This reduces estimating the $AW$-distance to estimating the $W$-distance, where many well-established classical results can be leveraged. As an application, we prove a fast convergence rate of the kernel-based empirical estimator under the $AW$-distance, which approaches the Monte-Carlo rate ($n^{-1/2}$) in the regime of highly regular densities. These results are accomplished by deriving a sharp bi-Lipschitz estimate of the adapted total variation distance by the classical total variation distance.

math.PR

Entropic adapted Wasserstein distance on Gaussians

The adapted Wasserstein distance is a metric for quantifying distributional uncertainty and assessing the sensitivity of stochastic optimization problems on time series data. A computationally efficient alternative to it, is provided by the entropically regularized adapted Wasserstein distance. Suffering from similar shortcomings as classical optimal transport, there are only few explicitly known solutions to those distances. Recently, Gunasingam--Wong provided a closed-form representation of the adapted Wasserstein distance between real-valued stochastic processes with Gaussian laws. In this paper, we extend their work in two directions, by considering multidimensional ($\mathbb{R}^d$-valued) stochastic processes with Gaussian laws and including the entropic regularization. In both settings, we provide closed-form solutions.

math.OC

Strassen's theorem for biased convex order

Strassen's theorem asserts that for given marginal probabilities $μ,ν$ there exists a martingale starting in $μ$ and terminating in $ν$ if and only if $μ,ν$ are in convex order. From a financial perspective, it guarantees the existence of market-consistent martingale pricing measures for arbitrage-free prices of European call options and thus plays a fundamental role in robust finance. Arbitrage-free prices of American options demand a stronger version of martingales which are 'biased' in a specific sense. In this paper, we derive an extension of Strassen's theorem that links them to an appropriate strengthening of the convex order. Moreover, we provide a characterization of this order through integrals with respect to compensated Poisson processes.

math.PR

Calibration of the Bass Local Volatility model

The Bass local volatility model introduced by Backhoff-Veraguas, Beiglböck, Huesmann, and Källblad is a Markov model perfectly calibrated to vanilla options at finitely many maturities, that approximates the Dupire local volatility model. Conze and Henry-Labordère show that its calibration can be achieved by solving a fixed-point equation. In this paper we complement the analysis and show existence and uniqueness of the solution to this equation, and that the fixed-point iteration scheme converges at a linear rate.

q-fin.MF

Absolutely Continuous Curves of Stochastic Processes

We study absolutely continuous curves in the adapted Wasserstein space of filtered processes. We provide a probabilistic representation of such curves as flows of adapted processes on a common filtered probability space, extending classical results to the adapted setting. Moreover, we characterize geodesics in this space and derive an adapted Benamou--Brenier-type formula by reformulating adapted optimal transport as an energy minimization problem. As an application, we obtain a Skorokhod-type representation for sequences of filtered processes under the adapted weak topology.

math.PR

Multicausal transport: barycenters and dynamic matching

We introduce a multivariate version of causal transport, which we name multicausal transport, involving several filtered processes among which causality constraints are imposed. Subsequently, we consider the barycenter problem for stochastic processes with respect to causal and bicausal optimal transport, and study its connection to specific multicausal transport problems. Attainment and duality of the aforementioned problems are provided. As an application, we study a matching problem in a dynamic setting where agent types evolve over time. We link this to a causal barycenter problem and thereby show existence of equilibria.

math.PR

Time-Causal VAE: Robust Financial Time Series Generator

We build a time-causal variational autoencoder (TC-VAE) for robust generation of financial time series data. Our approach imposes a causality constraint on the encoder and decoder networks, ensuring a causal transport from the real market time series to the fake generated time series. Specifically, we prove that the TC-VAE loss provides an upper bound on the causal Wasserstein distance between market distributions and generated distributions. Consequently, the TC-VAE loss controls the discrepancy between optimal values of various dynamic stochastic optimization problems under real and generated distributions. To further enhance the model's ability to approximate the latent representation of the real market distribution, we integrate a RealNVP prior into the TC-VAE framework. Finally, extensive numerical experiments show that TC-VAE achieves promising results on both synthetic and real market data. This is done by comparing real and generated distributions according to various statistical distances, demonstrating the effectiveness of the generated data for downstream financial optimization tasks, as well as showcasing that the generated data reproduces stylized facts of real financial market data.

cs.LG

Optimal reinsurance from an optimal transport perspective

We use the randomization idea and proof techniques from optimal transport to study optimal reinsurance problems. We start by providing conditions for a class of problems that allow us to characterize the support of optimal treaties, and show how this can be used to deduce the shape of the optimal contract, reducing the task to an optimization problem with finitely many constraints, for which standard techniques can be applied. For a more general class of problems, we regard the optimal reinsurance problem as an iterated optimal transport problem between a (known) initial risk exposure of the insurer and an (unknown) resulting risk exposure of the reinsurer. The proposed approach provides a general framework that encompasses many reinsurance problems, which we illustrate in several concrete examples, providing alternative proofs to classical optimal reinsurance results, as well as establishing new optimality results, some of which contain optimal treaties that involve external randomness.

math.OC

Quantitative Fundamental Theorem of Asset Pricing

In this paper we provide a quantitative analysis to the concept of arbitrage, that allows to deal with model uncertainty without imposing the no-arbitrage condition. In markets that admit ``small arbitrage", we can still make sense of the problems of pricing and hedging. The pricing measures here will be such that asset price processes are close to being martingales, and the hedging strategies will need to cover some additional cost. We show a quantitative version of the Fundamental Theorem of Asset Pricing and of the Super-Replication Theorem. Finally, we study robustness of the amount of arbitrage and existence of respective pricing measures, showing stability of these concepts with respect to a strong adapted Wasserstein distance.

q-fin.MF

Convergence of Adapted Empirical Measures on $\mathbb{R}^{d}$

We consider empirical measures of $\R^{d}$-valued stochastic process in finite discrete-time. We show that the adapted empirical measure introduced in the recent work \cite{backhoff2022estimating} by Backhoff et al. in compact spaces can be defined analogously on $\R^{d}$, and that it converges almost surely to the underlying measure under the adapted Wasserstein distance. Moreover, we quantitatively analyze the convergence of the adapted Wasserstein \add{distance} between those two measures. We establish convergence rates of the expected error as well as the deviation error under different moment conditions. \add{Under suitable integrability and kernel assumptions, we recover the optimal convergence rates of both expected error and deviation error.} Furthermore, we propose a modification of the adapted empirical measure with \add{projection} on a non-uniform grid, which obtains the same convergence rate but under weaker assumptions.

math.PR

Weak Transport for Non-Convex Costs and Model-independence in a Fixed-Income Market

We consider a model-independent pricing problem in a fixed-income market and show that it leads to a weak optimal transport problem as introduced by Gozlan et al. We use this to characterize the extremal models for the pricing of caplets on the spot rate and to establish a first robust super-replication result that is applicable to fixed-income markets. Notably, the weak transport problem exhibits a cost function which is non-convex and thus not covered by the standard assumptions of the theory. In an independent section, we establish that weak transport problems for general costs can be reduced to equivalent problems that do satisfy the convexity assumption, extending the scope of weak transport theory. This part could be of its own interest independent of our financial application, and is accessible to readers who are not familiar with mathematical finance notations.

math.PR

Characterization of transport optimizers via graphs and applications to Stackelberg-Cournot-Nash equilibria

We introduce graphs associated to transport problems between discrete marginals, that allow to characterize the set of all optimizers given one primal optimizer. In particular, we establish that connectivity of those graphs is a necessary and sufficient condition for uniqueness of the dual optimizers. Moreover, we provide an algorithm that can efficiently compute the dual optimizer that is the limit, as the regularization parameter goes to zero, of the dual entropic optimizers. Our results find an application in a Stackelberg-Cournot-Nash game, for which we obtain existence and characterization of the equilibria.

math.OC