Modelling joint dynamics of liquid vanilla options is crucial for arbitrage-free pricing of illiquid derivatives and managing risks of option trade books. This paper develops a nonparametric model for the European options book respecting underlying f
inancial constraints and while being practically implementable. We derive a state space for prices which are free from static (or model-independent) arbitrage and study the inference problem where a model is learnt from discrete time series data of stock and option prices. We use neural networks as function approximators for the drift and diffusion of the modelled SDE system, and impose constraints on the neural nets such that no-arbitrage conditions are preserved. In particular, we give methods to calibrate textit{neural SDE} models which are guaranteed to satisfy a set of linear inequalities. We validate our approach with numerical experiments using data generated from a Heston stochastic local volatility model.
The supercooled Stefan problem and its variants describe the freezing of a supercooled liquid in physics, as well as the large system limits of systemic risk models in finance and of integrate-and-fire models in neuroscience. Adopting the physics ter
minology, the supercooled Stefan problem is known to feature a finite-time blow-up of the freezing rate for a wide range of initial temperature distributions in the liquid. Such a blow-up can result in a discontinuity of the liquid-solid boundary. In this paper, we prove that the natural Euler time-stepping scheme applied to a probabilistic formulation of the supercooled Stefan problem converges to the liquid-solid boundary of its physical solution globally in time, in the Skorokhod M1 topology. In the course of the proof, we give an explicit bound on the rate of local convergence for the time-stepping scheme. We also run numerical tests to compare our theoretical results to the practically observed convergence behavior.
Option price data are used as inputs for model calibration, risk-neutral density estimation and many other financial applications. The presence of arbitrage in option price data can lead to poor performance or even failure of these tasks, making pre-
processing of the data to eliminate arbitrage necessary. Most attention in the relevant literature has been devoted to arbitrage-free smoothing and filtering (i.e. removing) of data. In contrast to smoothing, which typically changes nearly all data, or filtering, which truncates data, we propose to repair data by only necessary and minimal changes. We formulate the data repair as a linear programming (LP) problem, where the no-arbitrage relations are constraints, and the objective is to minimise prices changes within their bid and ask price bounds. Through empirical studies, we show that the proposed arbitrage repair method gives sparse perturbations on data, and is fast when applied to real world large-scale problems due to the LP formulation. In addition, we show that removing arbitrage from prices data by our repair method can improve model calibration with enhanced robustness and reduced calibration error.
