Talks by Session and Room (with Abstracts)

Tuesday 9.50-10.40

Expand All

Dynamic universal approximation and optimal control for path-dependent systems via signature SDEs

Christa Cuchiero (University of Vienna)

Many applications in generative time series modeling, particularly in finance, require stochastic dynamics that are genuinely path-dependent and non-Markovian. From a numerical perspective, the most natural route is to lift path dependence to an enlarged state space, thereby obtaining a Markovian approximation of the original dynamics. Among such lifts, signature SDEs provide a canonical and model-agnostic choice, building on the strong algebraic and approximation-theoretic properties of path signatures, which form a universal and non-parametric feature set for paths. We explain how this leads to dynamic universal approximation results for generic non-Markovian SDEs. We also show how the resulting finite-dimensional signature SDEs can be used in optimal control problems with path-dependent dynamics and objectives, reducing, for instance, the infinite-dimensional Hamilton-Jacobi-Bellman PDE to a computationally much simpler Riccati ODE.

Tuesday 11.20-13.00

Expand All

Organisers: Xinyu Li; Yufei Zhang
 

Data-driven hedging with generative models

Rama Cont (University of Oxford) · Milena Vuletić  (University of Oxford)

We propose a nonparametric data-driven methodology for hedging using generative models. In contrast with model-based hedging approaches relying on sensitivity analysis of model pricing functions, our approach uses a conditional generative model trained on market data to simulate realistic market scenarios given current market conditions and computes hedge ratios which minimize risk across these scenarios. The approach incorporates transaction costs, leads to an optimal selection of hedging instruments, and adapts to market conditions. We illustrate the effectiveness of this methodology for hedging option portfolios using VolGAN, a generative model for implied volatility surfaces. The out-of-sample performance of the method matches and improves over delta and delta-vega hedging, without retraining the model for more than 4 years after the training period.


Equilibrium-Based Ranking via Quantilized Mean-Field Games

Dena Firoozi (University of Toronto) · Rinel Foguen Tchuendom (Bettermore Labs) · Michèle Breton (HEC Montréal)

Quantilized mean-field game models involve quantiles of the population's distribution. We study a class of such games with a capacity for ranking games, where the performance of each agent is evaluated based on its terminal state relative to the population's -quantile value, . This evaluation criterion is designed to select the top performing agents. We then propose an application to early-stage venture investments, where a venture capital firm supports a group of startups competing over a finite horizon, aiming to identify and fund the top-performing fraction at the end of the period.


Learning Distributed Equilibria in Linear-Quadratic Stochastic Differential Games: An alpha-Potential Approach

Philipp Plank (Imperial College London) · Yufei Zhang (Imperial College London)

This talk analyzes independent policy-gradient learning in N-player linear-quadratic stochastic differential games. Each player employs a distributed policy that depends only on its own state and updates its policy independently by following the gradient of its own objective. We show that the game admits an alpha-potential structure, where alpha is determined by the degree of pairwise interaction asymmetry. We further establish global linear convergence of these methods to an approximate equilibrium, with suboptimality proportional to the degree of asymmetry. We also construct an affine distributed equilibrium beyond the mean field setting for both symmetric and asymmetric interactions.


Time travel: reinforcement learning for market making with consistent historical data

Damien Challet (Université Paris-Saclay, CentraleSupélec) · Vincent Ragel (Université Paris-Saclay, CentraleSupélec) · Salma Elomari (Université Paris-Saclay, CentraleSupélec)

Reinforcement learning works best when the impact of the agent's actions on its environment can be perfectly simulated or fully appraised from available data. Some systems are however both hard to simulate and very sensitive to small perturbations. An additional difficulty arises when a RL agent is trained offline to be part of a multi-agent system using only anonymous data, which makes it impossible to infer the state of each agent, thus to use data directly. We introduce consistent data time travel for offline R: instead of using historical data in a sequential way, we adjust the time index so that both the past state and the influence of the RL agent's action on the system coincide with real data. Training a market maker RL agent, show that training with time travel yields significantly higher gains than sequential data.

Full calibration, fast simulation, and exotic options pricing under the Ornstein-Uhlenbeck driven stochastic volatility model

Carlo Sgarra (University of Bari) · Riccardo Brignone (University of Pavia)

We propose efficient methodologies for calibrating the Ornstein-Uhlenbeck-driven stochastic volatility (OUSV) model and for pricing frequently monitored exotic options. First, we provide a new representation of the characteristic function of log-returns which (i) avoids discontinuities caused by branch switchings of complex functions; and (ii) is easy to differentiate with respect to the model parameters.

We propose then a fast, full calibration algorithm that exploits the analytical gradient to speed up computations. Second, we develop a low-bias simulation scheme that is fast and accurate. Third, we derive the characteristic function of integrated logarithmic returns and propose an efficient method for pricing geometric Asian options that are monitored continuously or discretely, based on the Fourier-cosine method. Finally, we address the issue of efficiently pricing exotic options using Monte Carlo simulation.


A Simulation Scheme for Martingale Diffusions with Explicit Marginals

Michele Azzone (Politecnico di Milano) · Lorenzo Torricelli (University of Bologna) · Marco Vitelli (University of Bologna)

We propose the Shifted Euler scheme to simulate local volatility models with short-time explosions, such as the Generalized Beta Local Volatility (GBLV) model. This framework features explicit marginal distributions compatible with a purely discontinuous martingale. Standard Euler schemes fail here due to the diffusion coefficient singularity at t=0. Our hybrid approach bypasses this by leveraging the explicit law for the first increment. We also detail strategies to accelerate local volatility evaluation, the primary numerical bottleneck. Experiments confirm superior efficiency and accuracy compared to standard techniques.


Calibration of stochastic volatility models: no-arbitrage constraints on the price or the volatility and initial guess

Lorenzo Lombardi (Università degli Studi di Salerno) · Rosaria Cerrone (Università degli Studi di Salerno) · Guido Germano (University College London)

With numerical tests on the calibration of the Heston and the double Heston models on an EURUSD implied volatility surface, we study the effect of including redundant static no-arbitrage constraints on call and put prices or on the volatility. We find that they provide a useful check at a negligible or negative computational cost because they reduce the number of iterations leading to the same minimum. Speed and accuracy are similar when calibrating on the option price divided by vega or on the implied volatility. Fits of the at-the-money variance, skew and curvature provide a good initial guess for a local solver, but require specific expressions for each model; an exploration of the parameter search region with random points is simpler and almost as effective. We discuss implementation details (regularisation, optimisation algorithm, solver configuration, parameter search bounds, etc.) and provide open-access code.


Fourier-Malliavin Volatility Estimation: Application to Early Warning Systems

Simona Sanfelici (Università di Parma) · Erindi Allaj (University of Parma)

The Fourier volatility estimation method, introduced by Malliavin and Mancino in 2002, has since stimulated a growing body of scientific literature. Numerous papers have explored both its theoretical foundations and practical applications, published across diverse fields including mathematical finance, high-frequency econometrics and econophysics.

Owing to its ability to reconstruct volatility as a stochastic function of time in both univariate and multivariate settings, the methodology offers deep insights into a range of volatility-related financial quantities. These include volatility of volatility, leverage effects, and other second-order effects such as price-volatility feedback rate.

The latter is supposed to describe the ease of the market in absorbing small price perturbations and can be used as an Early Warning Indicator (EWI) for detecting financial instability. Our study reveals that, while realized volatility is important in predicting future price losses in a given time series, the EWI employing the price-volatility feedback rate can improve prediction further.

Organisers: Chiheb Ben Hammouda; Kees Oosterlee

 

Quasi-Monte Carlo with Domain Transformation for Efficient Fourier Pricing of Multi-Asset Options

Michael Samet (RWTH Aachen University) · Christian Bayer (Weierstrass Institute) · Chiheb Ben Hammouda (Utrecht University) · Antonis Papapantoleon (TU Delft) · Raul Tempone (King Abdullah University of Science and Technology)

Efficient multi-asset option pricing remains a computationally challenging problem in quantitative finance. We propose a randomized quasi-Monte Carlo (RQMC) quadrature method for Fourier pricing that exploits the analyticity of the integrand in the Fourier domain while providing practical statistical error estimates. Since RQMC points are by design constructed on the unit hypercube, evaluating integrals over unbounded domains requires an appropriate domain transformation. We develop model-specific transformation maps based on boundary growth conditions for the transformed integrand, preventing boundary singularities that can otherwise deteriorate RQMC convergence. These maps are designed to preserve the decay structure of the Fourier integrand and can be applied to models with both independent and dependent asset dynamics. Numerical experiments across several pricing models, payoff structures, and dimensions demonstrate substantial efficiency gains over tensor-product quadrature in the Fourier domain and Monte Carlo in the physical domain, with examples covering options depending on up to 15 underlying assets.


Single- and Multi-Level Fourier-RQMC Methods for Multivariate Shortfall Risk

Truong Nguyen (Utrecht University) · Chiheb Ben Hammouda (Utrecht University)

Multivariate shortfall risk measures provide systemic-risk-aware capital allocations before aggregation, but existing Monte Carlo estimators are computationally expensive. We introduce single- and multilevel numerical algorithms for estimating multivariate shortfall risk and the associated optimal allocations, combining Fourier inversion with randomized quasi--Monte Carlo (RQMC) sampling and leveraging the geometric convergence of the deterministic optimizer. We develop a rigorous mathematical framework for the Fourier--RQMC estimators, including convergence analysis and complexity bounds. Numerical experiments demonstrate that the proposed methods outperform sample average approximation (SAA) and stochastic approximation (SA) in terms of accuracy and computational cost across a range of risk-factor and loss models.


Extending the COS Method for Credit Risk: Generalized Portfolio Modeling and the COS--Stein Approach

Giuseppe Bonavolonta (EIB) · Gijs Mast (Delft University of Technology) · Alper Hekimoglu (EIB) · Fang Fang (Delft University of Technology)

We extend the Fourier--cosine (COS) method for credit risk measurement and allocation under factor--copula models in two directions. First, we generalize the framework to practically relevant instruments, including CDO tranches, guaranteed loans, amortizing loans, and heterogeneous portfolios, and compute VaR, ES, and CES for large-scale portfolios. Second, we introduce the COS--Stein method, which combines the COS framework with a Stein-type approximation based on a first-order Gram--Charlier expansion of the conditional loss distribution. Extensive numerical experiments on synthetic portfolios under Gaussian, Student-ttt, shifted Gamma, and Normal Inverse Gaussian factor models show that both methods are accurate, computationally efficient, and robust relative to importance-sampled parallel Monte Carlo benchmarks. This is joint work with G. Mast, A. Hekimoglu and F. Fang


Combining Multi-dimensional COS Method with Tensor Decomposition: An Application to PFE Calculation

Gijs Mast (Delft University of Technology) · Fang Fang (Delft University of Technology) · Xiaoyu Shen (FF Quant Advisory B.V.) · Marnix Brands (FF Quant Advisory B.V.)

Monte Carlo simulation is the standard approach for computing credit exposures, but accurate estimation of tail risk measures such as Potential Future Exposure requires many simulation paths and can become computationally prohibitive for large portfolios. This paper develops a deterministic COS-tensor framework for large, liquid portfolios driven by a moderate number of risk factors. The method recovers exposure distributions in the Fourier domain by combining one-dimensional Fourier-cosine expansions with numerically evaluated characteristic functions. To mitigate the curse of dimensionality, multidimensional cosine coefficient tensors are approximated using low-rank tensor decompositions, with a focus on Canonical Polyadic Decomposition for its simplicity and interpretability. The tensor approximation is trained directly in the Fourier domain, substantially improving speed and accuracy relative to physical-domain gradient-based training. Numerical experiments for netting sets with tens of thousands of trades and seven risk factors show relative errors below 0.1% at a fraction of Monte Carlo runtime.

Organisers: Matthias Ehrhardt; Carlos Vázquez Cendón; Daniel Sevcovic 
 

Partial Integro-Differential Equations and their Applications in Financial Modeling

Jose Cruz (ISEG, University of Lisbon) · Daniel Sevcovic (Comenius University in Bratislava) · Cyril Izuchukwu Udeani (Comenius University in Bratislava)

In this presentation, we analyze solutions of a non-local nonlinear partial integro-differential equation (PIDE) in multidimensional spaces. This class of PIDE often arises in financial modeling. We employ the theory of abstract semilinear parabolic equations in order to prove the existence and uniqueness of solutions on the scale of Bessel potential spaces. We consider a wide class of Levy measures that satisfy suitable growth conditions near the origin and infinity. The novelty of the paper is the generalization of already known results in the one-space dimension to the multidimensional case. We consider Black-Scholes models for option pricing on underlying assets following a Levy stochastic process with jumps.


Pricing American Options with Stochastic Local Volatility and Correlation via RBSDEs

Long Teng (University of Wuppertal)

We price American options under a stochastic local volatility (SLV) model extended with stochastic correlation, where the correlation between asset returns and volatility is driven by an additional stochastic process. To handle the early exercise feature, we formulate the pricing problem as a reflected forward backward stochastic differential equation (RBSDE). Solving this RBSDE numerically yields both option prices and hedging strategies. Our data-driven numerical method is efficient and accurate, and we provide a convergence analysis. Numerical experiments illustrate the impact of stochastic correlation on American option prices and demonstrate the performance of the RBSDE-based approach under the extended SLV model with stochastic correlation.


No-Arbitrage Geometry in the Latent Space of Generative Models for Financial Data

Shuaiqiang Liu (Delft University of Technology)

Deep generative models provide flexible tools for synthesizing financial market data, including implied volatility surfaces (IVSs). However, generated samples must satisfy no-arbitrage constraints to be financially meaningful. We study the geometric structure induced by no-arbitrage constraints in the latent space of a generative model. Given a generative mapping from latent variables to IVSs, we introduce a no-arbitrage margin functional and define the associated latent-space admissible set consisting of latent variables that generate arbitrage-free surfaces. This formulation transforms no-arbitrage constraints in the data space into a geometric object in latent space. We analyze the existence, boundary structure, and local stability of the admissible set, showing that strictly admissible latent variables remain admissible under sufficiently small perturbations. The results establish a geometric perspective on arbitrage-free generation that applies to a broad class of generative models.


Finite Element Solution of the Two-Dimensional Bates Model for Option Pricing Under Stochastic Volatility and Jumps

Neda Bagheri Renani (Comenius University in Bratislava) · Daniel Sevcovic (Comenius University in Bratislava)

We propose a fourth-order compact finite-difference (HOC-FD) scheme for the transformed Bates partial integro-differential equation (PIDE). The method employs an implicit-explicit (IMEX) Crank-Nicolson framework for local terms and Simpson quadrature for the jump integral. Benchmarks against second--order finite differences (FD) and quadratic finite elements (FEM, p=2) confirms near fourth-order spatial accuracy for HOC-FD, near-second-order for FEM and second-order temporal convergence for all time integrators. Efficiency tests show that HOC-FD achieves similar accuracy at up to two orders of magnitude lower runtime than FEM, establishing it as a practical baseline for option pricing under stochastic volatility jump-diffusion models.

Finite-Difference Solution Ansatz Approach in Least-Squares Monte Carlo

Wayne Huo (Citigroup Global Markets)

This talk presents a novel method to enhance the Least-Squares Monte Carlo (LSMC) algorithm, a cornerstone technique for pricing derivatives and solving high-dimensional problems in computational finance. Based on a research article published in the Journal of Computational Finance [29(2), 67-121, (2025), doi:10.21314/JCF.2025.008], our approach innovatively bridges Monte Carlo simulation and finite-difference (FD) methods.

The core idea is to construct a robust ansatz for the conditional expected continuation payoff using a one-dimensional FD solution, which is then integrated into the LSMC linear regression. We demonstrate that this FD-based ansatz functions as a powerful control variate, provably reducing mean squared error across local and stochastic volatility models. This leads to significant improvements in pricing accuracy under the constant compute budget.

The practical effectiveness and relevance of this technique will be illustrated through complex, real-world examples, including Bermudan options, structured worst-of callable notes, and valuation adjustments (XVA).


Efficient Large Step Simulation of the Lifted Heston Model

Nicola Zaugg (Utrecht University)

The lifted Heston model emerges as a Markovian lift of rough volatility models by encoding path dependency through N square-root latent factors. In this talk we propose a novel simulation scheme within the class of implicit integrated variance methods to simulate large time steps of the system. By establishing an optimal linear projection in L2 space, we exploit the near-linear relationship between the stochastic driver and the conditional integrated variance. This allows for consistent and efficient sampling of the integrated variance process using an inverse Gaussian distribution. Our approach offers significant efficiency gains over existing methods and achieves near-exact accuracy even for coarse discretizations. We demonstrate that this scheme is particularly effective for pricing volatility options using large time steps, providing a robust tool for high-dimensional stochastic volatility modeling.


Cross-entropy Based Importance Sampling Using the COS Method

Fang Fang (Delft University of Technology) · Xiaoyu Shen (FF Quant Advisory B.V.) · Qinling Wang (Delft University of Technology)

Estimating tail risk measures of high-dimensional portfolio losses remains challenging for standard Monte Carlo methods. In particular, the efficiency of importance sampling critically depends on the choice of the sampling distribution, which is difficult to construct in complex dependence settings. In this work, we propose a COS-based approach to approximate an effective importance sampling distribution within a factor-copula framework, by minimizing the Kullback--Leibler divergence to a theoretically optimal distribution. The method is applied to the estimation of Value-at-Risk, Expected Shortfall, and conditional Expected Shortfall for risk allocation. Numerical results demonstrate that the approach achieves significant variance reduction and converges substantially faster than plain Monte Carlo simulation.


One-Step Survival Method for Barrier Option Price and Greeks Calculation under Heston Model

Komei Yamaya (Hosei university) · Kazuhiro Yasuda (Hosei university)

In this talk, we present a simulation algorithm for price and Greeks calculations of discrete barrier options under the Heston stochastic volatility model. To address this, we combine the Broadie--Kaya exact simulation method for the Heston model with the one-step survival technique, which allows us to simulate the underlying process while conditioning on survival relative to the barrier at each monitoring date. This hybrid approach also provides explicit representations of Greeks for the option. As a result, the variance of Monte Carlo estimators for discrete barrier options with European call option payoff can be reduced for price and Greeks calculations, leading to more stable and efficient numerical results.

Organisers: Eduardo Abi Jaber; Christian Bayer
 

