SearcharxivSearch

arXiv subjects

Cornelis W. Oosterlee

Publications and source records attributed to Cornelis W. Oosterlee.

At least 19 recordsLinked to original sources

A Generalized Block Circulant Preconditioner for Crank-Nicolson All-at-Once Systems with Applications to Option Pricing PDEs

The Crank--Nicolson (CN) method is a widely used time integration scheme for evolutionary partial differential equations (PDEs) arising in various scientific and engineering disciplines. Since the numerical solution at each time level depends on the solution at the previous time level, the resulting discretization is inherently sequential and therefore difficult to parallelize in time. In this paper, we develop an all-at-once formulation of the CN discretization together with a generalized block circulant preconditioner that enables an efficient parallel-in-time solution within a Krylov subspace framework. We establish a detailed spectral analysis of the preconditioned system, proving that most eigenvalues are equal to $1$, while the remaining eigenvalues are confined to the annulus: \begin{equation*} \left\{ z\in\mathbb{C}: \frac{1}{1+α}<|z|<\frac{1}{1-α}, \ \Re(z)>0 \right\}, \end{equation*} where $0<α<1$ is a free parameter. Besides, the efficient implementation of the proposed preconditioner is described. Given certain conditions, we prove that the preconditioned GMRES($m$) method achieves a fast convergence rate independent of discretization stepsizes from the residual point of view. Finally, we verify both theoretical findings and the efficacy of the proposed preconditioner via numerical experiments on financial option pricing PDEs (even with variable coefficients).

math.NA

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

Automated code generation is becoming an important tool in quantitative finance, where large language models can generate option pricing implementations directly from mathematical model specifications. Validating such implementations, however, requires considerably more than conventional software testing: numerical pricing methods must remain mathematically consistent, numerically stable, and reliable across a wide range of model parameters. We introduce RIDGE, an autonomous validation framework in which generated pricing implementations are subjected to structured no-arbitrage tests, stress tests, benchmark comparisons, and consistency checks. Validation evidence is interpreted diagnostically, while the resulting knowledge is accumulated in a repository and reused across models and successive validation iterations. This enables systematic refinement of both the pricing implementation and the validation methodology. The framework is applied to five stochastic volatility models. Across these studies, all detected implementation defects are removed and, in two cases, the validation process reveals methodological limitations and motivates the development of alternative numerical methods. The supplementary material is available in the GitHub repository: https://github.com/ShQiangLiu/ridge.

q-fin.CP

An Analytic COS Method for Compound Option Valuation

We develop an analytic Fourier cosine (COS) method for the valuation of compound options. By deriving closed-form expressions for the cosine coefficients at all compound stages, the proposed method eliminates the need for numerical quadrature in intermediate exercise stages while retaining the convergence properties of the underlying COS approximation. The formulation extends to multi-stage compound structures and a broader class of payoffs, and remains applicable to a wide class of stochastic models characterized by known characteristic functions, including jump-diffusion dynamics. Numerical experiments demonstrate improved computational efficiency compared with quadrature-based implementations while maintaining high accuracy. Applications to staged real-option problems further illustrate the flexibility of the method in handling nested decision structures under different uncertainty dynamics.

q-fin.CP

A Damped SWIFT Method for European Option Pricing: Coefficients Decay, Truncation, and Error Analysis

We introduce a damped variant of the Shannon Wavelet Inverse Fourier Technique (SWIFT) for pricing European options when the characteristic function of the underlying model is available. The key idea is to apply an exponential damping transformation to the payoff, which enables the direct computation of Fourier coefficients in the frequency domain without introducing an additional physical-domain truncation parameter. We provide a rigorous analysis of the decay of these coefficients by exploiting the singularity structure of the associated Fourier transforms. For light-tailed models, we obtain Gaussian-type decay estimates, while for semi-heavy and heavy-tailed models whose singularities are poles, algebraic branch points, or logarithmic branch points, we derive exponential decay bounds with explicit polynomial prefactors. 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. We further derive an error decomposition separating projection, truncation, and quadrature errors, and translate the analysis into practical rules for selecting the damping parameter, resolution level, and truncation range. 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 and remaining stable in cases where the undamped method deteriorates.

math.NA

Convergence of the Markovian Iteration for Coupled FBSDEs via a Differentiation Approach

