SearcharxivSearch

arXiv subjects

Pierre Henry-Labordere

Publications and source records attributed to Pierre Henry-Labordere.

At least 19 recordsLinked to original sources

Bridging Schr\"odinger and Bass: A Semimartingale Optimal Transport Problem with Diffusion Control

We study a semimartingale optimal transport problem interpolating between the Schr\"odinger bridge and the stretched Brownian motion associated with the Bass solution of the Skorokhod embedding problem. The cost combines an entropy term on the drift with a quadratic penalization of the diffusion coefficient, leading to a stochastic control problem over drift and volatility. We establish a complete duality theory for this problem, despite the lack of coercivity in the diffusion component. In particular, we prove strong duality and dual attainment, and derive an equivalent reduced dual formulation in terms of a variational problem over terminal potentials. Optimal solutions are characterized by a coupled Schr\"odinger-Bass bridge system, involving a backward heat potential and a transport map given by the gradient of a $\beta$-convex function. This system interpolates between the classical Schr\"odinger system and the Bass martingale transport. Our results furnish a unified framework encompassing entropic and martingale optimal transport, and yield a variational foundation for data-driven diffusion models.

math.PR

Building arbitrage-free implied volatility: Sinkhorn's algorithm and variants

We consider the classical problem of building an arbitrage-free implied volatility surface from bid-ask quotes. We design a fast numerical procedure, for which we prove the convergence, based on the Sinkhorn algorithm that has been recently used to solve efficiently (martingale) optimal transport problems.

q-fin.CP

Pricing Bermudan options using regression trees/random forests

The value of an American option is the maximized value of the discounted cash flows from the option. At each time step, one needs to compare the immediate exercise value with the continuation value and decide to exercise as soon as the exercise value is strictly greater than the continuation value. We can formulate this problem as a dynamic programming equation, where the main difficulty comes from the computation of the conditional expectations representing the continuation values at each time step. In (Longstaff and Schwartz, 2001), these conditional expectations were estimated using regressions on a finite-dimensional vector space (typically a polynomial basis). In this paper, we follow the same algorithm; only the conditional expectations are estimated using Regression trees or Random forests. We discuss the convergence of the LS algorithm when the standard least squares regression is replaced with regression trees. Finally, we expose some numerical results with regression trees and random forests. The random forest algorithm gives excellent results in high dimensions.

q-fin.CP

Generative modeling for time series via Schr{ö}dinger bridge

We propose a novel generative model for time series based on Schr{ö}dinger bridge (SB) approach. This consists in the entropic interpolation via optimal transport between a reference probability measure on path space and a target measure consistent with the joint data distribution of the time series. The solution is characterized by a stochastic differential equation on finite horizon with a path-dependent drift function, hence respecting the temporal dynamics of the time series distribution. We can estimate the drift function from data samples either by kernel regression methods or with LSTM neural networks, and the simulation of the SB diffusion yields new synthetic data samples of the time series. The performance of our generative model is evaluated through a series of numerical experiments. First, we test with a toy autoregressive model, a GARCH Model, and the example of fractional Brownian motion, and measure the accuracy of our algorithm with marginal and temporal dependencies metrics. Next, we use our SB generated synthetic samples for the application to deep hedging on real-data sets. Finally, we illustrate the SB approach for generating sequence of images.

math.OC

Policy gradient learning methods for stochastic control with exit time and applications to share repurchase pricing

We develop policy gradients methods for stochastic control with exit time in a model-free setting. We propose two types of algorithms for learning either directly the optimal policy or by learning alternately the value function (critic) and the optimal control (actor). The use of randomized policies is crucial for overcoming notably the issue related to the exit time in the gradient computation. We demonstrate the effectiveness of our approach by implementing our numerical schemes in the application to the problem of share repurchase pricing. Our results show that the proposed policy gradient methods outperform PDE or other neural networks techniques in a model-based setting. Furthermore, our algorithms are flexible enough to incorporate realistic market conditions like e.g. price impact or transaction costs.

q-fin.CP

From (Martingale) Schrodinger bridges to a new class of Stochastic Volatility Models