From Rough SDEs to Rough PDEs: A Local stochastic Volatility Perspective

Peter Friz (TU Berlin)


Dimension Reduction for Path Signatures

Christian Bayer (WIAS) · Martin Redmann (University of Rostock)

Path signatures allow nonlinear stochastic dynamics to be approximated by linear systems, but the dimension of a truncated signature grows rapidly with its order. We propose a method to reduce this dimension while controlling the approximation error. We apply the approach to the rough Bergomi model, where a seventh-order truncated signature gives a 3280-dimensional system. Numerical results show that it can be reduced to a much smaller system while accurately reproducing prices and implied volatilities.


Volterra signatures and applications in computational finance

Luca Pelizzari (University of Vienna) · Christa Cuchiero (University of Vienna) · Paul Hager (University of Vienna) · Fabian Andsem Harang (BI - Norwegian Business School) · Samy Tindel (Purdue University)

In this talk, we introduce the Volterra signature, an extension of Chen's path signature that incorporates memory kernels in a principled way. This object arises naturally in expansions of controlled/stochastic Volterra equations, which play a central role in asset-price models with memory effects.

In the first part, we discuss several theoretical aspects, including universal approximation theorems, PDE characterizations of the associated RKHS kernel, and stochastic Taylor expansions. Building on this general framework, we then present tailored numerical techniques for specific classes of memory kernels, including higher-order FFT-based schemes for convolutional kernels and exact algorithms for finite state-space kernels associated with mean-reverting dynamics.

In the second part, we demonstrate several applications with both synthetic and real-world data, showing promising performance on learning tasks in computational finance with complex memory dependence.


Characteristic functions of signatures, Riccati equations and stochastic control

Eduardo Abi Jaber (École Polytechnique) · Elie Attal (École Polytechnique) · Dimitri Sotnikov (École Polytechnique)

We develop local series expansions and global representations for the conditional log-characteristic function of signatures, in terms of tensor-valued Riccati equations. As applications, we obtain semi-explicit feedback solutions to stochastic control problems with signature-driven state variables, extending beyond the classical linear-quadratic setting. We further apply our representations to Fourier pricing and hedging in signature volatility models.

Tuesday 14.10-15.50

Expand All

Organiser: Emmanuel Gobet
 

Optimal funding rates for perpetual futures: a Stackelberg game approach

Philippe Bergault (Université Paris-Dauphine (PSL)) · Sébastien Bieber (Université Paris-Dauphine (PSL)) · Olivier Guéant (Université Paris-Cité)

This paper studies the design of funding mechanisms in perpetual futures markets through a Stackelberg game between a trading platform and a representative arbitrageur. The platform chooses a funding-payment process to keep the perpetual futures price aligned with the spot price while avoiding excessive transfers that may destabilize the market or discourage participation. In response, the trader optimally builds positions in the spot and perpetual markets, accounting for trading costs, permanent price impact, and inventory risk. We characterize the trader's optimal response through a linear-quadratic stochastic control problem and derive the platform's optimal policy as the solution of a coupled forward-backward stochastic differential equation. The resulting framework provides a tractable model for studying how transfer mechanisms shape arbitrage incentives and market stability in perpetual futures markets.


Liquid Staking and the Limits of Policy

Faycal Drissi (University of Oxford) · Basil Williams (Imperial College London) · Zachary Feinstein (Stevens Institute of Technology)

We study the role of liquid staking and how it affects the interaction between issuance policy, economic productivity, and security in proof-of-stake blockchains. In a dynamic macro-finance framework, we show that issuance redistributes resources from productive on-chain activity to validators, which effectively acts as a tax on productive capital. This mechanism generates a Laffer-curve-type tradeoff: beyond an interior optimum, higher issuance weakens the productive base that finances security and reduces staking rewards. We then introduce liquid staking, which allows users to earn staking rewards while retaining liquidity for productive use. Liquid staking collapses the traditional tradeoff between staking and DeFi. When liquid staking tokens (LSTs) closely substitute for the native asset and benefit from strategic complementarities, issuance reallocates productive activity toward LSTs, compresses the feasible policy space, and can render issuance and slashing ineffective as policy instruments.


Modeling the risks within the lending-borrowing protocol Aave

Emmanuel Gobet (Sorbonne University) · Louis Latournerie (École Polytechnique)

Decentralized Finance (DeFi) lending and borrowing protocols enable investors to take leveraged long and short positions on digital assets without centralized intermediaries, but expose them to a distinctive form of risk: on-chain liquidation triggered by debt and collateral value fluctuations. In this talk, we provide a detailed formalization of Aave's lending, borrowing, and liquidation mechanisms, grounded in the protocol's open-source implementation. In doing so, we propose a mathematical modelling of the risks, including some stochastic approximations with the purpose of efficient analysis, with different applications. Among them, portfolio optimization problem.


Reputational Concerns in Delegated Staking Protocols

Julien Prat (IP Paris) · Boyang Mu (IP Paris)

Delegated staking protocols allow operators to validate blockchain networks using external funds, enhancing capital efficiency but creating a moral hazard problem in which operators bear limited financial repercussions. We show that, absent reputational concerns, delegated staking is insecure: operators exploit every attack opportunity regardless of the severity of slashing penalties. Introducing a dynamic reputation mechanism, in which the market learns about operator types from their track records, we demonstrate that reputation disciplines operators through the threat of losing future income. Our results provide a theoretical foundation for the design of securities in protocols with delegated stake.

From Economic Explanation to Performance Improvement in Machine-Learning Portfolios

Mihai Cucuringu (UCLA and University of Oxford) · Yunqi Liang (University of Oxford) · Stefan Zohren (University of Oxford)

To extend conventional model-level feature importance to economically meaningful portfolio outcomes and decisions, we propose a local first-order attribution-propagation framework that maps allocation-function feature exposures to local sensitivities of sequential portfolio performance metrics. We relate the propagated attributions to Shapley values defined directly for portfolio objectives and derive statistical inference for Sharpe-ratio attributions. The resulting attribution-guided feature-exposure intervention enables post-training adaptation, translating portfolio-metric explanations into out-of-sample decisions without retraining the underlying allocation model. We further introduce temporal stabilisation and cross-model averaging as complementary regularisation mechanisms. Empirically, the interventions yield statistically significant improvements in net Sharpe ratios across different model classes.


New: Directed Graph Clustering for Lead-Lag Structure: A Market Tug-of-War

Mihai Cucuringu (UCLA / University of Oxford)

We develop spectral methods for clustering directed networks, with a focus on uncovering lead-lag structure in high-dimensional financial time series. We leverage statistical inference under directed stochastic block models to derive a likelihood-based objective for community detection, and show how its spectral relaxation yields an efficient clustering algorithm with theoretical guarantees. A task of major interest in financial applications is estimating lead-lag relationships across assets and assessing their value for forecasting future returns. We provide a brief survey of the lead-lag detection literature, spanning core finance approaches and recent statistical and machine learning methods. By constructing directed networks from decompositions of returns into overnight and daytime components, we uncover a market-wide “tug-of-war,” whereby overnight speculation and intraday price correction propagate across stocks. Clustering these directed lead-lag networks reveals groups of leaders and laggers that yield statistically significant structures and predictive signals for cross-asset returns, which we evaluate through economically meaningful trading strategies.


Hierarchical NIG Factor Model: An EM-Based Estimation Approach

Luca Luigi Alberici (Bayes Business School) · Laura Ballotta (Bayes Business School) · Gianluca Fusai (Bayes Business School)

The aim of this paper is to estimate a non-Gaussian factor model by exploiting a hierarchical representation of the underlying distributions, which allows the model to be naturally expressed in terms of latent variables and substantially simplifies statistical inference. Within this framework, parameter estimation is carried out using the Expectation-Maximization (EM) algorithm, which efficiently leverages the mixture representation to handle latent components in an iterative and tractable manner.

In particular, we revisit the multivariate Normal-Inverse Gaussian (NIG) factor model, formulated as a Gaussian-Inverse Gaussian mixture, by allowing the latent mixing variable to affect both the mean and the variance of the Gaussian distribution. This extension enhances model flexibility and robustness while preserving analytical tractability through the hierarchical specification.


 

Symmetry-Aware Neural Covariance and Cross-Covariance Forecasting in Non-Stationary Financial Markets

Christian Bongiorno (CentraleSupélec) · Efstratios Manolakis (Università di Catania) · Rosario Nunzio Mantegna (Università degli Studi di Palermo)

Random-matrix theory provides asymptotically optimal shrinkage rules for large covariance and cross-covariance matrices: noisy empirical eigenvalues or singular values are regularized while the corresponding empirical modes are preserved. In real financial data, however, the assumptions underpinning these analytical formulas are often violated by non-stationarity, heavy tails, and dominant market-wide factors. This talk presents a symmetry-aware machine-learning framework that retains the theoretical structure of rotationally invariant shrinkage, while learning data-driven corrections when markets deviate from the stationary limit. I will discuss applications to end-to-end global minimum-variance portfolio construction and to cross-covariance forecasting through singular-value learning. Across both problems, embedding the analytical estimator as a limiting case yields lower out-of-sample risk and more stable dependence forecasts. Empirically, the resulting variance reduction is economically meaningful, as it supports a broader leverage region with improved drawdown control and reduced compounding erosion.

Organisers: Karel In't Hout; Michèle Vanmaele
 

Improved approximation of Greeks in the deep parametric PDE method

Linus Wunderlich (Queen Mary University of London)

Neural-network-based solvers can compute derivative prices in high dimensions without requiring reference prices. The deep parametric PDE method extends this by approximating prices across a range of market and option parameters using a single neural network. While it enables direct evaluation of Greeks via automatic differentiation, the accuracy varies. Sensitivities with respect to underlying assets like Delta are often well-approximated, but parameter-sensitivities like Vega are not. To improve the approximation of important Greeks, we add the PDE governing the sensitivity of the price with respect to model parameters to the loss function. This approach improves the approximation of Greeks across parameters, improving the reliability of Greeks, e.g. required for sensitivity-based margin calculations such as SIMM.


Numerical valuation of American options and their Greeks under the two-asset Kou jump-diffusion model

Karel In't Hout (University of Antwerp)

This talk deals with the numerical solution of the two-dimensional time-dependent partial integro-differential complementarity problem (PIDCP) that holds for the value of American-style options under the two-asset Kou jump-diffusion model. Following the method of lines, we derive an efficient numerical method for the pertinent PIDCP. Here, for the discretization of the nonlocal double integral term, we employ an extension of Toivanen's fast algorithm (2008) in the case of the one-asset Kou jump-diffusion model. For the temporal discretization, we study a useful family of second-order diagonally implicit Runge--Kutta (DIRK) methods. Their adaptation to the semidiscrete two-dimensional Kou PIDCP is obtained by means of an effective iteration introduced by d'Halluin et al. (2004, 2005). Numerical experiments are presented that show the proposed numerical method achieves favorable second-order convergence to the American two-asset option value as well as its Greeks Delta and Gamma.


Efficient numerical valuation of American-style derivatives under two-asset infinite-activity Lévy processes

Massimiliano Moda (University of Antwerp) · Karel In't Hout (University of Antwerp) · Michèle Vanmaele (Ghent University) · Fred Espen Benth (BI - Norwegian Business School)