In this paper, we investigate the Markovian iteration method for solving coupled forward-backward stochastic differential equations (FBSDEs) with a fully coupled drift term of the form $b(t,X_t,Y_t,Z_t)$. An FBSDE system typically involves three stochastic processes: the forward process $X$, the backward process $Y$ representing the solution, and the $Z$ process corresponding to the scaled derivative of $Y$. Previous work by Bender and Zhang (2008) established convergence results for iterative schemes for $Y$-coupled FBSDEs. However, extending these results to equations with $Z$ coupling presents significant challenges, particularly in obtaining a uniform control of the Lipschitz constants of the decoupling fields across iterations and time steps within a fixed-point framework. To overcome this issue, we propose a novel differentiation-based method for handling the $Z$ process. This approach enables better control of the Lipschitz constants of decoupling fields, facilitating the well-posedness of the discretized FBSDE system with fully coupled drift. We rigorously prove the convergence of our Markovian iteration method in this more complex setting. Finally, we develop an efficient algorithm for computing the resulting numerical scheme, and numerical experiments confirm the theoretical findings and demonstrate the effectiveness and accuracy of the proposed methodology.

math.NA

SigMA: Path Signatures and Multi-head Attention for Learning Parameters in fBm-driven SDEs

Stochastic differential equations (SDEs) driven by fractional Brownian motion (fBm) are increasingly used to model systems with rough dynamics and long-range dependence, such as those arising in quantitative finance and reliability engineering. However, these processes are non-Markovian and lack a semimartingale structure, rendering many classical parameter estimation techniques inapplicable or computationally intractable beyond very specific cases. This work investigates two central questions: (i) whether integrating path signatures into deep learning architectures can improve the trade-off between estimation accuracy and model complexity, and (ii) what constitutes an effective architecture for leveraging signatures as feature maps. We introduce SigMA (Signature Multi-head Attention), a neural architecture that integrates path signatures with multi-head self-attention, supported by a convolutional preprocessing layer and a multilayer perceptron for effective feature encoding. SigMA learns model parameters from synthetically generated paths of fBm-driven SDEs, including fractional Brownian motion, fractional Ornstein-Uhlenbeck, and rough Heston models, with a particular focus on estimating the Hurst parameter and on joint multi-parameter inference, and it generalizes robustly to unseen trajectories. Extensive experiments on synthetic data and two real-world datasets (i.e., equity-index realized volatility and Li-ion battery degradation) show that SigMA consistently outperforms CNN, LSTM, vanilla Transformer, and Deep Signature baselines in accuracy, robustness, and model compactness. These results demonstrate that combining signature transforms with attention-based architectures provides an effective and scalable framework for parameter inference in stochastic systems with rough or persistent temporal structure.

cs.LG

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

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 is based on a reformulation of option pricing problems in terms of a system of backward stochastic differential equations (BSDEs), which offers a new perspective on the numerical treatment of compound options and optimal stopping problems such as Bermudan option pricing. Building on the classical deep BSDE method for a single BSDE, we develop an algorithm for compound BSDEs and establish its convergence properties. In particular, we derive an a posteriori error estimate for the proposed method. Numerical experiments demonstrate the accuracy and computational efficiency of the approach, and illustrate its effectiveness for high-dimensional option pricing and optimal stopping problems.

q-fin.CP

Pricing and hedging the prepayment option of mortgages under stochastic housing market activity

Prepayment risk embedded in fixed-rate mortgages forms a significant fraction of a financial institution's exposure. The embedded prepayment option bears the same interest rate risk as an exotic interest rate swap with a suitable stochastic notional. Focusing on penalty-free prepayment because of the contract owner's relocation to a new house, we model the prepayment option value as an European-type interest rate receiver swaption with stochastic maturity matching the stochastic time of relocation. This is a convenient representation since it allows us to compute the prepayment option value in terms of well-known pricing formulas for European-type swaptions. We investigate the effect of a stochastic housing market activity as the explanatory variable for the distribution of the relocation time, as opposed to the conventional assumption of a deterministic housing market activity. We prove that the housing market covariance drives the prepayment option price difference between the stochastic setting and its deterministic counterpart. The prepayment option exposure is hedged using market instruments based on Delta-Gamma replication. Furthermore, since the housing market activity is a non-tradable risk factor, we perform non-standard actuarial hedging focusing on controlling the prepayment option exposure yield by risky housing market scenarios.

q-fin.PR

The deep multi-FBSDE method: a robust deep learning method for coupled FBSDEs

