Searcharxiv⌕ Search

arXiv subjects

Jean-François Chassagneux

Publications and source records attributed to Jean-François Chassagneux.

At least 19 recordsLinked to original sources

Stochastic Policy Gradient Methods in the Uncertain Volatility Model

The multidimensional Uncertain Volatility Model leads to robust option pricing problems under joint volatility and correlation uncertainty. Their numerical resolution quickly becomes challenging because the associated stochastic control problem is high-dimensional. We propose a backward actor-critic stochastic policy-gradient scheme tailored to this setting. The method combines a discrete dynamic programming principle with Proximal Policy Optimization and one-hidden-layer neural-network approximations of both the value function and the control policy. A key ingredient is the policy parameterization: continuous controls are represented through a squashed Gaussian policy built on a $C$-vine representation of correlation matrices, which enforces positive definiteness by construction. Beyond the robust price itself, the spatial gradient of the trained critic provides an approximation of the associated superhedging strategy. We assess the quality of this learned gradient through a dual formulation, which also yields a numerical dual estimate of the price. Numerical experiments on a range of multidimensional derivatives show that the method yields accurate prices, remains computationally efficient, and compares favorably with existing Monte Carlo and machine-learning-based benchmarks for robust pricing in the Uncertain Volatility Model.

q-fin.CP↗

Neural feedback approximation for stochastic control with degenerate diffusions: error estimates and numerical analysis

We study finite-horizon stochastic optimal control problems and approximate the resulting time-discrete formulation by a direct policy-learning problem over neural-network feedback maps. We prove a quantitative convergence estimate, in an averaged sense, for the error between the time-discrete value and the value induced by an approximately optimized neural policy. The bound separates the approximation of near-optimal feedback policies, the localization of stochastic trajectories on compact sets, and the optimization tolerance in training. The analysis does not require transition-density assumptions and covers possibly degenerate diffusions and deterministic controlled dynamics in a unified framework. Numerical experiments are provided for a degenerate stochastic radial target problem, a Hamilton--Jacobi--Bellman benchmark, and a gas storage problem, illustrating the approach and separating the main error sources: time discretization, restriction to piecewise-constant policies, neural-network approximation, and Monte Carlo evaluation.

math.OC↗

Martingales On A Euclidean Manifold With A Boundary And Reflected BSDES In Non-Convex Domains

The purpose of this paper is twofold. First, we introduce the notion of a $Γ$-martingale on a Euclidean manifold with a boundary (i.e., the closure of an open connected domain in R d ), we provide its equivalent characterization through the $Γ$-convex functions, and we establish its connection with the reflected backward stochastic differential equations (BSDEs) in the associated domain. Second, we show how the tools of stochastic geometry can be used to develop a new method for proving existence and uniqueness of solutions to reflected BSDEs. We implement this method and obtain a well-posedness result for reflected BSDEs in any bounded, two-dimensional, simply-connected domain that is locally C2 -diffeomorphic to a convex set. This work extends the results of [6] and [16].

math.PR↗

An optimal transport approach for the multiple quantile hedging problem

We consider the multiple quantile hedging problem, which is a class of partial hedging problems containing as special examples the quantile hedging problem (F{ö}llmer \& Leukert 1999) and the PnL matching problem (introduced in Bouchard \& Vu 2012). In complete non-linear markets, we show that the problem can be reformulated as a kind of Monge optimal transport problem. Using this observation, we introduce a Kantorovitch version of the problem and prove that the value of both problems coincide. In the linear case, we thus obtain that the multiple quantile hedging problem can be seen as a semi-discrete optimal transport problem, for which we further introduce the dual problem. We then prove that there is no duality gap, allowing us to design a numerical method based on SGA algorithms to compute the multiple quantile hedging price.

math.PR↗

Propagation of a carbon price in a credit portfolio through macroeconomic factors

We study how the climate transition through a low-carbon economy, implemented by carbon pricing, propagates in a credit portfolio and precisely describe how carbon price dynamics affects credit risk measures such as probability of default, expected and unexpected losses. We adapt a stochastic multisectoral model to take into account the greenhouse gases (GHG) emissions costs of both sectoral firms' production and consumption, as well as sectoral household's consumption. GHG emissions costs are the product of carbon prices, provided by the NGFS transition scenarios, and of GHG emissions. For each sector, our model yields the sensitivity of firms' production and households' consumption to carbon price and the relationships between sectors. It allows us to analyze the short-term effects of the carbon price as opposed to standard IAM (such as REMIND), which are deterministic and only capture long-term trends. Finally, we use a DCF methodology to compute firms' values which we then combine with a structural credit risk model to describe how the carbon price impacts credit risk measures. We obtain that the carbon price distorts the distribution of the firm's value, increases banking fees charged to clients (materialized by the bank provisions), and reduces banks' profitability (translated by the economic capital). In addition, the randomness we introduce provides extra flexibility to take into account uncertainties on the productivity and on the different transition scenarios. We also compute the sensitivities of the credit risk measures with respect to changes in the carbon price, yielding further criteria for a more accurate assessment of climate transition risk in a credit portfolio. This work provides a preliminary methodology to calculate the evolution of credit risk measures of a credit portfolio, starting from a given climate transition scenario described by a carbon price.