We propose a numerical method for approximating the values of two-asset American options under an infinite-activity exponential Lévy model for the underlying dynamics, described in [M. Moda, K.J. in 't Hout, M. Vanmaele, and F.E. Benth, (2026) arXiv:2511.02700v2].

The fair derivative value satisfies a two-dimensional partial integro-differential complementarity problem (PIDCP). The proposed numerical scheme proceeds in two steps: a finite-difference discretization in space followed by a penalty-based time-stepping method.

A major difficulty arises from the integral term in the PIDCP, which leads to a large dense matrix in the resulting semidiscrete system. The proposed method relies on a useful representation of this term, which naturally leads to a suitable discretization capable of handling the singularity. Next, a second-order implicit-explicit time-stepping scheme is employed, allowing the use of the fast Fourier transform for the semidiscretized integral term.


Numerical Methods for Impulse Control Problems in Swing Option Pricing

Mustapha Regragui (Ghent University)

We study the numerical valuation of swing options in electricity markets under a two-factor mean-reverting price model that incorporates spikes and negative prices. The contract features state-dependent waiting times determined by the exercised amount, with flexible exercise opportunities subject to local and global constraints. This framework leads to a coupled system of a parabolic partial integro-differential equation and a partial differential complementarity problem. We investigate the existence of an optimal exercise strategy and develop an effective numerical scheme to solve this coupled system.

Organisers: Xue Cheng; Shuaiqiang Liu
 

Explicit Signal-Adaptive Sequential Optimal Execution Quotes

Fenghui Yu (TU Delft)

We present a unified explicit solution theory for optimal execution via sequential limit-order placement in a limit order book. Unlike classical execution models that control only the trading rate, our framework optimizes the quotes of individual limit orders under signal-dependent drift, price impact, inventory risk, and execution risk. We consider four widely used execution criteria, including both risk-neutral and CARA utility formulations with and without running inventory penalties. For general price-impact and inventory-penalty functions, we show that all four problems admit a common triangular finite-dimensional structure, yielding fully explicit value functions and optimal quoting strategies. We further establish well-posedness and verification results, uncover structural connections between different execution objectives, characterize long-horizon asymptotics, and demonstrate numerically how predictive signals can significantly improve optimal execution.


Enhancing Execution Strategies with Price Predictions and the Kelly Criterion

Xue Cheng (Peking University) · Yuhao Lu (Peking University) · Tai-Ho Wang (The City University of New York) · Ruixun Zhang (Peking University) · Jingbin Zhuo (Peking University)

This paper proposes a lightweight framework for improving large-trade execution by combining short-horizon price forecasts with the Kelly criterion. Unlike pre-committed benchmarks such as TWAP and VWAP, the method reallocates shares between adjacent intraday intervals according to the predicted distribution of the next price change, converting predictive signals into a controlled risk--return trade-off under logarithmic utility. To address estimation risk from finite samples, we introduce a variance-based shrinkage rule that scales the plug-in Kelly action toward zero when uncertainty is high, reducing out-of-sample aggressiveness and instability. Using Shenzhen Stock Exchange tick data for CSI 300 and CSI 500 constituents, we find consistent reductions in execution costs and modest improvements in risk-adjusted performance across several baseline schedules. The approach preserves the original schedule structure while providing a modular overlay for adaptive execution.


Controllable Generation of Implied Volatility Surfaces Using Deep Generative models

Jing Wang (Delft University of Technology) · Shuaiqiang Liu (Delft University of Technology) · Cornelis Vuik (Delft University of Technology)

Implied volatility surfaces (IVSs) are a critical input to a wide range of financial and managerial decisions, including derivative pricing, hedging, risk aggregation, and regulatory stress testing. These decisions are most consequential during periods of market stress, when IVSs exhibit extreme behavior and historical data are scarce. We present a deep generative modelling framework for controllably synthesizing IVSs that explicitly support financial and regulatory decision making. Building on variational autoencoders (VAE), we design a controllable VAE architecture, in which meaningful IVS shape characteristics are treated as interpretable control variables, while latent variables capture residual structure to preserve shape diversity. To enable this control, IVS feature values are quantified and incorporated to steer generation. The framework ensures that generated IVSs remain economically consistent and suitable for downstream pricing and risk management applications. Our results demonstrate that controllable generative AI models can serve as a practical decision-support tool for risk management.


Accelerated Share Repurchase with Power-Law Transient Impact: Tackling Non-Markovian Dynamics with Reinforcement Learning

Xue Cheng (Peking University)

This paper studies the problem of Accelerated Share Repurchase (ASR). Empirical evidence shows that market impact follows a power-law form of transient decay, which generates long-memory effects in price dynamics. This feature breaks the usual Markov structure and prevent the application of the dynamic programming principle (DPP) to the execution problem. To address this difficulty, we introduce a tractable approximation method. By bringing the ideas from Prony's method, we approximate the power-law transient impact kernel with a finite sum of exponentials and represent it by a small number of Markovian state variables. This finite-dimensional Markovian structure restores the use of dynamic programming. Building on this approximate model, we then apply reinforcement learning (RL) to learn near-optimal execution strategies under practical trading constraints. The resulting framework provides a clear balance between capturing essential market microstructure effects and maintaining computational feasibility.

This is joint work with GUO Peng and ZHUO Jingbin.

Organisers: Chiheb Ben Hammouda; Kees Oosterlee
 

Data-Driven Stochastic Optimal Control for Trading of Renewables on Intraday Energy Markets

Chiheb Ben Hammouda (Utrecht University) · Michael Samet (RWTH Aachen University) · Raul Tempone (King Abdullah University of Science and Technology)

The growth of weather-dependent renewable generation increases price volatility and imbalance risk in power markets, motivating advanced trading strategies. We develop a continuous-time stochastic optimal control framework for intraday electricity trading based on stochastic differential equations with mean reversion to forecast trajectories. Production follows a Jacobi diffusion, while prices follow an asymmetric jump-diffusion capturing heavy tails in intraday markets. The model incorporates gate closure and energy-based imbalance settlement over the delivery window, with the path-dependent imbalance cost handled through state augmentation. The value function is characterized by two linear Kolmogorov backward equations and a nonlinear Hamilton-Jacobi-Bellman partial integro-differential equation. We solve the problem using a monotone IMEX finite-difference scheme with operator splitting and semi-implicit linearization. Numerical experiments using German market data show that the strategy outperforms the TWAP benchmark and approaches the perfect-foresight benchmark. Sensitivity analyses examine the effects of jump intensity, delivery-window length, and trading horizon on trading performance.


Optimal Strategies and Rolling Intrinsic Approaches for Battery Storage Trading in Intraday Electricity Markets: A Comparative Analysis

Karel Nana Kemajou (University of Wuppertal) · Long Teng (University of Wuppertal) · Cornelis Oosterlee (Utrecht University)

Optimizing the operation of battery energy storage systems (BESS) in intraday electricity markets requires charging and discharging decisions under uncertain and volatile electricity prices. Among the most widely used approaches are the Rolling Intrinsic (RI) strategy and Least Squares Monte Carlo (LSMC). While previous studies have compared their performance on historical market data, it remains unclear under which price dynamics one method outperforms the other and which characteristics of the price process drive these differences.

In this work, we conduct a systematic comparative analysis of RI and LSMC within a controlled synthetic market environment. Intraday electricity prices are modeled as a nonlinear transformation of a multivariate Ornstein-Uhlenbeck process, enabling systematic variation of key price dynamics. By systematically analyzing their performance across different scenarios, we identify the conditions under which each approach is most effective and provide practical guidance for selecting trading strategies in different market environments.


Italian Market Signals for Hybrid Wind--Battery Dispatch: From Price-Agnostic to Price-Driven Control

Nicolò Filippas (ERG SpA / UniGe) · Giorgia Callegaro (UniPd) · Emanuela Sasso (UniGe) · Sadion Xhuveli (ERG SpA)

The aim of this work is to show the implementation and extension of the algorithm for optimal intraday dispatch of hybrid wind-battery assets, originally developed by Aung and Ludkovski (2025), adapted to the Italian electricity market. The algorithm combines dynamic programming with Gaussian-process emulation of the value and control maps, making the Dynamic Programming Principle more practical by replacing its otherwise costly computations with efficient approximations. Its aim is to determine the optimal battery schedule that minimizes firming deviations between realized and target generation.

We calibrate the model using Italian wind production and imbalance price data, replacing the price-agnostic U.S. framework with a formulation driven by Italian market signals from the Mercato del Giorno Prima and real-time Prezzo di Sbilanciamento. The resulting control incorporates asymmetric penalties reflecting upward and downward imbalance costs specific to the Italian dispatch system.


Semi-Static hedging of volumetric risk in energy markets

Konstantinos Chatziandreou (University of Amsterdam) · Sven Karbach (University of Amsterdam)

Power purchase agreements (PPAs) support the green energy transition by fixing prices for uncertain renewable generation, typically over 10--15 years. Their value depends on the joint distribution of future renewable output and forward electricity prices. This talk presents quantitative methods for pricing PPAs and hedging their embedded risks.

We develop a coupled model for electricity forward prices and renewable production indices. A Wishart-type stochastic covariance specification captures the complex dependence between future production volumes and forward price dynamics.

We also propose a semi-static variance-optimal hedging strategy. Its dynamic component trades liquid electricity forwards, while its static buy-and-hold component holds a basket of contingent claims. Quanto indices and weather derivatives are central instruments, because they capture stochastic price--production covariance and can be structured to hedge both volume and price risk. Finally, we assess how this integrated framework mitigates the risks intrinsic to PPAs.

Organiser: Anke Wiese
 

A Generalised Stochastic Hybrid Systems Approach to American Option Pricing

Amira Meddah (Johannes Kepler University) · Evelyn Bukwar (Johannes Kepler University) · Agnes Mallinger (Johannes Kepler University) · Sascha Desmettre (Johannes Kepler University)

This talk presents a stochastic hybrid framework for pricing American options using Piecewise Diffusion Markov Processes (PDifMPs). Unlike classical models with constant drift and volatility, PDifMPs combine continuous stochastic dynamics with discrete jumps, allowing for a more realistic representation of sudden market fluctuations and changing market regimes. The proposed approach is compared with the classical Longstaff--Schwartz algorithm, including a modified version based on PDifMP-generated asset trajectories.


Universal Approximation on Non-geometric Rough Paths and Applications to Financial Derivatives Pricing

Fride Straum (Norwegian University of Science and Technology) · Fred Espen Benth (BI - Norwegian Business School) · Fabian Andsem Harang (BI - Norwegian Business School)

We present a novel perspective on the universal approximation theorem for rough path functionals, introducing a polynomial-based approximation class. We extend universal approximation to non-geometric rough paths within the tensor algebra. This development addresses critical needs in finance, where no-arbitrage conditions necessitate Itô integration. Furthermore, our findings motivate a hypothesis for payoff functionals in financial markets, allowing straightforward analysis of signature payoffs proposed in Arribas (Derivatives Pricing Using Signature Payoffs; 2018).


Signature Kernel Ridge Regression

Jakob Kellermann (Weierstrass Institute) · Christian Bayer (Weierstrass Institute)

 

The signature of a path is a classical object in rough path theory that provides a complete summary of a path's behavior and has found widespread use as a feature map for sequential data. In this talk, we present recent work on kernel ridge regression with the signature kernel on spaces of stopped rough paths. We identify the associated reproducing kernel Hilbert space (RKHS) as a space of linear functionals of the signature, implying universality of the RKHS. Extending the approach of Caponnetto and De Vito to unbounded kernels satisfying moment growth conditions, we provide finite sample guarantees for signature kernel ridge regression, both for the case where the kernel fulfills a Bernstein condition, as well as for the heavy-tailed setup. Numerical experiments on rough differential equations confirm that the method performs effectively in practice.


A Chen-Strichartz representation for Lévy models with applications to stochastic covariance models

Anke Wiese (Heriot-Watt University) · Kurusch Ebrahimi-Fard (Norwegian University of Science and Technology) · Frédéric Patras (Université Côte d'Azur)

For deterministic differential equations and for continuous stochastic differential equations, the Chen-Strichartz series expansion, an expansion of the solution in terms of commutators of vector fields and iterated integrals, is well-known to play a central role in the development of numerical integration schemes that preserve qualitative properties of the solution.

For stochastic differential equations that are driven by Lévy processes, the flow map, which describes the evolution of the solution, involves additional operators arising from jumps. We will derive a Chen-Strichartz series representation, depending only on commutators of vector fields and iterated integrals, and we will provide an explicit expression for the components in this series, generalising previous results for deterministic and continuous stochastic differential equations. We will illustrate the new Chen-Strichartz series representation in the application to a multi-dimensional stochastic covariance model.

Tuesday 16.20-17.10

Expand All

Deterministic Policy Gradient Methods in Continuous Time and Space

Ziheng Cheng (UC Berkeley) · Xin Guo (UC Berkeley) · Yufei Zhang (Imperial College London)

The theory of continuous-time reinforcement learning (RL) has progressed rapidly in recent years. While the ultimate objective of RL is typically to learn deterministic control policies, most existing continuous-time RL methods rely on stochastic policies. Such approaches often require sampling actions at very high frequencies, and involve computationally expensive expectations over continuous action spaces, resulting in high-variance gradient estimates and slow convergence.

In this paper, we introduce and develop deterministic policy gradient methods for continuous-time RL. We derive a continuous-time policy gradient formula expressed as the expected gradient of an advantage rate function and establish a martingale characterization for both the value function and the advantage rate. Building on this foundation, we propose a model-free continuous-time Deep Deterministic Policy Gradient (CT-DDPG) algorithm that enables stable learning for general reinforcement learning problems with continuous time-and-state. Numerical experiments show that CT-DDPG achieves superior stability and faster convergence compared to existing methods.

Wednesday 9-10.40

Expand All

Organiser: Luitgard Veraart
 

An ecological approach to credit flows in interfirm networks

Anahí Rodríguez-Martínez (University College London) · Silvia Bartolucci (University College London) · Francesco Caravelli (Los Alamos National Laboratory) · Victoria Landaberry (Banco Central del Uruguay) · Pierpaolo Vivo (King's College London) · Fabio Caccioli (University College London)

We introduce DebtStreamness (DS), a metric inspired by trophic levels in ecological food webs, to measure firms' positions within credit chains. DS captures how far credit travels through interfirm lending before reaching its final users. Applying the framework to Uruguay's interfirm credit network using Central Bank credit registry and survey data, we find a tiered, hierarchical network structure that reflects firms' positions relative to financial institutions. We show that local network motifs, particularly loops, can substantially increase a firm's DS. Using a stylized stress-test exercise, we find that firms with higher DS experience greater liquidity losses under a liquidity shortage, highlighting the value of DS for assessing risk.


Stochastic Control of Core–Periphery Banking Systems

Ben Hambly (University of Oxford) · Rawan Madi (University of Oxford) 

We study a stochastic control problem for an interbank system with a heterogeneous core-periphery structure. The model consists of a finite collection of core banks interacting with a mean-field population of periphery banks, with interactions designed to capture the different roles played by institutions within the network. The objective of the controller is to mitigate systemic risk by balancing the cost of intervention against the losses associated with bank distress and default. We introduce the model and its interaction mechanisms, present the associated PDE characterization of the control problem, and discuss numerical results illustrating the behavior of the optimal intervention strategy under different forms of interaction between the core and periphery populations.


Computing the Impact of Regulation on Systemic Risk

Nikolai Nowaczyk (The London School of Economics and Political Science)

Since the great financial crisis in 07/08, major regulation like mandatory initial margin and central clearing has been issued to mitigate counterparty credit risk in the global derivatives trading system. We study the isolated impact of such regulation by a priori estimates in a graph model of trade and risk relations of financial systems created by generative methods. We identify key drivers of impact consistent with empirical findings and provide policy makers and practitioners with tools to study the impact of regulatory interventions before implementation.


Modelling contagious bank runs

Luitgard Veraart (The London School of Economics and Political Science)

We develop a modelling framework for contagion in financial networks arising from bank runs. We show how interacting channels of contagion, namely funding withdrawals in the interbank network and price-mediated contagion arising from fire sales can turn a bank run on one institution into a systemic crisis. Furthermore, we also model how contagion effects can lead to additional bank runs. Our model allows for a wide range of withdrawal mechanisms both by banks and by external depositors. It can be used for financial stress testing and particularly for analysing implications of different withdrawal mechanisms for systemic risk. We illustrate this in stylised examples and an empirical case study. We find that the extent of systemic risk is highly sensitive to the choices of withdrawal strategies used by the market participants. We also discuss policy implications.

Signature approach for pricing and hedging path-dependent options with frictions

Eduardo Abi Jaber (École Polytechnique) · Donatien Hainaut (Catholic University of Louvain) · Edouard Motte (Catholic University of Louvain)

We introduce a novel signature approach for pricing and hedging path-dependent options with instantaneous and permanent market impact under a mean-quadratic variation criterion. Leveraging the expressive power of signatures, we recast an inherently nonlinear and non-Markovian stochastic control problem into a tractable form, yielding hedging strategies in (possibly infinite) linear feedback form in the time-augmented signature of the control variables, with coefficients characterized by non-standard infinite-dimensional Riccati equations on the extended tensor algebra. Numerical experiments demonstrate the effectiveness of these signature-based strategies for pricing and hedging general path-dependent payoffs in the presence of frictions. In particular, market impact naturally smooths optimal trading strategies, making low-truncated signature approximations highly accurate and robust in frictional markets, contrary to the frictionless case.


Reconciling P- and Q-Calibration: The Discrete-Time 4-Factor Path-Dependent Volatility Model

Julien Guyon (ENPC, Institut Polytechnique de Paris; New York University) · Léo Parent (ENPC, Institut Polytechnique de Paris)

Model calibration under P and under Q are often regarded as two separate branches of finance. One may question whether such a strict separation is justified or whether it reflects the lack of models able to capture the joint dynamics of prices and implied volatilities. Path-dependent volatility models are uniquely positioned to reconcile P- and Q-calibration, since they precisely relate past asset returns to volatility, thus to option prices. In this talk, we introduce the discrete-time 4-(or 3-)factor path-dependent volatility model and show that combining the path-dependency of volatility that we uncovered in Volatility Is (Mostly) Path-Dependent (Guyon and Lekeufack, 2023) with fat-tailed random innovations allows us to reconcile model calibration under P and under Q, which further supports the hypothesis of high endogeneity of volatility. We also propose a new estimation approach that combines P- and Q-information to enhance calibration robustness, and we benchmark its effectiveness against classical methods.


Generalizable and Interpretable Dynamic Hedging Strategies Using Itô Signatures as Tradable Bases

Xin Guo (University of California, Berkeley) · Binnan Wang (Peking University) · Ruixun Zhang (Peking University)

Joint work with Xin Guo (UC Berkeley) and Ruixun Zhang (Peking University). This paper develops an interpretable machine-learning framework for dynamic hedging using the Itô signature of asset-price paths. We show that each discretized Itô signature component can be replicated by a self-financing strategy using only the underlying assets and cash, turning Itô signatures into tradable and transparent hedging bases. This allows nonlinear derivative payoffs to be approximated by linear combinations of signature terms and hedged accordingly. We establish approximation results for Itô signatures and derive theoretical bounds for in-sample and out-of-sample hedging errors. Our method is computationally efficient, easy to implement, and avoids estimating conditional expectations. In simulations, it delivers strong sample efficiency relative to neural-network benchmarks, and in an empirical study of S&P 500 index options, it shows robust performance across contracts. Overall, the paper identifies Itô signatures as a practical, transparent, and model-free foundation for dynamic hedging.


Machine-learning regression methods for American-style path-dependent contracts

Matteo Gambara (Inait SA) · Giulia Livieri (The London School of Economics and Political Science) · Andrea Pallavicini (Intesa Sanpaolo)

Evaluating financial products with early-termination clauses, particularly those with path-dependent structures, is challenging. This contribution focuses on Asian options, look-back options, and callable certificates. We will compare regression methods for pricing and computing sensitivities, highlighting modern machine learning techniques against traditional polynomial basis functions. Specifically, we will analyze randomized recurrent and feed-forward neural networks, along with a novel approach using signatures of the underlying price process. For option sensitivities like Delta and Gamma, we will incorporate Chebyshev interpolation. Our findings show that machine learning algorithms often match the accuracy and efficiency of traditional methods for Asian and look-back options, while randomized neural networks are best for callable certificates. Furthermore, we apply Chebyshev interpolation for Delta and Gamma calculations for the first time in Asian options and callable certificates.

Organisers: Peter Forsyth; Yuying Li
 

Is Rebalancing Bad for Your Wealth?

Peter Forsyth (University of Waterloo)

The conventional wisdom suggests that retail investors should rebalance their portfolios back to a constant weight stock-bond mix. Although this sounds reasonable, both a theoretical model and empirical tests based on block bootstrap resampling of historical data do not support this claim. At best, the evidence for rebalancing the stock-bond split (as compared with buy and hold) for time horizons of less than ten years, is weak.

Only in the case where the investor wishes to avoid high instantaneous volatility (even though the CDF of the terminal wealth is arguably superior for buy and hold) will rebalancing be the better choice.


Champagne leverage on a beer budget: rethinking leveraged ETFs for the retail investor.

Pieter Van Staden (University of Waterloo) · Peter Forsyth (University of Waterloo) · Yuying Li (University of Waterloo)

Leveraged Exchange Traded Funds (LETFs), extremely controversial in literature, remain popular with retail investors. Could their potential be underestimated? We investigate the inclusion of a broad-market LETF in long-term, dynamically-optimal portfolios for the retail investor, with an objective function designed to maximize the information ratio (IR) relative to standard benchmarks. Exploiting the observation that LETF positions deliver call-like payoffs, we show that a LETF can provide inexpensive leverage while preserving downside protection. Under stylized assumptions, we derive closed-form IR-optimal strategies using either a LETF or a standard/vanilla ETF (VETF). In more realistic settings, we adopt a neural network-based approach trained on bootstrapped historical data. IR-optimal strategies containing a LETF are more likely to outperform the benchmark than their VETF counterparts, and achieve partial stochastic dominance over both benchmark and VETF-based strategies, helping to explain the empirical appeal of LETFs to retail investors.


Variable Annuities: A closer look at ratchet guarantees, hybrid contract designs, and taxation

Jennifer Alonso-Garcia (Université Libre de Bruxelles) · Len Patrick Dominic M. Garces (UNSW Sydney) · Jonathan Ziveyi (UNSW Sydney)

This paper investigates optimal withdrawal strategies in a variable annuity contract (VA) with a guaranteed minimum withdrawal benefit (GMWB) rider incorporating taxation and a ratchet mechanism for updating the benefit base. Optimal policyholder behaviour is characterised by solving a backward dynamic programming problem maximising the discounted risk-neutral expectation of contract cash flows. Reflecting traded VA contracts, our hybrid product includes a cash fund serving as an intermediate repository of VA earnings, accruing interest at a contractually specified rate. Our results reveal significant interactions among taxation, cash fund, and benefit base update mechanism. The ratchet scheme, in contrast to the return-of-premium specification, discourages early surrender by providing stronger downside market risk protection. High tax rates amplify the tax-shielding role of the cash fund, enhancing overall contract attractiveness. However, the cash fund suppresses active withdrawals, with policyholders preferring passive transfers of the guaranteed amount, diminishing its role as a retirement solution.


Optimal for Whom? Is the Retail Investor at the Table or on the Menu?

Graham Westmacott (Richardson Wealth)

A lifecycle model is developed to investigate the relative importance of competing drivers of long-term retirement outcomes. The model incorporates historical return data, realistic household cash flows, Canadian taxation, registered and taxable accounts, public pensions, housing, retirement withdrawal policies, and consumption-based measures of retirement welfare.

Preliminary results suggest that several factors under direct household control---including spending flexibility, retirement timing, savings behaviour, and investment costs---may have effects on retirement outcomes that are comparable to, and in some cases larger than, those produced by changes in asset allocation. The objective of the presentation is to offer a computational framework that incorporates lessons from optimal stochastic control studies into a personal financial planning framework to evaluate a question of growing importance to retail investors: when planning for retirement, which decisions genuinely deserve the most attention?

Organisers: Matthias Ehrhardt; Carlos Vázquez Cendón; Daniel Sevcovic
 

Fourier-cosine Pricing for Products against Cyber Attacks

Junyou Li (Chinese University of Hong Kong) · Matteo Malavasi (UNSW Sydney) · Zhengyao Ross Sun (Celestial Scale) · Tak Kwong Wong (Shenzhen University) · Phillip Yam (Chinese University of Hong Kong)

A major challenge in emerging risk modelling in FinTech/InsurTech/RegTech is handling those real datasets where most covariates are categorical, to predict claim numbers and severities in cyber risk; this is the shortfall of commonly adopted temporal models, such as Hawkes process or autoregressive models. To address this, we propose a novel superposed marked Hawkes process integrating categorical covariate information to infer hidden clustering structures; indeed, by employing classifiers such as CIBer/CART/MLP, we iteratively optimize both model parameters and cluster partitions using mini-batch SGD. The effectiveness of this modelling is demonstrated through empirical studies with benchmark cyber risk datasets, yielding notably improven prediction for frequencies (also for severities). With the new process, all existing pricing methods should be revisited; while we here highlight the use of Fourier-COS method to effectively price different insurance products against cyber risk, particularly as a finite series involving the Laplace functional of the corresponding compound process.


Pricing vanilla options on RECs for jump-diffusion models in the generation rate.

Pablo Pérez Picos (University of A Coruña) · Carlos Vazquez Cendon (University of A Coruña) · María del Carmen Calvo Garrido (University of A Coruña)

Although international organizations and governments recognize the benefits of renewable energy, deploying the associated technologies requires substantial investments. Consequently, additional market mechanisms have been developed to support their expansion. Renewable Energy Certificates (RECs) are currently traded together with their derivatives in energy markets.

In this work, we extend previous PDE-based models for pricing vanilla options on RECs by considering a jump-diffusion process for the renewable generation rate. More precisely, in the case without jumps, a linear PDE model has been obtained when the generation rate and number of RECs are considered as underlying factors. The inclusion of jumps leads to a linear PIDE model with an additional nonlocal (integral) term with respect to the PDE model. In the present work, we also propose suitable numerical methods for the treatment of this PIDE model. Numerical examples for European and American options illustrate the behaviour of the model and the numerical methods.


Rough volatility dynamics in commodity markets

Roberto Daluiso (Intesa Sanpaolo) · Héctor Folgar-Cameán (University of A Coruña) · Andrea Pallavicini (Intesa Sanpaolo) · Carlos Vázquez Cendón (University of A Coruña)

We present a general rough volatility model for commodities that provides an automatic calibration of the initial term structure of the futures prices and an appropriate treatment of the Samuelson effect, and further allows us to promote models usually employed in equity markets into the commodity framework. After the theoretical analysis of this general model, we focus on the rHeston and rBergomi models as characterisations of the general model and calibrate them to market data of vanilla futures options on WTI Crude Oil. Finally, numerical results illustrate the performance of the proposed rough volatility models for commodities pricing.


The Space Mapping Approach in Computational Finance

Anna Clevenhaus (University of Wuppertal) · Claudia Totzeck (University of Wuppertal) · Matthias Ehrhardt (University of Wuppertal)

We present a novel approach to calibrating the parameters of the Heston model for pricing an Asian put option: space mapping. Since few Heston model parameters can be directly extracted from real market data, calibrating to real market data is implicit and challenging. Additionally, some parameters in the model are nonlinear, making it difficult to find the global minimum of the optimization problem during calibration. Our approach is based on space mapping, which exploits the residuum of a coarse surrogate model that allows optimization and a fine model that requires calibration. In our case, pricing an Asian option using the Heston model SDE is the fine model, and the surrogate is the Heston model PDE for pricing a European option. We formally derive a gradient descent algorithm for the PDE-constrained calibration model and demonstrate that the space mapping approach is useful for financial calibration tasks by showcasing some numerical results.

Organisers: Chiheb Ben Hammouda; Kees Oosterlee
 

Modeling and Replication of the Prepayment Option of Mortgages Including Behavioral Uncertainty

Lech Grzelak (Utrecht University) · Cornelis Oosterlee (Utrecht University) · Leonardo Perotti (Utrecht University)

Prepayment risk embedded in fixed-rate mortgages forms a significant fraction of a financial institution’s exposure, and it receives particular attention because of the magnitude of the underlying market. The embedded prepayment option bears the same interest rate risk as an exotic interest rate swap with a suitable stochastic notional. We investigate the effect of relaxing the assumption of a deterministic relationship between the market interest rate incentive and the prepayment rate. A non-hedgeable risk factor is modeled to capture the uncertainty in mortgage owners’ behavior, leading to an incomplete market. We prove under natural assumptions that including behavioral uncertainty reduces the exposure’s value. We statically replicate the embedded prepayment option exposure with swaps and swaptions. We show that a replication based solely on swaps cannot easily control the right tail of the exposure distribution, while including swaptions enables that. 


Deep Joint Learning Valuation of Bermudan Swaptions

Francisco Gomez-Casanova (BBVA) · Alvaro Leitao (University of A Coruña) · Fernando de Lope (BBVA) · Carlos Vázquez Cendón (University of A Coruña)

This work addresses the problem of pricing involved financial derivatives by means of advanced deep learning techniques. More precisely, we methodically integrate several sophisticated neural network-based concepts like differential machine learning, Monte Carlo simulation-like training samples and joint learning to come up with an efficient numerical solution. The application of the latter development represents a novelty in the context of computational finance. We also propose a novel design of interdependent neural networks to price early-exercise products, in this case, Bermudan swaptions. The improvements in efficiency and accuracy provided by the approach proposed here is widely illustrated throughout a range of numerical experiments. Moreover, this novel methodology can be extended to the pricing of other financial derivatives.


The Compound BSDE Method: A Fully Forward Method for Option Pricing and Optimal Stopping Problems in Finance

Zhipeng Huang (Utrecht University) · Cornelis Oosterlee (Utrecht University)

We propose the Compound BSDE method, a fully forward, deep-learning-based approach for solving a broad class of problems in financial mathematics, including optimal stopping. The method reformulates option pricing as a system of backward stochastic differential equations (BSDEs), offering a new perspective on the numerical treatment of compound options and financial optimal stopping problems. Building on the classical deep BSDE method for a single BSDE, we develop an algorithm for compound BSDEs and establish convergence properties. We derive an a posteriori error estimate. Numerical experiments demonstrate accuracy and computational efficiency for high-dimensional option pricing and optimal stopping problems.


Convergence of neural network policies for risk-reward optimization

Chang Chen (The University of Queensland) · Duy-Minh Dang (The University of Queensland)

We develop a neural-network framework for multi-period risk-reward stochastic control problems with constrained two-step feedback policies that may be discontinuous in the state. We allow broad objectives built on a finite-dimensional performance vector, including both terminal and path-dependent statistics. These objectives combine expected reward with risk functionals that admit auxiliary-variable optimization representations, as well as path-based risk measures such as realized quadratic variation, with optional higher moments of the performance vector. Our approach parametrizes the two-step policy using two coupled feedforward networks with constraint-enforcing output layers, reducing the constrained control problem to unconstrained training over network parameters. Under mild regularity conditions, we prove that the sample-average NN value converges in probability to the optimal value as network capacity and sample size increase. The proof pipeline is modular and extends to risk-reward criteria given by continuous bounded functionals of finite-dimensional performance summaries. Numerical experiments demonstrate stable training and favorable convergence behavior.

Organiser: Peter Jäckel
 

PDEs & the calibration of local volatility: the case of American options on stocks with discrete dividends

Leif Andersen (Bank of America)


Fast Finite Difference Techniques for American Options Under Negative Rates

Fabien Le Floc'h (Independent Researcher)

The classic Brennan-Schwartz algorithm to solve the linear complementary problem, which arises from the finite difference discretization of the partial differential equation related to American option pricing does not lead to the exact solution under negative interest rates. This is due to the two exercise boundaries which may appear under negative interest rate, while the algorithm was proven to lead to the exact solution in the case of a single exercise boundary only. We show that two sweeps of the Brennan-Schwartz algorithm in two directions is enough to recover the exact solution.


Generative Smooth Arbitrage-Free Non-Parametric Option Surfaces (DYSANOS)

Hans Buehler (University of Oxford) · Blanka Horvath (University of Oxford) · Raeid Saqur (University of Oxford) · Yannick Limmer (University of Oxford) · Anastasis Kratsios (University of Toronto)

We present a smooth arbitrage-free non-parametric option surface model (SANOS), the first of this kind. We discuss fitting the market and then show how this model can be used to generate time series of arbitrage-free option surfaces both under the statistical and a risk-neural measure. (DYSANOS).


Meshless cluster induction and Gaussian Kissing

Peter Jaeckel (OTC Analytics)

We give a survey on meshless induction methods based on radial basis functions for diffusion PDEs, and their ramifications as the problem dimension is increased beyond 7. We demonstrate that the representation quality depends strongly on the cluster distribution uniformity which in turn is linked like a cliff-edge to the (Gaussian) Kissing Number.

Wednesday 11.10-12.50

Expand All

Optimizing and Learning over the Space of Probability Measures to Manage Flexibilities in Power Systems

Thibaut Bourdais (ENSTA) · Margaux Brégère (Sorbonne Université) · Pierre Gaillard (INRIA) · Bianca Marin Moreno (INRIA) · Nadia Oudjane (EDF) · Francesco Russo (ENSTA)

With the massive integration of renewable energies (photovoltaic (PV) and wind power) into the power grid, new uncertainties are impacting the power balance. At the same time, advances in smart technologies and batteries offer new flexibilities with the possibility of controlling the consumption of a large number of electrical appliances (electric vehicle recharging, heat pumps, etc.). In this framework, a major technical challenge is to manage this large number of flexible agents to help in balancing the system. By using mean-field approximations, we shift from analyzing individual agents to studying their distribution, making it easier to control large populations. We then consider a mean-field control problem formulated as an optimization problem over the space of probability measures. To address the challenges posed by unknown environments, we introduce adaptive algorithms based on principles from both online convex optimization and convex reinforcement learning theory.

Forward-Backward Finite-Differencing for XVA in small netting sets

Peter Jäckel

We give details of a framework for the computation of Expected Positive Exposure profiles and Credit Value Adjustments based on finite differencing methods. The methodology combines the backward and the forward Kolmogorov equation to generate future exposure distributions from which the various risk measures can be inferred. The framework bypasses the usual difficulties associated with Monte Carlo simulation based approaches and, for small to moderate portfolios, is fast and efficient.

Wednesday 14.00-15.40

Expand All

Organiser: Hans Buehler
 

Information Leakage and Opportunistic Trading Around the FX Fix

Johannes Muhle-Karbe (Imperial College London) · Roel Oomen (Deutsche Bank) · Mateo Rodriguez Polo (ETH Zürich)

When dealers hedge large currency fix exposures on behalf of their clients, this can lead to predictable price patterns that opportunistic traders can exploit. We show that the cost of this information leakage is predominantly borne by the client, but that it can be partially mitigated when the dealer hedges some of their exposure ahead of the fixing window. The dealer also benefits from such a strategy because it lets them average in at a hedging price that is favourable compared to where the fix is expected to settle. Information leakage therefore mitigates a conflict of interest that would otherwise exist by aligning the interests of the dealer and the client against those of the opportunistic trader.


Passive Impact

Yadh Hafsi (DeepFin Research) · Nathan Pinel (DeepFin Research) · Qi Liu (DeepFin Research)

We develop a market-impact framework for passive trading in listed futures, using tick-level MBO data to study child orders and fills far smaller than those in classical impact studies. We find material instantaneous impact: volatility-adjusted impact scales with order-flow participation and is estimated using heteroskedasticity-robust inference. Transient impact is modeled with normalized response functions, fitted using power-law and constrained multi-exponential kernels, and compared with a ridge-regularized bare propagator recovered from trade-sign autocorrelation moments. Under suitable sampling and event-grouping, the transient component consistently exhibits the power-law decay predicted by long-memory microstructure theory. The full framework is implemented with rolling out-of-sample refits.


Robust Learning Under Ambiguity in Data-Driven Trading

Ben Wood (JPMorgan Chase)

The successful application of machine learning techniques in trading, as in other areas, relies on appropriate training datasets. Implicitly, these datasets embed our beliefs about the probabilities of future events, but these beliefs are generally subject to some uncertainty, known as ambiguity.

In this talk I will introduce ambiguity and the application of ambiguity-averse decision frameworks to machine learning in trading. I will discuss the limitations of a purely worst-case approach, and present recent work on more balanced ambiguity aversion for hedging problems, which aim to deliver robustness without excessive conservatism.

There is an important distinction between static and dynamic ambiguity. In financial markets, uncertainty persists through time, even as more data arrives. I will discuss our work on the implications of non-vanishing ambiguity for dynamic trading problems, and the limitations of static ambiguity.

 

 

Organisers: Leandro Sánchez-Betancourt; Jonathan Tam
 

Continuous Time Reinforcement Learning with Regime Shifts via a Change Point Approach

Alvaro Cartea (University of Oxford) · Leandro Sánchez-Betancourt (University of Oxford) · Jonathan Tam (University of Oxford) · Horace Yiu (University of Oxford)

We develop an exact, finite-dimensional exploratory reinforcement-learning framework for continuous-time changepoint detection and control under partial observability, extending Wang et al. to a regime-switching setting with doubly unknown drift. Coupling a Wonham filter with conditional Kalman–Bucy filters over compactly supported (pre-change) and N-point discrete (post-change) priors yields a Markovian sufficient statistic driven by a single innovation Brownian motion. We construct a strict viscosity subsolution barrier and prove a comparison principle, giving well-posedness of the entropy-regularised HJB equation. Future work allows us to solve the pointwise entropy-regularised optimisation inside the HJB to yield an explicit, implementable exploration policy for linear-quadratic costs.


How much should we care about what others know? Jump signals in optimal investment under relative performance concerns

Peter Bank (Technical University Berlin) · Gemma Sedrakjan (Technical University Berlin)

We present a multi-agent and mean-field formulation of a game between investors who receive private signals informing their decisions and who interact through relative performance concerns. A key tool is a Poisson random measure driving jumps in market prices and signal processes, capturing common and idiosyncratic noise. Upon receiving a jump signal, investors evaluate not only its implications for stock price movements but also for their peers' signals and subsequent decisions. A crucial aspect is the economy's distribution of investor types, determining risk aversion, performance concerns, and signal quality and quantity. We demonstrate how these factors are reflected in HJB equations, characterizing optimal responses to peers' signal-based strategies. Equilibria existence in both games is established using Schauder's Fixed Point Theorem under suitable conditions on investor characteristics, particularly signal processes. Finally, numerical case studies illustrate these equilibria, addressing how much investors should care about the information known by their peers.


Optimal stopping and divestment timing under scenario ambiguity and learning

Andrea Mazzon (University of Verona) · Peter Tankov (ENSAE-CREST, Institut Polytechnique de Paris)

Aiming to analyze the impact of environmental transition on the value of assets and on asset stranding, we study optimal stopping and divestment timing decisions for an economic agent whose future revenues depend on the realization of a scenario from a given set of possible futures. Since the future scenario is unknown and the probabilities of individual prospective scenarios are ambiguous, we adopt the smooth model of decision making under ambiguity aversion of Klibanoff et al (2005), framing the optimal divestment decision as an optimal stopping problem with learning under ambiguity aversion. We then prove a minimax result reducing this problem to a series of standard optimal stopping problems with learning. The theory is illustrated with two examples: the problem of optimally selling a stock with ambiguous drift, and the problem of optimal divestment from a coal-fired power plant under transition scenario ambiguity.


Trading with uncertainty about signals and price impact

Johannes Muhle-Karbe (Imperial College London) · Sturmius Tuschmann (Imperial College London)

*Held in Room A

We study optimal trading with uncertainty about both trading signals and price impact. Rather than treating all models within a prespecified class as equally plausible, we penalise less likely ones according to their distance from a reference model. In the limit of small uncertainty aversion, this yields closed-form expressions for the optimal robust trading strategy. In a simulation study with noisy parameter estimates, we find that optimal regularisation via uncertainty aversion markedly improves performance compared to plug-in strategies based on point estimates only. For weak signals, impact uncertainty only plays a secondary role but rapidly becomes dominant as signal strength increases.

Efficient decumulation strategy with long-term care insurance and guaranteed minimum death benefit

Jonathan Ziveyi (UNSW Sydney) · Jennifer Alonso-Garcia (Université Libre de Bruxelles) · Mengdie Hu (UNSW Sydney) · Yuxin Zhou (UNSW Sydney)

The global shift from defined benefit to defined contribution pension systems has transferred longevity, health, and market risks to individuals, encouraging precautionary saving and restrained retirement consumption. We propose a decumulation strategy that combines long-term care insurance (LTCI) and a guaranteed minimum death benefit (GMDB), purchased at retirement, with a withdrawal-then-rebalance investment approach. Retirement wealth follows a regime-switching process, while a target-volatility strategy dynamically adjusts asset allocation to smooth wealth trajectories and limit extreme losses. LTCI insures late-life healthcare expenditures, and the GMDB secures a minimum bequest, jointly supporting consumption confidence and legacy objectives. Numerical experiments compare consumption outcomes under the proposed strategy with standard account-based pension drawdown rules. The results show smoother lifetime consumption and greater resilience to adverse market shocks. Sensitivity analyses across insurance allocations, health-state transitions, and volatility targets indicate that moderate volatility targets balance risk and sustainability and that performance is robust across health scenarios.


Execution-Aware Pairs Trading: A Stochastic Control Formulation for Illiquid Commodity Markets

Tobias Jung (Uniper Global Commodities SE)

European energy markets exhibit structurally cointegrated relationships across gas and power instruments: time spreads along the forward curve, location spreads between hubs such as TTF (continental Europe) and NBP (UK), and cross-commodity spreads driven by fuel conversion. Unlike equity markets, however, these contracts trade in illiquid order books with wide, leg-specific bid--ask spreads, small lot sizes, and infrequent executions, rendering the frictionless rebalancing assumptions underlying classical pairs-trading models untenable.

We develop an execution-aware stochastic control framework for asymmetric pairs-trading that integrates cointegrated price dynamics with realistic order-level execution frictions. Trading decisions are per-leg limit- and market-order postings under stochastic fills, inventory constraints, and imbalance penalties, yielding a coupled diffusion--jump control problem. The model is solved via a finite-horizon dynamic-programming scheme using exact one-step diffusion transitions and high-accuracy quadrature. The resulting policies illustrate how optimal pairs-trading behavior changes when execution risk and market illiquidity are incorporated directly into the control problem.


Data-Driven Duration Management: Term Structure Forecasting Using Machine Learning

Tobias Lausser (Technical University of Munich)

Predicting movements of the term structure of zero rates is a central task in fixed-income portfolio management: Small perturbations of any of the key yield-curve factors (level, slope and curvature) may have significant impact on portfolio valuation, risk metrics and relative performance. Duration management provides an intuitive investment approach: investors anticipating declining yields may increase duration to benefit from increasing prices and investors anticipating rising yields may decrease duration to limit losses. The performance of such strategies highly depends on the robustness and accuracy of the underlying yield forecasts.

In our contribution, we propose several forecasting procedures that combine classical methods and machine learning, and develop an evaluation framework based on statistical metrics and economic performance in duration management. The forecasting methods connect dimension reduction techniques and time-series forecasting in the latent space, allowing the inclusion of macroeconomic factors. We apply the framework to both U.S. and European yield-curve data.


A Causal Machine Learning Framework for Municipal Bond Spread Determinants: Japanese Evidence Around NIRP

Yasuhiro Tamba (Seinan Gakuin University) · Kentaro Haraguchi (Seinan Gakuin University) · Keiichi Oishi (Kyushu University)

We identify causal determinants of credit spreads in the Japanese municipal bond market around the January 2016 Negative Interest Rate Policy (NIRP). Using JSPrice secondary-market transactions over 2015--2020, we apply Causal Forest and Double Machine Learning, with robustness checks via 2SLS, propensity score matching, and additional methods. The real debt service ratio exhibits the largest positive causal effect on spreads across all methods. We document a structural shift around NIRP: aggregate CATE compressed by 69%, and the share of fiscal-soundness indicators in spread pricing collapsed, indicating that municipal fiscal health largely ceased to be priced under ultra-low rates, reflecting suppressed cross-municipality differentiation rather than improved market efficiency. Heterogeneity analysis shows small municipalities are about three times more fiscal-sensitive than large ones, consistent with a too-big-to-fail mechanism. SHAP-based predictive importance largely overlaps with causal rankings, while divergences reveal confounding.

Organisers: Roxana Dumitrescu; Olivier Feron; Nadia Oudjane
 

Graph-based high-dimensional time series modelling for energy markets: Inference for Levy-driven graph supOU processes

Almut Veraart (Imperial College London)

In this talk, we introduce Levy-driven graph supOU processes, a parsimonious and interpretable class of models in which the dependence between components is governed by an underlying graph structure. This construction bridges short- and long-range dependence within a single parametric family while accommodating a broad class of marginal distributions, making it particularly well suited to applications in energy systems. We develop a generalised method of moments estimator for this model class, establish its consistency and asymptotic normality, and assess its finite-sample performance through a simulation study. To illustrate the practical relevance of the framework, we present an empirical application to wind capacity factors within a European electricity network, demonstrating how the graph structure can reflect the spatial and physical connectivity of energy systems.


A Principal-Agent Game of Offset Credit Markets with Strategic Risk-Averse Agents

Sebastian Jaimungal (University of Toronto) · Liam Welsh (University of Toronto)

We study a principal-agent model of a greenhouse gas offset credit market in which a regulator chooses the penalty for non-compliance and the probability that submitted projects are approved for credits, while strategic agents interact in a game when deciding whether and when to generate and trade offset credits. Agents account for price impact from generation, uncertainty in project approval, and terminal penalties, and evaluate outcomes under exponential utility to incorporate risk aversion. The principal’s (regulator's) objective is to maximize the probability that aggregate generated offset credit exceeds a prescribed minimum threshold, thereby ensuring sufficient environmental impact while maintaining market efficiency. The resulting framework combines stochastic control, game theory, and mechanism design, yielding equilibrium characterizations that highlight how penalties, approval uncertainty, and market impact jointly influence agents’ behavior and the likelihood of achieving target levels of offset generation.


Co-optimization of Battery Storage Dispatch Across Day-ahead and Real-time Power Markets

Mike Ludkovski (University of California Santa Barbara)


Schrödinger interpolations for time series generation - applications to financial and energy data

Marius Chevallier (École Polytechnique) · Stefano De Marco (École Polytechnique) · Huyen Pham (École Polytechnique) · Davide Zanni (École Polytechnique)

We explore the applications of entropic optimal transport, with a formulation analogous to continuous-time Schrödinger bridges, to the problem of time series generation. We extend the continuous-path framework set up by [Hamdouche, Henry-Labordère and Pham, 2023] to jump-diffusions, therefore allowing for jumps in the trajectories of the output generative process. We discuss the implementation of the resulting generative model, focusing on benchmark multi-dimensional data sets of financial and energy variables (resp. Equity returns and energy consumption).

Shaping volatility surfaces with optimal transport: arbitrage repair, stress-testing, and scenario generation

Marius Chevallier (Ecole Polytechnique) · Stefano De Marco (Ecole Polytechnique) · Pierre-Emmanuel Lévy-dit-Vehel (Société Générale)

We propose a framework based on optimal transport for performing risk management tasks on implied volatility surfaces. It addresses arbitrage removal, arbitrage-free stress testing, and generation of volatility surfaces. Starting from a set of implied volatilities on a discrete grid, we construct a vector of marginals consistent with the observed data. It is then transformed by minimizing a functional involving Monge-Kantorovich value functions. The feasible set consists of vectors of probabilities increasing in the convex order, ensuring that the data generated by the solution is arbitrage-free. Depending on the application, we motivate how cost functions of Monge-Kantorovich problems can be chosen. We illustrate the method with concrete examples. To handle signed input marginals that appear when the input implied volatilities exhibit arbitrage, we introduce a generalized notion of couplings beyond the classical nonnegative case. Under suitable assumptions, our generalization recovers known results in the nonnegative setting.


Computing the implied volatility through neural networks with asymptotic regimes

Samira Amiriyan (University of Liverpool) · Youness Boutaib (University of Liverpool)

Accurate and efficient computation of implied volatility is a fundamental problem in financial mathematics, with important applications to option pricing, model calibration, and risk management. Recent studies have explored neural-networks for this task, but existing approaches often lose precision in extreme regimes, such as very small or large strikes and maturities. In this paper, we propose a neural-network architecture that incorporates key structural features of implied volatility surfaces directly into the learning process. Inspired by Jäckel's regime-based methodology, we partition the price--log-moneyness domain into three regions and train the model to learn both a suitable partition of unity and regime-specific approximations of implied volatility. Numerical results show that the proposed design improves robustness and generalisation across the whole domain, delivering more accurate and more stable predictions than standard neural-network methods and widely used asymptotic approximations. This work links machine learning for finance, volatility modelling, and derivatives pricing through structure-aware methods.


Convex Volatility Interpolation

Fabrice Deschâtres (Volptima)

Convex volatility interpolation (CVI) casts the problem of fitting arbitrage-free implied volatility surfaces as quadratic programming in variance space. It introduces a dual parametrisation in cubic spline and B-spline spaces, mapping intuitive, dimensionless parameters to the weights of basis functions. Static arbitrage constraints, butterfly and calendar spread, are enforced through linear inequalities. This paper derives and linearises the no-butterfly-arbitrage constraints within the CVI cubic spline parameter space. Notably, the no-butterfly-arbitrage condition is derived in closed form in the linear variance extrapolation region beyond the edge knots. The formulation is model-free, bid-ask-aware, and requires no hyperparameter tuning, working consistently across underlyings. Convexity guarantees a unique global optimum, eliminating the calibration fragility of parametric approaches. Using the Clarabel conic solver, CVI fits the full S&P 500 surface, 14,500 bid-ask quotes across 46 expiries, in 0.15 seconds.


Approximation of the implied volatility surface with Hermite functions

Guido Germano (University College London) · Lorenzo Lombardi (Università degli Studi di Salerno) · Carlo Marinelli (University College London)

We study an approximation of the implied volatility surface based on projecting the square root of the density function of the logarithmic return of the underlying on finite-dimensional vector spaces of L2(ℝ) generated by Hermite functions with time-dependent scale and shift parameters. The logarithmic return at time t is approximated in law by the expression α(t)X+β(t), where α(t)=a√t+bt, with a and b constants, X a random variable admitting a density, and β specified in terms of α. A semiparametric approximation scheme is then obtained expanding the density of X in terms of the square of a linear combination of Hermite functions up to order N. The Black-Scholes model is included as a particular case for N=0. We empirically test our approximations with N=0,...,8 (d=N+2 degrees of freedom) on a EUR-USD implied volatility surface and compare their accuracy to that of Heston (d=5) and double Heston (d=10) models.

Organiser: Blanka Horvath
 

Credit - Equity Revisited

Matthias Arnsdorf (JP Morgan Chase)

Most counterparties do not have traded Credit Default Swap (CDS) instruments. This poses a challenge for calculating the Counterparty Valuation Adjustment (CVA) which relies on risk-neutral default probabilities. Here we present a new model for the estimation of credit spreads using equity market data. In contrast to more traditional credit-equity models, we take an empirical approach in order to determine a simple functional relationship that can be used in practice for CVA risk management. We find that our model out-performs models that rely solely on credit data as well as alternative credit-equity models in the literature.


BSDEs anticipated in conditional distribution : existence, comparison, Feynman-Kac representation, and approximation

Stéphane Crépey (Université Paris Cité) · Aurélien Grenard (Sorbonne University) · Cyril Bénézet (ENSIIE)

In this work, we introduce and study a class of anticipated backward stochastic differential equations (ABSDEs) whose driver depends on the conditional distribution of a functional of the solution in the future. This framework unifies and extends previous works on ABSDEs, including those where the dependence occurs through conditional expectations or conditional risk measures, e.g. the FVA and KVA ABSDE system that arises when one accounts for the fungibility of capital at risk and variation margin. Under suitable assumptions, we establish a priori estimates, existence and uniqueness of square integrable solutions, and a comparison principle. In the Markovian case, we prove that the solution admits a Feynman-Kac representation in terms of a deterministic function of the underlying factor process. This value function solves a PDE nonlocal in both time and space in the viscosity sense. Last, we show that an implicit ABSDE time-discretization scheme achieves the classical square-root convergence rate.


Branching Simulation for Evaluation of Conditional Expectations

Anas Bakkali (NatWest Markets) · Andrew Greene (NatWest Markets) · Nikolai Nowaczyk (NatWest Markets) · Vladimir Piterbarg (NatWest Markets)

High-performance pricing engines are central to XVA and counterparty credit risk. Methods such as Longstaff-Schwartz regression have been widely used, but assessing their performance has always been a challenge. Traditionally, benchmarking requires either: Costly nested MC simulations, analytical pricers (often unavailable for exotics), or statistical approaches that rely on assumptions that often don't hold.

We present a branching simulation method that:

  • Computes a mean squared pricing error for any given pricer without nested Monte Carlo or knowledge of the true analytical price;
  • Is fast, assumption free and easy to monitor;
  • Guides model choices (e.g. feature selection, polynomial degree in regression pricers);
  • Derives conservative bounds for CVA error, and then tightens them using forward MtM moments from multi-branch simulations;
  • Enables automated goodness-of-fit assessments for pricing models.

Anomaly Detection

Gordon Lee (BNY)

 

Wednesday 16.10-17.00

Expand All

Surfing the AI Tsunami: Challenges and Opportunities for Quant Finance

Moderators: Blanka Horvath (University of Oxford) · Jan Obłój (University of Oxford). Panellists: Asita Anche (Barclays) · Hans Buehler (University of Oxford) · Francesco Fermani (G-Research) · Charles-Albert Lehalle (Ecole Polytechique) · Ben Wood (JPMorgan Chase)

In this panel we will discuss how teaching/assessment/research need to change in the AI era and what our community can learn from the ML/CS examples. We will consider building an open benchmark-leaderboard resource and what it would need to look like to be of real use to both industry and academia. We will hear from industry participants their views on student competitions/hackathons and what signals they trust when hiring. The panel will feature live anonymous polls answered by the audience. 

Thursday 9-10.40

Expand All

A posteriori error control for numerical solutions of the (regularised) UVM

Lokman Abbas-Turki (SU) · Jean-François Chassagneux (CREST-ENSAE, Institut Polytechnique de Paris) · Jean-Philippe Lemor (BNP) · Grégoire Loeper (BNP) · Simon Sananes (UPC)

In this talk, we discuss a posteriori error control for numerical solutions of European option pricing problems under the Uncertain Volatility Model (UVM) and its regularised version. We first present a numerical method based on stochastic policy gradients for approximating the option price. By construction, this approach provides a lower bound on the true price. For industrial applications, however, this can be unsatisfactory. We therefore construct an upper bound that can also be approximated numerically to provide a computable certificate on the pricing error. The construction is based on PDE residuals and can be interpreted as an a posteriori error estimate. Finally, for the regularised UVM, as well as for related Hamilton-Jacobi-Bellman equations, we discuss theoretical error estimates derived from this residual-based a posteriori control.

Strategic Focus or Diversification? Numerical Solutions for Climate-Technology Investment under Budget Constraints

Alessio D'Amato (University of Napoli Parthenope) · Katia Colaneri (University of Rome - Tor Vergata) · Rüdiger Frey (WU Vienna)

We study the dynamic allocation of a constrained investment budget between renewable-energy infrastructure (RES) and carbon capture and storage (CCS). The two technologies differ fundamentally in their development dynamics: renewable capacity can be expanded once infrastructure investment reaches a critical threshold, whereas CCS becomes available after an uncertain research breakthrough whose arrival intensity depends on R&D expenditure. We formulate the social planner’s problem as a stochastic control problem and characterize the optimal policy through a system of coupled HJB PIDEs. The numerical analysis of the solutions to these equations is a key contribution of our work. This allows us to interpret the feedback-form characterization, quantify the resulting state- and time-dependent controls, and systematically compare alternative allocation strategies in terms of costs, investment timing, technology deployment, and cumulative emissions. To do this, we use direct PIDE methods that exploit the known mathematical structure and yield transparent, reproducible policies with controllable discretization errors.

Thursday 11.10-12.50

Expand All

Organiser: Roxana Dumitrescu
 

Learning to Remove the Drift

Mikko Pakkanen (Imperial College London)


Buy it, Store it, Sell it: On the Optimality Gap of the Rolling Intrinsic Strategy 

Olivier Guéant (Université Paris Cité)


Constrained Deep Learning for Pricing and Hedging European Options in Incomplete Markets

Nicolas Baradel (École Polytechnique)


Learning generative dynamics with soft distributional constraints

Huyên Pham (École Polytechnique)

We propose a stochastic-control framework for learning diffusion dynamics from endpoint and intermediate distributional observations. The problem is formulated as a McKean–Vlasov control problem combining quadratic control costs with soft penalties on discrepancies between observed and model-implied marginal laws. The optimality conditions yield a McKean–Vlasov forward-backward stochastic differential equation, which motivates a sample-based neural solver using score-difference and Sinkhorn-gradient estimators. The framework is relevant to model calibration, scenario generation, and learning distributional dynamics in finance. Numerical experiments show that intermediate observations help identify coherent path laws beyond what can be recovered from endpoint data alone.

Organisers: Long Teng; Phillip Yam
 

Designing collective investment strategies with machine learning

John Armstrong (King's College London) · Rohan Hobbs (King's College London)

Computing optimal investment strategies for pension investment has historically been either computationatlly expensive, or required unrealistic analytic approximations. With machine learning techniques, we can simultaneously learn the solution to a family of problems and then quickly compare the outcomes. This provides a practical tool that can be used by practitioners to identify good quality pension scheme designs. We illustrate its effectiveness by finding a collective pension scheme design which significantly outperforms the CDC pension design currently allowed in UK pension scheme legislation.


Distribution-free shrinkage of high-dimensional mean vector

Vali Asimit (City St George's, University of London) · Ziwei Chen (City St George's, University of London) · Nathan Lassance (Université Catholique de Louvain)

We introduce shrinkage estimators of the sample mean vector in high dimension. Our estimators share desirable properties relative to existing methods: they are distribution-free, consider bona-fide target estimators, and use simple estimators of the shrinkage intensities independent of the precision matrix which are L2 consistent in high dimension. Unlike existing estimators that impose that the whitened data be an i.i.d. matrix, we only impose i.i.d. across sample observations. We require uniform boundedness of the first four moments, and the high-dimensional asymptotics are in a general Kolmogorov setting where N/T=O(1) as T→∞, with N the mean-vector dimension and T the sample size. We consider as a target estimator either zero or the grand mean. Simulations show that our shrinkage estimators are competitive with a range of benchmark estimators. Finally, we apply our estimators to constructing mean-variance portfolios of a large number of stocks, and find that they deliver robust out-of-sample Sharpe ratios.


Optimal life annuitisation and investment strategy in a stochastic mortality and financial framework

Griselda Deelstra (Université Libre de Bruxelles) · Pierre Devolder (Université Catholique de Louvain) · Fabio Viviano (University of Calabria)

We consider the problem of retired individuals' choices regarding the allocation of their wealth between classical financial investments and life annuities during their post-retirement phase to maximize their future utility. We consider in particular an Equity-Linked Annuity Defined Contribution (ELA-DC) scheme and generalize it by allowing partial annuitisation, with the possibility of taking into account bequest motives. We study this new framework by formulating it as a continuous-time dynamic optimization problem, in which both the investment proportions as well as the annuitisation proportions are the controls. To solve this complicated dynamic portfolio optimization problem, we rely on simulation and regression techniques; in particular, we exploit the well-known Least-Squares Monte Carlo methodology, which is able to handle multivariate stochastic state variables, by combining the Monte Carlo simulation of the state variables with the regression estimates of the conditional expectations in the dynamic programming equations.


Drift-admissibility via Optimal Transport

Abigail Langbridge (Imperial College London) · Enrico Biffis (Imperial College London) · Robert Shorten (Imperial College London) · Jakub Marecek (Czech Technical University)

We introduce a class of structure-aware optimal transport diagnostics for assessing whether empirical time-series dynamics are compatible with a prescribed predictable-drift class. Our approach translates a pathwise property of stochastic processes into a finite-dimensional projection problem over empirical transition laws. Specifically, we project local couplings onto a set of transport plans satisfying row-wise moment constraints, and quantify the resulting deviation via a Kullback--Leibler projection gap. This formulation yields both a principled diagnostic and a scalable algorithm which retains the efficiency of Sinkhorn-type methods while incorporating structural constraints. Empirically, the proposed projection score captures systematic deviations from drift admissibility beyond standard variation-based diagnostics. Rather than performing full continuous-time recovery, our framework provides a data-driven, observation-level measure of model compatibility with a chosen admissible class. This positions the method as a general tool for structure-aware model validation.

Organisers: Chiheb Ben Hammouda; Kees Oosterlee
 

On a damped version of the Shannon wavelets inverse Fourier technique (SWIFT) for pricing options

Chiheb Ben Hammouda (Utrecht University) · José Germán López Salas (University of A Coruña) · Cornelis Oosterlee (Utrecht University) · Davide Trevisani (University of A Coruña)

We present a numerical method for pricing European options based on a modified version of the SWIFT method introduced in OrtizOosterlee2016. The key idea is to apply a damping transformation to the payoff function, which enables the direct computation of Fourier coefficients in the frequency domain without truncating the integration range.

We provide a rigorous analysis of the decay of these coefficients by exploiting the singularities of the associated Fourier transforms. The resulting sharp bounds make it possible to truncate the Fourier series without relying on the cumulants of the underlying density, which are often unavailable or difficult to compute in practice.

Besides, we propose a strategy for selecting the damping parameter that minimizes the quadrature error arising in the computation of the Fourier coefficients. Numerical experiments demonstrate that the proposed approach consistently improves the accuracy of the original SWIFT method while requiring a significantly smaller number of Fourier coefficients.


Pricing path-dependent options with arbitrary accuracy (Part I: Lipschitz continuous payoffs)

Riccardo Brignone (University of Pavia) · Gero Junike (LMU Munich)

We propose a unified methodology for pricing general path-dependent derivatives, such as Asian, variance, lookback options. The proposed approach is based on the Monte Carlo Conditional Fourier-cosine method and works for a broad class of stochastic volatility models. The main benefit of the new algorithm consists in a simple control of the error. A practitioner provides the algorithm with two parameters: (i) a probability, q; (ii) an error tolerance, ε. Then, our algorithm provides a price approximation that differs by no more than ε from the true unknown option price with probability at least equal to q. In other words, we can easily control the accuracy of the price approximation, contrarily to other approaches available in the literature. We provide explicit formulas linking the variance of the simulation estimator of the option price, the error tolerance, the number of simulations, rendering possible to reduce computing times through variance reduction techniques.


Pricing path-dependent options with arbitrary accuracy (Part II: Barrier options)

Gero Junike (LMU Munich) · Riccardo Brignone (University of Pavia)

Based on the Monte Carlo Conditional Fourier-cosine method, we develop a new approach for pricing barrier options under a broad class of stochastic volatility models. We prove that it is possible to obtain full error control: A practitioner needs to provide the pricing algorithm with two parameters: (i) a probability, q; (ii) an error tolerance, epsilon. Then, the price approximation computed via our proposed approach differs by no more than epsilon from the true unknown option price with probability at least equal to q. The numerical efficiency of the proposed methodology depends on the variance of the Monte Carlo simulation estimator. Therefore, to reduce computing time, we embed variance reduction techniques, such as control variates and conditional Monte Carlo, into the pricing algorithm. Numerical results show that our pricing approach is more efficient/reliable than alternative benchmark methods available in the literature.


A2MIS: Autonomous Adaptive Mixed Importance Sampling for multidimensional Fourier-based pricing integrals

Laura Ballotta (Bayes Business School) · Ernst Eberlein (University of Freiburg) · Ziyang Huang (Bayes Business School)

The pricing of option contracts via Fourier transform methods requires in certain instances the numerical evaluation of high-dimensional integrals, a task which becomes increasing challenging as the dimension of the underlying asset space grows and deterministic quadrature methods suffers due to the curse of dimensionality, which is specifically the case of multi-asset options. Hence, we propose the Autonomous Adaptive Mixed Importance Sampling (A2MIS) algorithm for the efficient computation of these integrals, which learns the parameters of the proposal and autonomously stops the procedure once a pre-fixed precision level is met. We illustrate the computational efficiency of A2MIS by comparing its performance against basic importance sampling and standard Monte Carlo simulation on pricing popular correlation derivatives.

Organisers: Matthias Ehrhardt; Carlos Vázquez Cendón; Daniel Sevcovic
 

Valuation of a mine project with abandonment option and a price dependent extraction rate

María Suárez-Taboada (University of A Coruña) · Carlos Vazquez Cendon (University of A Coruña)

In this talk we address the mathematical modelling and numerical simulation of a mining extraction project under uncertainty. The main innovative aspects come from the joint consideration of a more realistic extraction rate depending on the commodity price and the possibility of abandonment of the extraction project. Unlike in the constant extraction rate, we obtain an hipoelliptic PDE operator governing the models, which allows the mathematical analysis of the mine valuation problem to obtain the existence and uniqueness of solution of the complementarity problem formulation. Additionally, the models that govern the probability of completion and expected lifetime of the project are proposed. Appropriate boundary conditions and numerical methods are applied for the numerical simulation of the different models. Finally, the example of a real mine dataset allows to discuss the numerical results and compare them with the case of constant extraction rate.


Mixture Models in Quantitative Finance

Joerg Kienitz (University of Cape Town, University of Wuppertal)

In this talk we consider methods for computing conditional expectations and simulating sythetic data and their widespread applications in Quantitative Finance.

The methods are based on finite mixtures of distributions - the most prominent being Gaussian mixture models.

The methods we consider are data driven. Once numerically fitred to data the further computations are analytic! Option pricing (with early exercise) in one / multiple dimensions, hedge sensitivities, calibrating Local-Stochastic-Volatility models and simulating synthetic high-dimensional data including yield curve in multiple currencies or implied volatiltiy surfaces are considered taking into account no-arbitrage considerations. The results are fully explainable in terms of generalized principle components.

Some results have been published in the cutting edge section of Risk, 2022 and 2025 under the titles "Semi-analytic conditional expectations", resp. "Gaussian Gen-AI: Synthetic market data generation".

Finally, the methods are extended to incorporate fat-tailed distributions that are important for risk considerations and generating stress scenarios.


Optimal trading in day-ahead power markets with battery storage

Tony Ware (University of Calgary)

Continuously-traded day-ahead power markets provide the opportunity to trade in hourly (or perhaps shorter) blocks. Owners of battery storage can take positions that capture 'intrinsic value' from differences in those prices, with the battery guaranteeing that the positions can be fulfilled physically (i.e. are rateable). Moreover, they can adjust those positions when doing so would increase the net value of their position (while still being rateable). This is a rolling rated position, and if the intrinsic value is maximized at each point, it is called a rolling intrinsic value strategy. We propose a PMPP model (i.e. a Polynomial Map of a Polynomial Process) to capture the dynamics of the day-ahead price curve, and show how this can be used to determine a strategy that maximizes the expected revenue from a rolling rated position, providing a comparison with the expected revenue rolling intrinsic value strategy.


High-order IMEX-LDG methods for the numerical solution of multidimensional nonlinear parabolic PDEs: Applications to XVA

Joel Pérez Villarino (University of A Coruña) · Manuel J. Castro Díaz (University of Málaga) · José Antonio García Rodríguez (University of A Coruña) · José Germán López Salas (University of A Coruña)

We develop a high-order IMEX-LDG scheme based on the sparse grid combination technique for solving nonlinear parabolic PDEs in moderate to high dimensions. The method combines the advantages of LDG methods for convection-diffusion problems, IMEX-RK time integrators for stiff systems, and the combination technique to mitigate the curse of dimensionality. The resulting scheme is robust, efficient, highly scalable, and fully parallelized via MPI. We apply this methodology to solve nonlinear valuation problems arising in quantitative finance, specifically focusing on the computation of XVA within the Burgard-Kjaer framework.

Bayesian Methods for Neural Stochastic Processes in Finance

Eva Flonner (Vienna University of Economics and Business)

This talk explores a general framework for learning and calibrating neural stochastic processes from data, with a focus on applications in quantitative finance. We begin by discussing approximation properties of neural stochastic processes highlighting their ability to represent a broad class of stochastic dynamics within a unified functional framework. In particular, we consider a quantitative universal approximation theorem, relying on Barron-type estimates, which provides explicit error bounds in terms of the neural network architecture.

Building on these theoretical results, we adopt a Bayesian approach to calibration and uncertainty quantification, enabling robust inference from heterogeneous data sources. We explore two complementary inference strategies. On the one hand, we consider gradient-based Bayesian calibration methods, specifically Langevin-type sampling algorithms. On the other hand, we investigate Expectation--Maximization algorithms tailored to models under partial or incomplete information.

We demonstrate the practical relevance of this framework through applications to financial modeling tasks.


When Drift Breaks: Particle-Based Regime Inference for Crash Detection

Lutz Plümer (University of Bonn)

Financial crashes are routinely treated as anomalies, yet they are a recurring structural feature. Standard tools rely on assumptions --- Gaussian returns, stationary volatility, continuous drift --- that fail when early detection matters most.

Reisinger (2023) addressed regime discontinuities through random particle injection. Particle filters were pioneered by Thrun (2006) in robotics, where random injection recovers localization after kidnapping or sensor failure. In contrast, we inject particles carrying signatures of prior crashes --- immunizing the filter with structural memory.

Our observation model encodes distribution shapes across multiple time scales, motivated by point detectors from computer vision, complemented by classical indicators including VIX and CBOE SKEW. (Un-)supervised classification with k-NN and Random Forest provides pointwise regime labels, Viterbi path inference ensures temporal consistency, and particle filtering tracks regime evolution across seven states.

We demonstrate results across three distinct crashes: the Global Financial Crisis, COVID-19, and the April 2025 tariff shock (out-of-sample).


Computational Bayesian Portfolio Selection via Relative Entropy

Jan Vecer (Charles University)

This talk presents a computational framework for portfolio selection and hedging based on the interpretation of prices as likelihood ratios. In this formulation, optimal investment can be viewed as a projection of an investor's subjective model onto the set of tradable payoffs, measured by relative entropy. The same perspective links Kelly growth, Bayesian model averaging, and incomplete-market hedging within a unified probabilistic framework. The approach provides tractable discrete-time implementations and clarifies continuous-time limits, including connections to minimum-variance hedging. Its relevance to computational finance lies in turning portfolio construction and hedge design into explicit statistical optimization problems that can be implemented numerically under heterogeneous beliefs and incomplete models.


Empirical performances of the Bayesian generalized recovery

Eva Luetkebohmert (University of Freiburg) · Riccardo Brignone (University of Pavia) · Sven Knaust (University of Freiburg)

We propose a new approach to recover physical probabilities from quoted option prices by addressing data errors in the implied volatility surface. Building on the generalized recovery theorem of Jensen et al. (2019), we use Bayesian calibration with sequential Monte Carlo methods to account for model uncertainty. Our method improves upon existing techniques by incorporating the full posterior distribution of model parameters. We show that our approach produces robust physical densities, outperforming prior methods in portfolio optimization using a Mean-CVaR strategy. Our findings suggest that Bayesian-based recovery yields more accurate and predictive results than conventional methods.

Organisers: Eduardo Abi Jaber; Christian Bayer

Signature-based time series statistical analysis

Xin Guo (Berkeley) · Xinyu Li (University of Oxford)

Signature transform has recently gained significant attention in the theory of stochastic analysis. In this talk, I will discuss how the signature transform can be exploited to address several long standing challenges in analyzing time series data, which are typically non-stationary, nonlinear, and often fragmented, and for which modern deep learning models are inappropriate due to limited interpretability and in principle require large volumes of training data. In particular, we propose a simple signature-based adaptive Lasso approach that has been successfully developed and implemented in industry. This method addresses many of the challenges mentioned above while demonstrating strong potential for a wide range of applications.

The talk is intended to be self-contained.


Applications of Signature based Expansions in Economics and Finance

Federico Bandi (Johns Hopkins Carey Business School) · Martino Grasselli (University of Padova) · Roberto Renò (ESSEC Business School) · Andrea Stanghellini (University of Verona) · Sara Svaluto-Ferro (University of Verona)

Signature methods provide a non-parametric framework for extracting features from trajectories and building flexible models in finance. We develop this framework in two complementary directions. First, using the time-extended Itô signature—built from iterated integrals of time, multiple correlated Brownian motions, and compound Poisson processes—we derive automated expansions of arbitrary order, with explicit coefficients, for continuous-time processes and their conditional moments, including the characteristic function. These stochastic representations are particularly suited to short-time asymptotic analysis. Building on this tractable signature structure, we then introduce a stochastic volatility model in which volatility is a linear function of the time-extended signature of a primary process. When the latter is polynomial, its truncated signature preserves polynomial tractability, leading to highly accurate joint calibration to SPX, VIX, and VXX options.


Malliavin calculus for signatures with applications to finance

Dimitri Sotnikov (École Polytechnique) · Eduardo Abi Jaber (École Polytechnique) · Clément Rey (École Polytechnique)

Malliavin calculus is a powerful and general framework for the analysis of square-integrable random variables, but it often suffers from a lack of tractability and explicit representations. To address this limitation, we focus on a subclass of random variables given by finite linear combinations of time-extended Brownian motion signatures. The class remains rich due to the universal approximation properties of signatures. Leveraging the algebraic structure of signatures, we first derive explicit formulas for the Malliavin derivative of signatures of continuous Itô processes. As a consequence, we obtain closed-form expressions for the Clark-Ocone representation, the Ornstein-Uhlenbeck semigroup and its generator, as well as the integration-by-parts formula within the class of Brownian signature variables. These results provide purely algebraic formulations of the classical operators of Malliavin calculus. As an application, we compute Greeks for general path-dependent options under signature volatility models. This is joint work with Eduardo Abi Jaber and Clément Rey.


Regression on path-space by signatures

Christian Bayer (Weierstrass Institute) · Luca Pelizzari (University of Vienna) · Davit Gogolashvili (Weierstrass Institute) · John Schoenmakers (Weierstrass Institute)

The path signature is a powerful tool for solving regression problems on path space, i.e., for computing conditional expectations E[Y|X] when the random variable X is a stochastic process - or a time-series. We provide new theoretical convergence guarantees for two different, complementary approaches to regression using signature methods. In the context of global regression, we show that linear functionals of the robust signature are universal in the Lp sense in a wide class of examples. In addition, we present a local regression method based on signature semi-metrics, and show universality as well as rates of convergence. Based on joint works with Davit Gogolashvili, Luca Pelizzari, and John Schoenmakers.

Friday 9-10.40

Expand All

Organiser: Huyên Pham
 

Schrödinger bridge problem via empirical risk minimisation

Denis Belomestny (Duisburg-Essen University) · Aleksey Naumov (HSE) · Nikita Puchkin (HSE)

We study the Schrödinger bridge problem when the endpoint distributions are available only through samples. Classical computational approaches estimate Schrödinger potentials via Sinkhorn iterations on empirical measures and then construct a time-inhomogeneous drift by differentiating a kernel-smoothed dual solution. In contrast, we propose a learning-theoretic route: we rewrite the Schrödinger system in terms of a single positive transformed potential that satisfies a nonlinear fixed-point equation and estimate this potential by empirical risk minimization over a function class. We establish uniform concentration of the empirical risk around its population counterpart under sub-Gaussian assumptions on the reference kernel and terminal density. We plug the learned potential into a stochastic control representation of the bridge to generate samples. We illustrate performance of the suggested approach with numerical experiments.


Continuous and Discrete-Time Path-Dependent McKean–Vlasov Control with Applications to Time-Series Generation

Samy Mekkaoui (École Polytechnique)

We study path-dependent McKean–Vlasov control problems in both continuous and discrete time, where the dynamics and cost functional depend on finitely many observations of the state process and their joint distribution. We derive stochastic Pontryagin maximum principles for both settings. In continuous time, the adjoint process is characterized by a backward stochastic differential equation with deterministic jumps at the observation times, while in discrete time we develop a backward adjoint recursion leading to a discrete maximum principle. Building on these optimality conditions, we introduce a control-based framework for time series generation, where the control steers the distribution of trajectories toward a prescribed target path distribution through terminal objectives based on the Maximum Mean Discrepancy (MMD). We establish local-in-time existence and uniqueness of the associated forward-backward optimality systems in both continuous and discrete time, propose a deep learning algorithm for their numerical solution, and then show numerically the effectiveness of the proposed approach for time series generation.


Post-training Discrete Diffusion models via RL

Wenpin Tang (Columbia University)

We formulate RL in continuous time with discrete state spaces via a stochastic control approach, where the state dynamics are a controlled continuous-time Markov chain. We consider policy optimization problems and derive the policy gradient methods, leading to continuous-time variants of PPO and group GRPO. As an application, we develop a complete continuous-time RL framework for fine-tuning discrete diffusion models. In contrast to the existing GRPO-based approaches that only rely on terminal rewards, our formulation allows intermediate reward to be incorporated throughout the denoising trajectory. When specialized to masked diffusion models (MDMs), our framework encompasses a rich class of policy parameterizations over the vocabulary simplex with analytically tractable probability ratios, providing a unified perspective on exploration and policy optimization in MDMs. For masked diffusion large language models (dLLMs), we further propose trajectory subsampling techniques to efficiently estimate computationally prohibitive trajectory likelihoods, reducing the computational cost of computing per-position probability ratios.


Schrödinger bridge with transport relaxation

Yifan Jiang (Imperial College London)

Motivated by modern machine learning applications where we only have access to empirical measures constructed from finite samples, we relax the marginal constraints of the classical Schrödinger bridge problem by penalizing the transport cost between the bridge’s marginals and the prescribed marginals. We derive a duality formula for this transport-relaxed bridge and demonstrate that it reduces to a finite-dimensional concave optimization problem when the prescribed marginals are discrete and the reference distribution is absolutely continuous. We establish the existence and uniqueness of solutions for both the primal and dual problems. Moreover, as the penalty blows up, we characterize the limiting bridge as the solution to a discrete Schrödinger bridge problem and identify a leading-order logarithmic divergence. Finally, we propose gradient ascent and Sinkhorn-type algorithms to numerically solve the transport-relaxed Schrödinger bridge, establishing a linear convergence rate for both algorithms.

Duality Theory and DeepMartingale for High-Dimensional Optimal Switching: Computable Upper Bounds and Expressivity Guarantees

Junyan Ye (The Chinese University of Hong Kong) · Hoi Ying Wong (The Chinese University of Hong Kong)

We study finite-horizon optimal switching with discrete intervention dates on a general filtration, allowing continuous-time observations between decision dates, and develop a deep-learning-based dual framework with computable upper bounds. We derive a dual representation via martingale penalties, whose minimal form is given by the Doob martingales of continuation values, yielding a fully computable upper bound. Extending DeepMartingale from optimal stopping to optimal switching, we prove convergence under both the upper-bound loss and an L2-surrogate loss. We also establish expressivity guarantees: for any ε>0, there exist neural networks of size at most cdqε−r, with c, q, r independent of d and ε, whose induced dual upper bound is within ε of the true value, thus avoiding the curse of dimensionality. Combined with a deep primal policy method, our solver delivers tight bounds and practical delta hedging in Brownian and Brownian-Poisson models.


Neural network approximations for stochastic control problems with degenerate dynamics

Olivier Bokanowski (LJLL, Université Paris Cité) · Jean-François Chassagneux (ENSAE-CREST, Institut Polytechnique de Paris) · Marco Scaratti (University of Verona) · Xavier Warin (EDF, France)

We consider numerical approximations of stochastic optimal control problems over a finite time horizon. We establish new explicit error bounds, together with a convergence result for the associated value function in an averaged sense. The analysis is based on neural network approximations of optimal feedback controls. Compared with existing approaches, our framework provides an improved error estimate and accommodates degenerate stochastic diffusions. Numerical simulations illustrate the relevance of the proposed approach.


Adaptive Partitioning and Learning for Stochastic Control of Diffusion Processes

Hanqing Jin (University of Oxford) · Renyuan Xu (Stanford University) · Yanzhao Yang (University of Oxford)

We study reinforcement learning for controlled diffusion processes with unbounded continuous state spaces, bounded continuous actions, and polynomially growing rewards: settings that arise naturally in finance. To overcome the challenges of continuous and high-dimensional domains, we introduce a model-based algorithm that adaptively partitions the joint state-action space. The algorithm maintains estimators of drift, volatility, and rewards within each partition, refining the discretization whenever estimation bias exceeds statistical confidence. This adaptive scheme balances exploration and approximation, enabling efficient learning in unbounded domains. Our analysis establishes regret bounds that depend on the problem horizon, state dimension, reward growth order, and a newly defined notion of zooming dimension tailored to unbounded diffusion processes. The bounds recover existing results for bounded settings as a special case, while extending theoretical guarantees to a broader class of diffusion-type problems. Finally, we validate the effectiveness of our approach through numerical experiments, including multi-asset mean-variance portfolio selection.


Potential Optimization for Multivariate American Options

Raul Tempone (KAUST)

We describe a potential-optimization approach to pricing Multivariate American and Bermudan options, including polyhedral payoffs — max-calls, worst-of puts — with no low-dimensional sufficient statistic. The optimal-stopping value is recovered from a deterministic potential whose gradient and Hessian enter an extended Hamiltonian, with the stopping problem written in Bolza form via a freezing control; structure-matched potentials keep the cost linear in the dimension, and each price is reported within a primal–dual bracket. We illustrate the method on the American max-call, on robust problems with uncertain volatility and correlation, and on baskets in dimensions up to several hundred, where the brackets stay tight against the available references. 

Semi-analytical pricing of American options and Flexible Forward contracts via integral equations and the GIT method

Andrey Itkin (New York University)

We present a semi-analytical approach for pricing American options and FF contracts including assets paying discrete or continuous dividends. Our method leverages the Generalized Integral Transform (GIT), which reframes the pricing problem - traditionally a complex partial differential equation with a free boundary - as a Volterra integral equation of the first kind. By solving this integral equation, we can efficiently determine both the option price and the early exercise boundary while naturally accommodating the discontinuities introduced by discrete dividends. This methodology offers a powerful alternative to standard numerical techniques like binomial trees or finite difference methods, which often struggle with the jump conditions from discrete dividends, leading to a loss of accuracy or performance.


Fourier-Laplace Transform Discontinuities and Computation in the Volterra Stein-Stein Model: A Fredholm--Wishart Approach

Maxime Guellil (École Polytechnique) · Eduardo Abi Jaber (École Polytechnique)

We investigate analytical and numerical challenges in computing the Fourier-Laplace transform for the Volterra Stein-Stein model, where volatility is driven by a Volterra-type Gaussian process. A central difficulty arises from the complex square root of a Fredholm determinant, which becomes discontinuous when crossing the negative real axis. We characterize these crossings and derive a corrected expression for the joint transform of log-price and integrated variance. We further propose a derivation based on an infinite-dimensional Wishart limit, yielding a convergent numerical scheme with explicit convergence rate. Our method significantly improves accuracy while drastically reducing computational cost relative to existing approaches.


Pricing European Options using the Gauss-Laguerre Quadrature

Andrea Perchiazzo (Università Del Piemonte Orientale)

In this work we propose a novel method for pricing European options numerically in an efficient manner using the Gauss-Laguerre quadrature. Instead of employing the Carr-Madan formula, which needs an appropriate choice for the damping factor, or the COS method in which three approximation errors are introduced (e.g., truncation of the integration range in the risk-neutral valuation formula), the pricing of European options using the characteristic function is based on the Gauss-Laguerre quadrature. The approach does not necessitate the truncation of the integration range in the risk-neutral valuation formula and the approximation error term is controlled by the order of Laguerre polynomials. The new methodology is initially tested on the Black-Scholes model in order to confirm its efficacy and then applied to several models (e.g., the Merton, Kou, Variance Gamma, and Heston models). Finally, we provide a benchmarking exercise between the Gauss-Laguerre-based approach, the COS method, and the Carr--Madan formula.


Short-rate models with stochastic discontinuities: a PDE approach.

Alessandro Calvia (Politecnico di Milano) · Marzia De Donno (Università Cattolica del Sacro Cuore) · Chiara Guardasoni (Università di Parma) · Simona Sanfelici (Università di Parma)

In the ongoing reform of interest rate benchmarks, risk-free rates (RFRs), such as the Secured Overnight Financing Rate (SOFR) in the U.S. or the Euro Short-Term Rate (€STR) in Europe, play a pivotal role. An observed characteristic of RFRs is the occurrence of jumps and spikes at regular intervals, due to regulatory and liquidity constraints. In this paper, we consider a general short-rate model featuring discontinuities at fixed times with random sizes. Within this framework, we introduce a PDE-based approach to price interest rate derivatives. For affine models, we also derive (quasi) closed-form solutions. Finally, we develop numerical methods to price interest rate derivatives in general cases.

Stochastic factors can matter: improving robust growth under ergodicity

Paul Mangers Bastian (The London School of Economics and Political Science) · Josef Teichmann (ETH Zurich) · David Itkin (The London School of Economics and Political Science) · Balint Binkert (ETH Zurich)

We study robust growth optimization in a high-dimensional incomplete market under drift uncertainty of the asset price process X, under an additional ergodicity assumption, which constrains but does not fully specify the drift in general. The class of admissible models allows X to depend on a multivariate stochastic factor Y and fixes (a) their joint volatility structure, (b) their long-term joint ergodic density and (c) the dynamics of the stochastic factor process Y. Our main results determine the robust optimal growth rate, construct a worst-case admissible model and characterize the robust growth-optimal strategy via a solution to a certain partial differential equation (PDE). Our analysis leads to new financial insights, quantifying the improvement in growth the investor can achieve by optimally incorporating stochastic factors into their trading decisions. We illustrate our theoretical results on several numerical examples including an application to pairs trading.


Cancelled: Scalable Bi-causal Optimal Transport via Kullback--Leibler Relaxation and Policy Gradients

Haoyang Cao (Johns Hopkins University) · Jesse Hoekstra (University of Oxford) · Renyuan Xu (Stanford University) · Yumin Xu (Peking University) · Ruixun Zhang (Peking University)

Bi-causal optimal transport (OT) is a natural framework for comparing and coupling stochastic processes under nonanticipative information constraints, with important applications in computational finance. Its practical use, however, is limited by the computational difficulty of enforcing bi-causal coupling constraints over path space. We develop a scalable stochastic-optimization framework for computing bi-causal OT couplings under general marginals. Our approach introduces a Kullback--Leibler-penalized relaxation that replaces hard marginal constraints with tractable divergence penalties. We establish dynamic programming principles for both the original and relaxed formulations, prove that the relaxed problem converges to the original bi-causal OT problem as the penalty grows, and derive explicit policy-gradient representations for the relaxed objective. Building on these results, we propose a practical policy-gradient algorithm with nonasymptotic regret guarantees. Numerical experiments show that the method accurately captures marginal laws and temporal dependence, and performs well in applications including robust subhedging and time-series statistical downscaling.


Joint SPX-VIX Calibration Across Multiple Maturities via Globally Coupled Martingale Optimal Transport

Brandon Augustino (JPMorgan Chase) · Shouvanik Chakrabarti (JPMorgan Chase) · Charlie Che (JPMorgan Chase) · Yue Sun (JPMorgan Chase)

Building on the martingale optimal transport framework of Guyon (2020) for joint S&P 500 (SPX) and VIX smile calibration, we propose a global calibration formulation that extends the slice-by-slice stitching approach to a single optimization over all maturities simultaneously. This captures cross-maturity volatility dependence, naturally handles misaligned SPX and VIX expiration dates, and provides a built-in check for cross-maturity arbitrage. We establish duality results guaranteeing arbitrage-freeness and construct a reference measure suited to the global formulation. On the algorithmic side, we introduce a mirror-descent solver with the first complexity analysis for this problem, providing guaranteed convergence even where the existing Sinkhorn algorithm can stall. We develop practical enhancements that combine the robustness of mirror descent with fast convergence, outperforming both methods at tight tolerances. Experiments on synthetic and real market data confirm fast convergence to high-precision and demonstrate the first multi-maturity globally coupled calibration on real data.

 

Organiser: Maria do Rosário Grossinho
 

Numerical approximation of forward-backward SDEs with jumps and application to emission markets

Joao Guerra (Lisbon School of Economics and Management) · Gonçalo Fonseca (Lisbon School of Economics and Management)

In this work, we study a numerical approximation method for coupled forward-backward stochastic differential equations with jumps of finite activity measure. We assume that the coefficients are Lipschitz continuous and satisfy some appropriate weak coupling or monotonicity conditions and we propose a method that combines a Picard/Markov iteration procedure with a time discretization consistent with jumps. We suggest a explicit numerical algorithm and we explore an application to a carbon emissions market.


Optimal Consumption and Investment with Energy-Efficiency Adoption

Anthony Britto (Karlsruhe Institute of Technology) · Carlos Miguel Dos Santos Oliveira (Lisbon School of Economics and Management) · Max Kleinebrahm (Karlsruhe Institute of Technology)

This article develops a unified model of consumption, investment, and energy-efficiency adoption under uncertainty. It introduces new definitions of rebound and backfire effects and incorporates their welfare implications into optimal subsidy design. The model formalises macro-level technology diffusion and energy consumption across heterogeneous agents. Explicit expressions are derived for key objects, including the adoption threshold and post-adoption strategies, which depend on agent wealth and reveal a new channel through which financial conditions influence adoption decisions. A case study of a representative German single-family home illustrates the results, and numerical simulations show that the designed subsidy policy effectively guides aggregate energy consumption


Approximate computation of the probability of Parisian ruin and optimal reinsurance

Manuel Guerra (Lisbon School of Economics and Management) · Phuong Nguyen (Lisbon School of Economics and Management; CEMAPRE)

Parisian ruin allows for a grace period after the company's reserve goes below a critical threshold. If the company manages to sort its finances during this period, it avoids ruin and may continue its business. Otherwise, so called "Parisian ruin" occurs.

General closed form expressions for the probability of Parisian ruin given the initial level of reserves are not available. In this study, we present an approximate formula and apply it to the computation of optimal reinsurance treaties from the cedent's point of view.


Market-implied time to transition to a low-carbon economy from the greenium term structure

Lorenzo Mercuri (Università Degli Studi Di Milano) · Andrea Perchiazzo (Università Del Piemonte Orientale) · Edit Rroji (Univesità Degli Studi di Milano-Bicocca) · Ilaria Stefano (Univesità Degli Studi di Milano-Bicocca)

We analyze the term structure of the greenium by means of a novel class of constrained stochastic processes. We introduce the Stochastic Regulatory Deadline-Constrained Model (SRDCM), a regime-switching framework in which greenium differentials are described by a sequence of stochastic bridges targeting terminal alignment at a policy deadline T. To handle the singular behavior of bridge processes near the deadline, we develop an inference procedure based on a path-specific gap condition. Under this condition, we derive a tractable high-frequency limit for the switching contrast function and show that the diffusion block is identified at first order. The model provides a flexible framework for extracting market-implied transition timing under deadline uncertainty and regime shifts.

https://papers.ssrn.com/sol3/papers.cfm?abstract_id=6135666

Organisers: Eduardo Abi Jaber; Christian Bayer
 

On self-exciting counting processes

Caroline Hillairet (ENSAE-CREST, Institut Polytechnique de Paris) · Thomas Peyrat (ENSAE-CREST, Institut Polytechnique de Paris) · Achille Pommier (INSA Toulouse and Institut de Mathématiques de Toulouse) · Anthony Réveillac (INSA Toulouse and Institut de Mathématiques de Toulouse)

Motivated by questions in Insurance, we introduce in this talk (based on a joint work with Caroline Hillairet, Thomas Peyrat and Achille Pommier) a new class of counting processes we name chaotic processes and which contains simple counting processes as a particular example. We will examine properties of these processes and relate them to modelling features. In particular, we will study the specific case of simple counting processes.


Cancelled: Rough differential equations for volatility

Ofelia Bonesini (The London School of Economics)

We introduce a canonical way of performing the joint lift of a Brownian motion W and a low-regularity adapted stochastic rough path X. Applying this construction to the case where X is the canonical lift of a one-dimensional fractional Brownian motion (possibly correlated with W) completes the partial rough path of Fukasawa and Takano. We use this to model rough volatility with the versatile toolkit of rough differential equations (RDEs), namely by taking the price and volatility processes to be the solution to a single RDE. The lead-lag scheme of Flint, Hambly, and Lyons is extended to our fractional setting as an approximation theory for the rough path in the correlated case. Continuity of the solution map transforms this into a numerical scheme for RDEs. We numerically test this framework and use it to calibrate a simple new rough volatility model to market data.


Levy Processes as Weak Limits of Rough Heston

Alessandro Bondi (LUISS University, Rome)

Motivated by questions in Insurance, we introduce in this talk (based on a joint work with Caroline Hillairet, Thomas Peyrat and Achille Pommier) a new class of counting processes we name chaotic processes and which contains simple counting processes as a particular example. We will examine properties of these processes and relate them to modelling features. In particular, we will study the specific case of simple counting processes.


A Unified Theory of Order Flow, Market Impact and Volatility

Mathieu Rosenbaum (Université Paris-Dauphine) 

 

Friday 11.10-12.50

Expand All

Organisers: Xinyu Li; Yufei Zhang
 

Cooperation and Competition in Mean Field Games and Related Learning Problems

Gökçe Dayanikli (University of Illinois Urbana-Champaign)

The tragedy of the commons (TOTC) states that individual incentives result in the overuse of common pool resources (CPRs), which may have detrimental future consequences for everyone. However, in many real-life situations this does not occur, and researchers such as Nobel laureate Elinor Ostrom have suggested that mutual restraint by individuals can prevent it. In mean field games (MFGs), since individuals are insignificant and non-cooperative, TOTC is inevitable. This suggests that MFG models involving CPRs must incorporate both selfishness and altruism to better capture real-world behavior. Motivated by this, we introduce and analyze equilibrium notions blending cooperative and non-cooperative actions. Finally, we address the challenge that understanding intervention policies in mixed MFGs requires knowledge of individuals' altruism levels, which are generally unobservable. We therefore consider how these levels can be learned from data using inverse learning techniques.


Numerical Approximation for Path-Dependent McKean–Vlasov Control with Non-Asymptotic Error Estimates

Olivier Bokanowski (Université Paris Cité) · Jean-François Chassagneux (ENSAE) · Xinyu Li (University of Oxford) · Christoph Reisinger (University of Oxford)

Path-dependent McKean--Vlasov (MKV) control models large interacting populations with history-dependent dynamics and costs. We develop a numerical framework for continuous-time path-dependent MKV with non-asymptotic guarantees. An Euler discretization with piecewise-constant controls yields a value error of O(Δt1/4). We establish a discrete dynamic programming principle and value equivalence between open-loop and history-dependent feedback controls. An interacting particle system gives total error O(Δt1/4) + O(M−γ) for M particles and an explicitly given γ>0. Finally, we propose a neural-network policy-gradient method with pathwise features, and numerical experiments show its effectiveness.


Mean Field Control with speedy information access

Dirk Becherer (Humboldt-Universität zu Berlin) · Nils Mattiß (Humboldt-Universität zu Berlin) · Jonathan Tam (University of Oxford)

Motivated by the presence of delayed and costly data in portfolio and risk management settings, we study a mean-field control (MFC) problem in which a controller can dynamically choose their information latency, with higher costs for more recent observation. This leads to a partially observed control problem with a trade-off between acting on stale information and acquiring more timely signals. We show the problem is equivalent to a Markovian problem on a larger state space, using a similar but different augmentation to the MFG variant in (Becherer, Reisinger, Tam '23). We illustrate the impact of the costs and latency through numerical examples.


Extended mean field control: a global numerical solution via finite-dimensional approximation

Athena Picarelli (University of Verona) · Marco Scaratti (University of Verona) · Jonathan Tam (University of Oxford)

We investigate the global numerical approximation of a class of extended mean field control problems (MFC), where the dynamics and costs depend on the joint distribution of the state and the control. We propose a framework to approximate the value function globally over the Wasserstein space, moving beyond the restriction of fixed initial conditions. Our approach exploits the propagation of chaos by approximating the infinite-dimensional MFC problem by an N-player cooperative game, together with the usage of finite-dimensional solvers. This method avoids the need to parametrise functions on an infinite-dimensional space, offering a balance between probabilistic rigor and computational efficiency.

Deep Learning for Energy Market Contracts: Dynkin Game with Doubly RBSDEs

Giulia Pucci (KTH Royal Institute of Technology)

 In this talk we formulate a Contract for Difference (CfD) with early exit options as a two-player zero-sum Dynkin game, capturing the strategic interaction between an electricity producer and a regulatory authority. The payoff structure includes running revenues, early termination penalties, and a terminal settlement, while the underlying electricity prices follow mean-reverting dynamics. The value of the game and the associated feedback optimal stopping rules are characterized through a doubly reflected backward stochastic differential equation (DRBSDE).
To approximate the solution of the DRBSDE, we propose a learning-based numerical method that combines time discretization with neural network approximations of the backward components along simulated price trajectories. A convergence result is established to justify the link between the continuous-time formulation and its numerical approximation. The proposed Deep DRBSDE solver is illustrated on a CfD model driven by 24-dimensional mean-reverting electricity prices representing multiple European market zones.


Deep learning schemes for RBSDEs: regularization and convergence analysis

Ruimeng Hu (University of California, Santa Barbara) · Yihan Zou (University of Glasgow)

In this paper, we propose two deep learning-based numerical schemes for solving reflected backward stochastic differential equations (RBSDEs), namely the deep forward scheme (DFS) and the deep backward scheme (DBS), both of which approximate the RBSDE via a regularization approach. Our main theoretical contribution focuses on the DBS. First, we derive an explicit upper bound for the error between the DBS estimator and the solution of the RBSDE, showing that the approximation error is controlled by the associated training loss. Second, we establish that this training loss can be made arbitrarily small under the universal approximation capability of neural networks. These results complement existing analyses for forward schemes. Numerical experiments on American-style option pricing problems demonstrate that both DFS and DBS achieve high accuracy in high-dimensional settings.


Deep Duality Methods for Constrained Optimal Portfolios

Alexander Schütt (Technical University of Munich) · Christoph Knochenhauer (Technical University of Munich)

We present a deep learning approach for solving constrained optimal portfolio problems in high-dimensional markets. Our approach combines the duality framework of Cvitanić and Karatzas with Physics-Informed Neural Networks (PINNs). The objective is to maximize the expected utility of terminal wealth, subject to convex constraints on the trading strategy.

We solve the primal and corresponding dual problem using PINNs to obtain an approximate optimal trading strategy and an upper bound on the optimal performance under constraints. Comparing the performance of the learned trading strategy to this upper bound leads to an explicit and interpretable error estimate of its maximal deviation from the optimal strategy.

Numerical experiments show the accuracy of this method in S&P 500-inspired 503-dimensional Black-Scholes and Heston markets, as well as in a rough Heston market model.


Optimal strategy and deep hedging for share repurchase programs

Stefano Corti (Intesa Sanpaolo) · Roberto Daluiso (Intesa Sanpaolo) · Andrea Pallavicini (Intesa Sanpaolo)

In a share repurchase program, a company instructs a bank to buy back shares on its behalf. Even when the bank is allowed to hedge its exposure, perfect hedging is infeasible due to intrinsic features of the product, contractual clauses, and regulations on trading. In this work, we address the hedging of these products by a machine-learning framework that determines the optimal execution of the buyback while accounting for the bank's actual trading capabilities. This unified treatment of execution and hedging yields substantial performance improvements, resulting in an optimized policy that allows a feasible and effective hedging strategy. The pricing of these programs can be framed in terms of the discount offered to the client on a benchmark price for the shares. Since, in our framework, risk measures serve as objective functions, we exploit the concept of indifference pricing to compute this discount, thereby capturing the actual execution performance.

Organisers: Chiheb Ben Hammouda; Kees Oosterlee
 

Fast and reliable pricing and calibration of the rough Heston model II

Svetlana Boyarchenko (University of Texas) · Marco de Innocentis (Deutsche Bank) · Sergei Levandorskiĭ (Calico)

There is a resurgence of the use of Fourier methods for option pricing problems in models which exhibit memory effects. Particularly, Fourier pricing under the rough Heston model is challenging because it requires solving a fractional Riccati equation at each quadrature node. Observing that using a uniform discretization of the Riccati equation for all nodes is suboptimal, we design a hierarchical multilevel Fourier pricing method that adapts the time discretization across nodes. By combining multilevel quadrature with fractional Adams scheme, we significantly reduce the computational complexity for a prescribed accuracy. Numerical experiments confirm substantial runtime improvements over standard single-level approaches.


Hierarchical Fourier Quadrature for Option Pricing under Rough Heston Models

Chiheb Ben Hammouda (Utrecht University) · Abderrahmene Ben Romdhane (King Abdullah University of Science and Technology) · Michael Samet (RWTH Aachen University) · Raul Tempone (King Abdullah University of Science and Technology)

There is a resurgence of the use of Fourier methods for option pricing problems in models which exhibit memory effects. Particularly, Fourier pricing under the rough Heston model is challenging because it requires solving a fractional Riccati equation at each quadrature node. Observing that using a uniform discretization of the Riccati equation for all nodes is suboptimal, we design a hierarchical multilevel Fourier pricing method that adapts the time discretization across nodes. By combining multilevel quadrature with fractional Adams scheme, we significantly reduce the computational complexity for a prescribed accuracy. Numerical experiments confirm substantial runtime improvements over standard single-level approaches.


Semi-Static Variance-Optimal Hedging of Covariance Risk in Multi-Asset Derivatives

Sven Karbach (University of Amsterdam) · Konstantinos Chatziandreou (University of Amsterdam)

We introduce semi-static, variance-optimal hedging strategies for multi-asset derivatives within multivariate stochastic covariance models. Combining continuous trading in underlying assets with static positions in auxiliary instruments, we solve the pricing and hedging problem via a multivariate Galtchouk--Kunita--Watanabe decomposition. This naturally decouples the global mean-variance optimization into dynamic and static problems. Applying this to covariance swaps, we demonstrate hedging using underlying assets and quanto options. Crucially, for affine stochastic covariance models, we leverage Fourier and Laplace transform techniques to derive semi-closed-form expressions for optimal hedge ratios and prices. This allows us to quantify the variance reduction from the static hedge component. We demonstrate the computational efficiency of these transform-based algorithms and the framework's practical relevance through numerical experiments on exotic multi-asset derivatives.


Monotone 2-D integration scheme for mean-CVaR optimization via Fourier-trained kernels

Hao Zhou (The University of Queensland) · Duy-Minh Dang (The University of Queensland)

We present a monotone, provably convergent two-dimensional (2D) integration method for multi-period mean-CVaR reward-risk stochastic control in models whose one-step increment law is specified by a characteristic function (CF). When the transition density is not available in closed form, we learn a nonnegative, normalized 2D transition kernel in Fourier space using a simplex-constrained Gaussian-mixture parameterization, and discretize the resulting convolution integrals using composite quadrature rules with nonnegative weights to preserve monotonicity. Exploiting the Toeplitz structure inherent in convolution, the scheme is implemented efficiently via 2D fast Fourier transforms. Under mild Fourier-tail decay assumptions on the CF, we derive Fourier-domain L2 error estimates for kernel approximation and truncation, translate them into real-space bounds, and establish l∞ stability, consistency, and pointwise convergence as the discretization and kernel-approximation parameters vanish. Numerical experiments on a coupled 2D jump-diffusion model in a multi-period portfolio optimization setting demonstrate the robustness and accuracy of the proposed method.

Organiser: Jan Oblój
 

Delta Upsilon Hedging

Julian Sester (National University of Singapore) · Jan Obloj (University of Oxford) · Haoyu Xie (National University of Singapore)

We propose a mathematically explicit delta--upsilon hedging framework for European options in which model uncertainty is quantified non-parametrically via small-radius Wasserstein balls around a baseline risk-neutral distribution. The approach can be viewed as a distributionally robust extension of classical delta--vega hedging: while delta--vega hedging addresses volatility uncertainty within the framework, our method captures general distributional uncertainty. A key ingredient is a first-order expansion of distributionally robust prices under a barycenter (martingale) constraint: the worst-case pricing correction per unit Wasserstein radius equals the standard deviation of the option's terminal payoff slope under the baseline model. This motivates a new "Greek", upsilon, and an associated bilinear co-upsilon, which together yield closed-form optimal hedge ratios in same-maturity call--call settings and common-horizon projection formulas for differing maturities. Finally, we outline synthetic and market experiments comparing hedging strategies under structural misspecification such as stochastic volatility and jumps.


Distributional Adversarial Attacks and Training in Finance

Guangyi He (Imperial College London) · Lukas Gonon (University of St. Gallen) · Tobias Sutter (University of St. Gallen)

In this talk, we study the robustness of classical deep hedging strategies under distributional shifts by leveraging the concept of adversarial attacks. We first demonstrate that standard deep hedging models are highly vulnerable to small perturbations in the input distribution, resulting in significant performance degradation. Motivated by this, we propose an adversarial training framework tailored to increase the robustness of deep hedging strategies. Our approach extends pointwise adversarial attacks to the distributional setting and introduces a computationally tractable reformulation of the adversarial optimization problem over a Wasserstein ball. This enables the efficient training of hedging strategies that are resilient to distributional perturbations. Through extensive numerical experiments, we show that adversarially trained deep hedging strategies consistently outperform their classical counterparts in terms of out-of-sample performance and resilience to model misspecification. By introducing a value network, we can further extend this framework to the adapted Wassertein metric.


Low-dimensional adapted optimal transport and its Schrödinger equations

Linn Engström (KTH Royal Institute of Technology) · Sigrid Källblad (KTH Royal Institute of Technology)

During the last decade there has been a rapid development of methods for computationally addressing optimal transport problems; motivated by applications within robust finance and machine learning, effort has also been made to generalize these techniques to problems equipped with additional causality constraints. Solving such adapted optimal transport (AOT) problems computationally remains a challenging task though for problems formulated over many periods.

In this talk we will present an efficient framework for solving a class of AOT problems computationally. Our method leverages on sparse structures inherent in the problems and allows for deriving a low-dimensional version of the adapted Schrödinger equations.


SPX-VIX Risk Computations Via Perturbed Optimal Transport

Charlie Che (JPMorgan Chase) · Yudong Yang (JPMorgan Chase) · Hanxuan Lin (JPMorgan Chase) · Guofan Hu (JPMorgan Chase) · Lei Fang (JPMorgan Chase)

We present a model-independent framework for generating consistent SPX-VIX risk scenarios using perturbed martingale Optimal Transport. Building on the entropic SPX-VIX calibration work of Guyon, we derive a fast perturbative methodology that computes sensitivities of the calibrated coupling through Fisher information linearization, avoiding repeated full recalibrations under market shocks. We further introduce a dimension reduced perturbed optimal transport formulation that preserves martingale and variance-consistency structures while significantly improving computational efficiency and numerical stability. The framework is combined with skew stickiness ratio(SSR) dynamics to propagate SPX perturbations into forward variance and VIX distributions in a dynamically consistent manner. Numerical experiments demonstrate that the proposed methods closely match full recalibration risk estimates at substantially lower computational cost. Back-testing results show improved hedging performance relative to stochastic local volatility benchmarks.

Neural operators for Chernoff approximations of convex monotone semigroups

Jonas Blessing (ETH Zurich) · Philipp Schmocker (ETH Zurich) · Alessandro Sgarabottolo (LMU Munich)

In this talk, we construct different neural operators to learn the Chernoff-type approximation of a non-linear convex monotone semigroup. First, we establish in a universal approximation theorem that so-called Chernoff-neural operators can approximate the Chernoff one-step operator arbitrarily well. By using the stability properties of the Chernoff approximation, the universality of these neural operators then extends naturally to the non-linear semigroup. Second, we use the projected gradient descent method to introduce specific neural operators for Nisio semigroup, which allow us to derive quantitative convergence rates. Furthermore, we illustrate the effectiveness of these neural operators in various numerical examples.


A Gibbs Sampler for Financial Network Models with multiple CCPs

Markus Karl (The London School of Economics and Political Science) · Luitgard Veraart (The London School of Economics and Political Science)

We consider a network reconstruction problem for centrally cleared financial markets in which clearing members clear with multiple central counterparties and positions are bilaterally netted. We propose an MCMC approach to reconstruct cleared amounts from partial information, providing a computationally tractable framework for sampling eligible networks. We show how our methodology can be used to assess systemic risk by providing a case study in which we compute default probabilities in a Cover-2 standard stress test in stylized networks. In general, our sampling approach allows us to compute the distribution of network-dependent risk measures under partial information.


Simulating integrated Volterra square-root processes and Volterra Heston models via Inverse Gaussian

Elie Attal (École Polytechnique) · Eduardo Abi Jaber (École Polytechnique)

We propose a novel simulation scheme for integrated Volterra square-root processes and Volterra Heston models, inspired by recent results on the convergence of such processes to an Inverse Gaussian jump process as H ↓ -1/2. The scheme preserves positivity and handles L1 kernels with singularities by relying solely on integrated quantities. We establish weak convergence using an affine Volterra reformulation with a measure-valued kernel. Numerical results demonstrate that convergence is achieved with very few time steps, improving as H decreases to -1/2. In fact, it can be shown that the convergence rate is 1 for any H > -1/2.


Numerical Approximation of jump-diffusion McKean—Vlasov SDEs

Verena Schwarz (University of Oxford) 

Jump-diffusion McKean–Vlasov stochastic differential equations play an important role in modern financial modelling, particularly in the analysis of systemic risk in banking networks, where both interactions among institutions and sudden market shocks must be taken into account. In this talk, we present numerical approximation methods for a broad class of jump-diffusion McKean–Vlasov SDEs under weak regularity assumptions and establish convergence rate estimates for the proposed schemes. In particular, we propose what is, to the best of our knowledge, the first higher-order approximation scheme for jump-diffusion McKean–Vlasov SDEs and derive convergence rate estimates in the presence of superlinearly growing coefficients. Furthermore, we investigate several strategies for improving the efficiency and practical implementation of the scheme. To this end, we combine advanced simulation and estimation techniques. Numerical experiments will be presented to illustrate the theoretical convergence results and assess the practical performance of the proposed methods.

Financial time series forecasting via Generative Adversarial Networks

Mihai Cucuringu (UCLA / University of Oxford)

We investigate the use of Generative Adversarial Networks (GANs) for probabilistic forecasting of financial time series. To this end, we introduce a novel economics-driven loss function for the generator. This newly designed loss function renders GANs more suitable for a classification task, and places them into a supervised learning setting, whilst producing full conditional probability distributions of price returns given previous historical values. Our approach moves beyond the point estimates traditionally employed in the forecasting literature, and allows for uncertainty estimates. Numerical experiments on equity data showcase the effectiveness of our proposed methodology, which achieves higher Sharpe Ratios compared to classical supervised learning models, such as LSTMs and ARIMA. Finally, we discuss extensions to the multi-asset setting by leveraging cross-asset relationships through a graph-based probabilistic ensemble framework.


Quantifying Transition Risk through Barrier-Crossing Pricing of Climate-Linked Bonds

Akorede Oluwo (Florida International University) · Milena Kojic (Florida International University) · Enrique Villamor (Florida International University)

Sustainability-Linked Bonds and Green Bonds are among the fastest-growing instruments in climate finance, yet existing pricing frameworks fail to capture the path-dependent nature of carbon emission dynamics. We address this gap through a unified stochastic framework grounded in first-passage theory, modeling carbon processes under Geometric Brownian Motion and Ornstein–Uhlenbeck dynamics. For Sustainability-Linked Bonds, we derive closed-form coupon step-up probabilities via the Backward Kolmogorov equation, imposing stricter sustainability targets through barrier-crossing conditions. A Double-Barrier Green Bond model completes the framework, linking coupon penalties to carbon prices breaching upper or lower thresholds via eigenfunction expansion. Calibrated to EU ETS carbon price data and Bloomberg SLB issuance records, model-implied probabilities are benchmarked against observed issuer outcomes, enabling investors and issuers to quantify transition risk and design climate-consistent contract structures.


Dynamic Portfolio Optimization under CVaR Constraints

Anran Hu (Columbia University)

We study continuous-time dynamic portfolio optimization under a Conditional Value-at-Risk (CVaR) constraint on the investor’s terminal loss. For a general class of convex trading objectives, we exploit the auxiliary-threshold representation of CVaR to establish the existence of an optimal strategy and strong duality without requiring market completeness. These results motivate a dual-based nested bisection method over the threshold and Lagrangian multiplier, where the inner iterations reduce to standard unconstrained stochastic control problems. We prove that the resulting strategies converge globally to the optimal control as the number of iterations tends to infinity. Numerical experiments recover the Merton policy when the risk constraint is slack. When the constraint binds, the optimal adjustment is strongly state dependent: the investor reduces risky exposure following adverse outcomes but preserves, and near maturity may increase, exposure following favorable outcomes. Thus, a terminal CVaR constraint produces an asymmetric reallocation across states rather than uniform de-risking. Unhedgeable endowment risk amplifies the conservative adjustment, whereas price impact lowers both desired positions and adjustment speeds.


Mean-Field Generalisation Bounds for Learning Controls in Stochastic Environments

Boris Baros (University of Oxford) · Samuel N. Cohen (University of Oxford) · Christoph Reisinger (University of Oxford)

We consider a data-driven formulation of the classical discrete-time stochastic control problem. Our approach exploits the natural structure of many such problems, in which significant portions of the system are uncontrolled. Employing the dynamic programming principle and the mean-field interpretation of single-hidden layer neural networks, we formulate the control problem as a series of infinite-dimensional minimisation problems. When regularised carefully, we provide practically verifiable assumptions for non-asymptotic bounds on the generalisation error achieved by the minimisers to this problem, thus ensuring stability in overparametrised settings, for controls learned using finitely many observations. We explore connections to the traditional noisy stochastic gradient descent algorithm, and subsequently show promising numerical results for some classic control problems.

Friday 14.00-15.40

Expand All

Quantum Machine Learning for Computational Finance: Promises and Pitfalls

Lukas Gonon (University of St. Gallen)

Quantum computing has attracted enormous attention as a new computing paradigm. In this talk, we focus on one of its most actively studied branches: quantum machine learning. We begin with a broad perspective on quantum machine learning and then discuss what it may offer for computational finance applications such as derivative pricing and hedging. We present theoretical approximation guarantees for quantum neural networks, compare them to classical deep learning, and comment on key practical obstacles. As an example application, we consider option pricing in exponential Lévy models. We also discuss extensions of our approximation results, both to settings that explicitly account for hardware noise and to recurrent quantum neural networks for temporal data.

RIDGE: An Autonomous Framework for Validation and Method Discovery in LLM-Generated Option Pricing

Liexin Cheng (Peking University) · Xue Cheng (Peking University) · Shuaiqiang Liu (Delft University of Technology) · Kees Oosterlee (Utrecht University)

Automated code generation is increasingly being applied in quantitative finance, where large language models can generate option pricing implementations directly from mathematical model specifications. Validating such implementations, however, requires more than standard unit tests: numerical pricing methods must remain mathematically consistent, numerically stable, and robust across a wide range of model parameters. We will present RIDGE, an autonomous validation methodology in which generated pricing implementations are subjected to structured no-arbitrage checks, stress tests, benchmark comparisons, and consistency inspections. Diagnostic knowledge accumulated during validation is stored and reused across models and validation iterations, enabling systematic improvement of both the pricing implementation and the validation methodology itself. Applied to five stochastic volatility models, the methodology eliminates all detected implementation defects and, in two cases, leads to new semi-analytic pricing techniques.