We introduce the deep multi-FBSDE method for robust approximation of coupled forward-backward stochastic differential equations (FBSDEs), focusing on cases where the deep BSDE method of Han, Jentzen, and E (2018) fails to converge. To overcome the convergence issues, we consider a family of FBSDEs that are equivalent to the original problem in the sense that they satisfy the same associated partial differential equation (PDE). Our algorithm proceeds in two phases: first, we approximate the initial condition for the FBSDE family, and second, we approximate the original FBSDE using the initial condition approximated in the first phase. Numerical experiments show that our method converges even when the standard deep BSDE method does not.

math.NA

A deep BSDE approach for the simultaneous pricing and delta-gamma hedging of large portfolios consisting of high-dimensional multi-asset Bermudan options

A deep BSDE approach is presented for the pricing and delta-gamma hedging of high-dimensional Bermudan options, with applications in portfolio risk management. Large portfolios of a mixture of multi-asset European and Bermudan derivatives are cast into the framework of discretely reflected BSDEs. This system is discretized by the One Step Malliavin scheme (Negyesi et al. [2024, 2025]) of discretely reflected Markovian BSDEs, which involves a $Γ$ process, corresponding to second-order sensitivities of the associated option prices. The discretized system is solved by a neural network regression Monte Carlo method, efficiently for a large number of underlyings. The resulting option Deltas and Gammas are used to discretely rebalance the corresponding replicating strategies. Numerical experiments are presented on both high-dimensional basket options and large portfolios consisting of multiple options with varying early exercise rights, moneyness and volatility. These examples demonstrate the robustness and accuracy of the method up to $100$ risk factors. The resulting hedging strategies significantly outperform benchmark methods both in the case of standard delta- and delta-gamma hedging.

q-fin.CP

Generalized convergence of the deep BSDE method: a step towards fully-coupled FBSDEs and applications in stochastic control

We are concerned with high-dimensional coupled FBSDE systems approximated by the deep BSDE method of Han et al. (2018). It was shown by Han and Long (2020) that the errors induced by the deep BSDE method admit a posteriori estimate depending on the loss function, whenever the backward equation only couples into the forward diffusion through the Y process. We generalize this result to drift coefficients that may also depend on Z, and give sufficient conditions for convergence under standard assumptions. The resulting conditions are directly verifiable for any equation. Consequently, unlike in earlier theory, our convergence analysis enables the treatment of FBSDEs stemming from stochastic optimal control problems. In particular, we provide a theoretical justification for the non-convergence of the deep BSDE method observed in recent literature, and present direct guidelines for when convergence can be guaranteed in practice. Our theoretical findings are supported by several numerical experiments in high-dimensional settings.

math.NA

A numerical Fourier cosine expansion method with higher order Taylor schemes for fully coupled FBSDEs

A higher-order numerical method is presented for scalar valued, coupled forward-backward stochastic differential equations. Unlike most classical references, the forward component is not only discretized by an Euler-Maruyama approximation but also by higher-order Taylor schemes. This includes the famous Milstein scheme, providing an improved strong convergence rate of order 1; and the simplified order 2.0 weak Taylor scheme exhibiting weak convergence rate of order 2. In order to have a fully-implementable scheme in case of these higher-order Taylor approximations, which involve the derivatives of the decoupling fields, we use the COS method built on Fourier cosine expansions to approximate the conditional expectations arising from the numerical approximation of the backward component. Even though higher-order numerical approximations for the backward equation are deeply studied in the literature, to the best of our understanding, the present numerical scheme is the first which achieves strong convergence of order 1 for the whole coupled system, including the forward equation, which is often the main interest in applications such as stochastic control. Numerical experiments demonstrate the proclaimed higher-order convergence, both in case of strong and weak convergence rates, for various equations ranging from decoupled to the fully-coupled settings.

math.NA

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

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 (EPO) bears the same interest rate risk as an exotic interest rate swap (IRS) 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 exposure resulting from the EPO with IRSs and swaptions, and we show that a replication based on swaps solely cannot easily control the right tail of the exposure distribution, while including swaptions enables that. The replication framework is flexible and focuses on different regions in the exposure distribution. Since a non-hedgeable risk factor entails the existence of multiple equivalent martingale measures, pricing and optimal replication are not unique. We investigate the effect of a market price of risk misspecification and we provide a methodology to generate robust hedging strategies. Such strategies, obtained as solutions to a saddle-point problem, allow us to bound the exposure against a misspecification of the pricing measure.

q-fin.CP