q-fin.RM↗

Deep Runge-Kutta schemes for BSDEs

We propose a new probabilistic scheme which combines deep learning techniques with high order schemes for backward stochastic differential equations belonging to the class of Runge-Kutta methods to solve high-dimensional semi-linear parabolic partial differential equations. Our approach notably extends the one introduced in [Hure Pham Warin 2020] for the implicit Euler scheme to schemes which are more efficient in terms of discrete-time error. We establish some convergence results for our implemented schemes under classical regularity assumptions. We also illustrate the efficiency of our method for different schemes of order one, two and three. Our numerical results indicate that the Crank-Nicolson schemes is a good compromise in terms of precision, computational cost and numerical implementation.

math.NA↗

Convergence of particles and tree based scheme for singular FBSDEs

We study an implementation of the theoretical splitting scheme introduced in [Chassagneux and Yang, 2022] for singular FBSDEs [Carmona and Delarue 2013] and their associated quasi-linear degenerate PDEs. The fully implementable algorithm is based on particles approximation of the transport operator and tree like approximation of the diffusion operator appearing in the theoretical splitting. We prove the convergence with a rate of our numerical method under some reasonable conditions on the coefficients functions. This validates a posteriori some numerical results obtained in [Chassagneux and Yang, 2022]. We conclude the paper with a numerical section presenting various implementations of the algorithm and discussing their efficiency in practice.

math.NA↗

Numerical approximation of singular Forward-Backward SDEs

In this work, we study the numerical approximation of a class of singular fully coupled forward backward stochastic differential equations. These equations have a degenerate forward component and non-smooth terminal condition. They are used, for example, in the modeling of carbon market[9] and are linked to scalar conservation law perturbed by a diffusion. Classical FBSDEs methods fail to capture the correct entropy solution to the associated quasi-linear PDE. We introduce a splitting approach that circumvent this difficulty by treating differently the numerical approximation of the diffusion part and the non-linear transport part. Under the structural condition guaranteeing the well-posedness of the singular FBSDEs [8], we show that the splitting method is convergent with a rate $1/2$. We implement the splitting scheme combining non-linear regression based on deep neural networks and conservative finite difference schemes. The numerical tests show very good results in possibly high dimensional framework.

math.NA↗

A learning scheme by sparse grids and Picard approximations for semilinear parabolic PDEs

Relying on the classical connection between Backward Stochastic Differential Equations (BSDEs) and non-linear parabolic partial differential equations (PDEs), we propose a new probabilistic learning scheme for solving high-dimensional semi-linear parabolic PDEs. This scheme is inspired by the approach coming from machine learning and developed using deep neural networks in Han and al. [32]. Our algorithm is based on a Picard iteration scheme in which a sequence of linear-quadratic optimisation problem is solved by means of stochastic gradient descent (SGD) algorithm. In the framework of a linear specification of the approximation space, we manage to prove a convergence result for our scheme, under some smallness condition. In practice, in order to be able to treat high-dimensional examples, we employ sparse grid approximation spaces. In the case of periodic coefficients and using pre-wavelet basis functions, we obtain an upper bound on the global complexity of our method. It shows in particular that the curse of dimensionality is tamed in the sense that in order to achieve a root mean squared error of order $ε$, for a prescribed precision $ε$, the complexity of the Picard algorithm grows polynomially in $ε^{-1}$ up to some logarithmic factor $ |log(ε)| $ which grows linearly with respect to the PDE dimension. Various numerical results are presented to validate the performance of our method and to compare them with some recent machine learning schemes proposed in Han and al. [20] and Huré and al. [37].

math.NA↗

Reflected BSDEs in non-convex domains

This paper establishes the well-posedness of reflected backward stochastic differential equations in the non-convex domains that satisfy a weaker version of the star-shaped property. The main results are established (i) in a Markovian framework with Hölder-continuous generator and terminal condition and (ii) in a general setting under a smallness assumption on the input data. We also investigate the connections between this well-posedness result and the theory of martingales on manifolds.

math.PR↗

Switching problems with controlled randomisation and associated obliquely reflected BSDEs

We introduce and study a new class of optimal switching problems, namely switching problem with controlled randomisation, where some extra-randomness impacts the choice of switching modes and associated costs. We show that the optimal value of the switching problem is related to a new class of multidimensional obliquely reflected BSDEs. These BSDEs allow as well to construct an optimal strategy and thus to solve completely the initial problem. The other main contribution of our work is to prove new existence and uniqueness results for these obliquely reflected BSDEs. This is achieved by a careful study of the domain of reflection and the construction of an appropriate oblique reflection operator in order to invoke results from [7].

math.PR↗

A numerical scheme for the quantile hedging problem

We consider the numerical approximation of the quantile hedging price in a non-linear market. In a Markovian framework, we propose a numerical method based on a Piecewise Constant Policy Timestepping (PCPT) scheme coupled with a monotone finite difference approximation. We prove the convergence of our algorithm combining BSDE arguments with the Barles & Jakobsen and Barles & Souganidis approaches for non-linear equations. In a numerical section, we illustrate the efficiency of our scheme by considering a financial example in a market with imperfections.