Following closely the construction of the Schrodinger bridge, we build a new class of Stochastic Volatility Models exactly calibrated to market instruments such as for example Vanillas, options on realized variance or VIX options. These models differ strongly from the well-known local stochastic volatility models, in particular the instantaneous volatility-of-volatility of the associated naked SVMs is not modified, once calibrated to market instruments. They can be interpreted as a martingale version of the Schrodinger bridge. The numerical calibration is performed using a dynamic-like version of the Sinkhorn algorithm. We finally highlight a striking relation with Dyson non-colliding Brownian motions.

q-fin.CP

Branching diffusion representation for nonlinear Cauchyproblems and Monte Carlo approximation

We provide a probabilistic representations of the solution of some semilinear hyperbolicand high-order PDEs based on branching diffusions. These representations pave theway for a Monte-Carlo approximation of the solution, thus bypassing the curse ofdimensionality. We illustrate the numerical implications in the context of some popularPDEs in physics such as nonlinear Klein-Gordon equation, a simplied scalar versionof the Yang-Mills equation, a fourth-order nonlinear beam equation and the Gross-Pitaevskii PDEas an example of nonlinear Schrodinger equations.

math.PR

Some Results on Skorokhod Embedding and Robust Hedging with Local Time

In this paper, we provide some results on Skorokhod embedding with local time and its applications to the robust hedging problem in finance. First we investigate the robust hedging of options depending on the local time by using the recently introduced stochastic control approach, in order to identify the optimal hedging strategies, as well as the market models that realize the extremal no-arbitrage prices. As a by-product, the optimality of Vallois' Skorokhod embeddings is recovered. In addition, under appropriate conditions, we derive a new solution to the two-marginal Skorokhod embedding as a generalization of the Vallois solution. It turns out from our analysis that one needs to relax the monotonicity assumption on the embedding functions in order to embed a larger class of marginal distributions. Finally, in a full-marginal setting where the stopping times given by Vallois are well-ordered, we construct a remarkable Markov martingale which provides a new example of fake Brownian motion.

math.PR

Monotone Martingale Transport Plans and Skorohod Embedding

We show that the left-monotone martingale coupling is optimal for any given performance function satisfying the martingale version of the Spence-Mirrlees condition, without assuming additional structural conditions on the marginals. We also give a new interpretation of the left monotone coupling in terms of Skorokhod embedding which allows us to give a short proof of uniqueness.

math.PR

Branching diffusion representation of semilinear PDEs and Monte Carlo approximation

We provide a representation result of parabolic semi-linear PD-Es, with polynomial nonlinearity, by branching diffusion processes. We extend the classical representation for KPP equations, introduced by Skorokhod (1964), Watanabe (1965) and McKean (1975), by allowing for polynomial nonlinearity in the pair $(u, Du)$, where $u$ is the solution of the PDE with space gradient $Du$. Similar to the previous literature, our result requires a non-explosion condition which restrict to "small maturity" or "small nonlinearity" of the PDE. Our main ingredient is the automatic differentiation technique as in Henry Labordere, Tan and Touzi (2015), based on the Malliavin integration by parts, which allows to account for the nonlinearities in the gradient. As a consequence, the particles of our branching diffusion are marked by the nature of the nonlinearity. This new representation has very important numerical implications as it is suitable for Monte Carlo simulation. Indeed, this provides the first numerical method for high dimensional nonlinear PDEs with error estimate induced by the dimension-free Central limit theorem. The complexity is also easily seen to be of the order of the squared dimension. The final section of this paper illustrates the efficiency of the algorithm by some high dimensional numerical experiments.

math.PR

Unbiased simulation of stochastic differential equations

We propose an unbiased Monte-Carlo estimator for $\mathbb{E}[g(X_{t_1}, \cdots, X_{t_n})]$, where $X$ is a diffusion process defined by a multi-dimensional stochastic differential equation (SDE). The main idea is to start instead from a well-chosen simulatable SDE whose coefficients are updated at independent exponential times. Such a simulatable process can be viewed as a regime-switching SDE, or as a branching diffusion process with one single living particle at all times. In order to compensate for the change of the coefficients of the SDE, our main representation result relies on the automatic differentiation technique induced by Bismu-Elworthy-Li formula from Malliavin calculus, as exploited by Fourni\'e et al.(1999) for the simulation of the Greeks in financial applications. In particular, this algorithm can be considered as a variation of the (infinite variance) estimator obtained in Bally and Kohatsu-Higa [Section 6.1](2014) as an application of the parametrix method.