Convergence of the deep BSDE method for stochastic control problems formulated through the stochastic maximum principle

It is well-known that decision-making problems from stochastic control can be formulated by means of a forward-backward stochastic differential equation (FBSDE). Recently, the authors of Ji et al. 2022 proposed an efficient deep learning algorithm based on the stochastic maximum principle (SMP). In this paper, we provide a convergence result for this deep SMP-BSDE algorithm and compare its performance with other existing methods. In particular, by adopting a strategy as in Han and Long 2020, we derive a-posteriori estimate, and show that the total approximation error can be bounded by the value of the loss functional and the discretization error. We present numerical examples for high-dimensional stochastic control problems, both in case of drift- and diffusion control, which showcase superior performance compared to existing algorithms.

math.OC

The Deep Latent Space Particle Filter for Real-Time Data Assimilation with Uncertainty Quantification

In Data Assimilation, observations are fused with simulations to obtain an accurate estimate of the state and parameters for a given physical system. Combining data with a model, however, while accurately estimating uncertainty, is computationally expensive and infeasible to run in real-time for complex systems. Here, we present a novel particle filter methodology, the Deep Latent Space Particle filter or D-LSPF, that uses neural network-based surrogate models to overcome this computational challenge. The D-LSPF enables filtering in the low-dimensional latent space obtained using Wasserstein AEs with modified vision transformer layers for dimensionality reduction and transformers for parameterized latent space time stepping. As we demonstrate on three test cases, including leak localization in multi-phase pipe flow and seabed identification for fully nonlinear water waves, the D-LSPF runs orders of magnitude faster than a high-fidelity particle filter and 3-5 times faster than alternative methods while being up to an order of magnitude more accurate. The D-LSPF thus enables real-time data assimilation with uncertainty quantification for physical systems.

cs.CE

Parallel-in-Time Iterative Methods for Pricing American Options

For pricing American options, %after suitable discretization in space and time, a sequence of discrete linear complementarity problems (LCPs) or equivalently Hamilton-Jacobi-Bellman (HJB) equations need to be solved in a sequential time-stepping manner. In each time step, the policy iteration or its penalty variant is often applied due to their fast convergence rates. In this paper, we aim to solve for all time steps simultaneously, by applying the policy iteration to an ``all-at-once form" of the HJB equations, where two different parallel-in-time preconditioners are proposed to accelerate the solution of the linear systems within the policy iteration. Our proposed methods are generally applicable for such all-at-once forms of the HJB equation, arising from option pricing problems with optimal stopping and nontrivial underlying asset models. Numerical examples are presented to show the feasibility and robust convergence behavior of the proposed methodology.

math.NA

D-TIPO: Deep time-inconsistent portfolio optimization with stocks and options

In this paper, we propose a machine learning algorithm for time-inconsistent portfolio optimization. The proposed algorithm builds upon neural network based trading schemes, in which the asset allocation at each time point is determined by a a neural network. The loss function is given by an empirical version of the objective function of the portfolio optimization problem. Moreover, various trading constraints are naturally fulfilled by choosing appropriate activation functions in the output layers of the neural networks. Besides this, our main contribution is to add options to the portfolio of risky assets and a risk-free bond and using additional neural networks to determine the amount allocated into the options as well as their strike prices. We consider objective functions more in line with the rational preference of an investor than the classical mean-variance, apply realistic trading constraints and model the assets with a correlated jump-diffusion SDE. With an incomplete market and a more involved objective function, we show that it is beneficial to add options to the portfolio. Moreover, it is shown that adding options leads to a more constant stock allocation with less demand for drastic re-allocations.

q-fin.PM

A new self-exciting jump-diffusion process for option pricing

We propose a new jump-diffusion process, the Heston-Queue-Hawkes (HQH) model, combining the well-known Heston model and the recently introduced Queue-Hawkes (Q-Hawkes) jump process. Like the Hawkes process, the HQH model can capture the effects of self-excitation and contagion. However, since the characteristic function of the HQH process is known in closed-form, Fourier-based fast pricing algorithms, like the COS method, can be fully exploited with this model. Furthermore, we show that by using partial integrals of the characteristic function, which are also explicitly known for the HQH process, we can reduce the dimensionality of the COS method, and so its numerical complexity. Numerical results for European and Bermudan options show that the HQH model offers a wider range of volatility smiles compared to the Bates model, while its computational burden is considerably smaller than that of the Heston-Hawkes (HH) process.

q-fin.PR