q-fin.CP↗

Cubature methods to solve BSDEs: Error expansion and complexity control

We obtain an explicit error expansion for the solution of Backward Stochastic Differential Equations (BSDEs) using the cubature on Wiener spaces method. The result is proved under a mild strengthening of the assumptions needed for the application of the cubature method. The explicit expansion can then be used to construct implementable higher order approximations via Richardson-Romberg extrapolation. To allow for an effective efficiency improvement of the interpolated algorithm, we introduce an additional projection on finite grids through interpolation operators. We study the resulting complexity reduction in the case of the linear interpolation.

math.PR↗

Weak quantitative propagation of chaos via differential calculus on the space of measures

Consider the metric space $(\mathcal{P}_2(\mathbb{R}^d),W_2)$ of square integrable laws on $\mathbb{R}^d$ with the topology induced by the 2-Wasserstein distance $W_2$. Let $Φ: \mathcal{P}_2( \mathbb{R}^d) \to \mathbb{R}$ be a function and $μ_N$ be the empirical measure of a sample of $N$ random variables distributed as $μ$. The main result of this paper is to show that under suitable regularity conditions, we have \[ |Φ(μ) - \mathbb{E}Φ(μ_N)|= \sum_{j=1}^{k-1}\frac{C_j}{N^j} + O(\frac{1}{N^k}), \] for some positive constants $C_1, \ldots, C_{k-1}$ that do not depend on $N$, where $k$ corresponds to the degree of smoothness. We distinguish two cases: a) $μ_N$ is the empirical measure of $N$-samples from $μ$; b) $μ$ is a marginal law of McKean-Vlasov stochastic differential equation in which case $μ_N$ is an empirical law of marginal laws of the corresponding particle system. The first case is studied using functional derivatives on the space of measures. The second case relies on an Itô-type formula for the flow of probability measures and is intimately connected to PDEs on the space of measures, called the master equation in the literature of mean-field games. We state the general regularity conditions required for each case and analyse the regularity in the case of functionals of the laws of McKean-Vlasov SDEs. Ultimately, this work reveals quantitative estimates of propagation of chaos for interacting particle systems. Furthermore, we are able to provide weak propagation of chaos estimates for ensembles of interacting particles and show that these may have some remarkable properties.

math.PR↗

A sparse grid approach to balance sheet risk measurement

In this work, we present a numerical method based on a sparse grid approximation to compute the loss distribution of the balance sheet of a financial or an insurance company. We first describe, in a stylised way, the assets and liabilities dynamics that are used for the numerical estimation of the balance sheet distribution. For the pricing and hedging model, we chose a classical Black & Scholes model with a stochastic interest rate following a Hull & White model. The risk management model describing the evolution of the parameters of the pricing and hedging model is a Gaussian model. The new numerical method is compared with the traditional nested simulation approach. We review the convergence of both methods to estimate the risk indicators under consideration. Finally, we provide numerical results showing that the sparse grid approach is extremely competitive for models with moderate dimension.

q-fin.RM↗

Numerical Probabilistic Approach to MFG

This project investigates numerical methods for solving fully coupled forward-backward stochastic differential equations (FBSDEs) of McKean-Vlasov type. Having numerical solvers for such mean field FBSDEs is of interest because of the potential application of these equations to optimization problems over a large population, say for instance mean field games (MFG) and optimal mean field control problems. Theory for this kind of problems has met with great success since the early works on mean field games by Lasry and Lions, see \cite{Lasry_Lions}, and by Huang, Caines, and Malhamé, see \cite{Huang}. Generally speaking, the purpose is to understand the continuum limit of optimizers or of equilibria (say in Nash sense) as the number of underlying players tends to infinity. When approached from the probabilistic viewpoint, solutions to these control problems (or games) can be described by coupled mean field FBSDEs, meaning that the coefficients depend upon the own marginal laws of the solution. In this note, we detail two methods for solving such FBSDEs which we implement and apply to five benchmark problems. The first method uses a tree structure to represent the pathwise laws of the solution, whereas the second method uses a grid discretization to represent the time marginal laws of the solutions. Both are based on a Picard scheme; importantly, we combine each of them with a generic continuation method that permits to extend the time horizon (or equivalently the coupling strength between the two equations) for which the Picard iteration converges.

math.PR↗

Obliquely Reflected BSDEs

In this paper, we study existence and uniqueness to multidimensional Reflected Backward Stochastic Differential Equation in an open convex domain, allowing for oblique directions of reflection. In a Markovian framework, combining \emph{a priori} estimates for penalised equations and compactness arguments, we obtain existence results under quite weak assumptions on the driver of the BSDEs and the direction of reflection, which is allowed to depend on both $Y$ and $Z$. In a non Markovian framework, we obtain existence and uniqueness result for direction of reflection depending on time and $Y$. We make use in this case of stability estimates that require some smoothness condition on the domain and the direction of reflection. In a last Section, we illustrate the application of our theoretical results by introducing randomised switching problems.

math.PR↗