math.PR

An Explicit Martingale Version of Brenier's Theorem

By investigating model-independent bounds for exotic options in financial mathematics, a martingale version of the Monge-Kantorovich mass transport problem was introduced in \cite{BeiglbockHenry LaborderePenkner,GalichonHenry-LabordereTouzi}. In this paper, we extend the one-dimensional Brenier's theorem to the present martingale version. We provide the explicit martingale optimal transference plans for a remarkable class of coupling functions corresponding to the lower and upper bounds. These explicit extremal probability measures coincide with the unique left and right monotone martingale transference plans, which were introduced in \cite{BeiglbockJuillet} by suitable adaptation of the notion of cyclic monotonicity. Instead, our approach relies heavily on the (weak) duality result stated in \cite{BeiglbockHenry-LaborderePenkner}, and provides, as a by-product, an explicit expression for the corresponding optimal semi-static hedging strategies. We finally provide an extension to the multiple marginals case.

q-fin.CP

A numerical algorithm for a class of BSDEs via branching process

We generalize the algorithm for semi-linear parabolic PDEs in Henry-Labord\`ere (2012) to the non-Markovian case for a class of Backward SDEs (BSDEs). By simulating the branching process, the algorithm does not need any backward regression. To prove that the numerical algorithm converges to the solution of BSDEs, we use the notion of viscosity solution of path dependent PDEs introduced by Ekren, Keller, Touzi and Zhang (2012) and extended in Ekren, Touzi and Zhang (2013).

math.NA

Counterparty Risk Valuation: A Marked Branching Diffusion Approach

The purpose of this paper is to design an algorithm for the computation of the counterparty risk which is competitive in regards of a brute force "Monte-Carlo of Monte-Carlo" method (with nested simulations). This is achieved using marked branching diffusions describing a Galton-Watson random tree. Such an algorithm leads at the same time to a computation of the (bilateral) counterparty risk when we use the default-risky or counterparty-riskless option values as mark-to-market. Our method is illustrated by various numerical examples.

q-fin.CP

Unifying the BGM and SABR Models: A short Ride in Hyperbolic Geometry

In this short note, using our geometric method introduced in a previous paper \cite{phl} and initiated by \cite{ave}, we derive an asymptotic swaption implied volatility at the first-order for a general stochastic volatility Libor Market Model. This formula is useful to quickly calibrate a model to a full swaption matrix. We apply this formula to a specific model where the forward rates are assumed to follow a multi-dimensional CEV process correlated to a SABR process. For a caplet, this model degenerates to the classical SABR model and our asymptotic swaption implied volatility reduces naturally to the Hagan-al formula \cite{sab}. The geometry underlying this model is the hyperbolic manifold $\HH^{n+1}$ with $n$ the number of Libor forward rates.

physics.soc-ph

Solvable Local and Stochastic Volatility Models: Supersymmetric Methods in Option Pricing

In this paper we provide an extensive classification of one and two dimensional diffusion processes which admit an exact solution to the Kolmogorov (and hence Black-Scholes) equation (in terms of hypergeometric functions). By identifying the one-dimensional solvable processes with the class of integrable superpotentials introduced recently in supersymmetric quantum mechanics, we obtain new analytical solutions. For two-dimensional processes, more precisely stochastic volatility models, the classification is achieved for a specific class called gauge-free models including the Heston model, the 3/2-model and the geometric Brownian model.

cond-mat.other

A General Asymptotic Implied Volatility for Stochastic Volatility Models

In this paper, we derive a general asymptotic implied volatility at the first-order for any stochastic volatility model using the heat kernel expansion on a Riemann manifold endowed with an Abelian connection. This formula is particularly useful for the calibration procedure. As an application, we obtain an asymptotic smile for a SABR model with a mean-reversion term, called lambda-SABR, corresponding in our geometric framework to the Poincaré hyperbolic plane. When the lambda-SABR model degenerates into the SABR-model, we show that our asymptotic implied volatility is a better approximation than the classical Hagan-al expression . Furthermore, in order to show the strength of this geometric framework, we give an exact solution of the SABR model with beta=0 or 1. In a next paper, we will show how our method can be applied in other contexts such as the derivation of an asymptotic implied volatility for a Libor market model with a stochastic volatility.

cond-mat.other