Related papers: Higher Order Binaries with Time Dependent Coeffici…
Verification of higher-order probabilistic programs is a challenging problem. We present a verification method that supports several quantitative properties of higher-order probabilistic programs. Usually, extending verification methods to…
We study iterative methods for (two-stage) robust combinatorial optimization problems with discrete uncertainty. We propose a machine-learning-based heuristic to determine starting scenarios that provide strong lower bounds. To this end, we…
We propose a time-adaptive, high-order compact finite difference scheme for option pricing in a family of stochastic volatility models. We employ a semi-discrete high-order compact finite difference method for the spatial discretisation,…
We consider a new family of derivatives whose payoffs become strictly positive when the price of their underlying asset falls relative to its historical maximum. We derive the solution to the discretionary stopping problems arising in the…
This paper studies the problem of online parameter estimation for cyber-physical systems with binary outputs that may be subject to adversarial data tampering. Existing methods are primarily offline and unsuitable for real-time learning. To…
This paper concerns the numerical valuation of swing options with discrete action times under a linear two-factor mean-reverting model with jumps. The resulting sequence of two-dimensional partial integro-differential equations (PIDEs) are…
The prediction of a binary sequence is a classic example of online machine learning. We like to call it the 'stock prediction problem,' viewing the sequence as the price history of a stock that goes up or down one unit at each time step. In…
In this paper, we deal with an axiomatic approach to default risk. We introduce the notion of a default risk measure, which generalizes the classical probability of default (PD), and allows to incorporate model risk in various forms. We…
We consider a two-asset non-linear model of option pricing in an environment where the correlation is not known precisely, but varies between two known values. First we discuss the non-negativity of the solution of the equation. Next, we…
In this paper, we study how a budget-constrained bidder should learn to bid adaptively in repeated first-price auctions to maximize cumulative payoff. This problem arises from the recent industry-wide shift from second-price auctions to…
We consider option pricing using replicating binomial trees, with a two fold purpose. The first is to introduce ESG valuation into option pricing. We explore this in a number of scenarios, including enhancement of yield due to trader…
We study the optimal timing of derivative purchases in incomplete markets. In our model, an investor attempts to maximize the spread between her model price and the offered market price through optimally timing her purchase. Both the…
While defaults are rare events, losses can be substantial even for credit portfolios with a large number of contracts. Therefore, not only a good evaluation of the probability of default is crucial, but also the severity of losses needs to…
We introduce a modular framework that extends the signature method to handle American option pricing under evolving volatility roughness. Building on the signature-pricing framework of Bayer et al. (2025), we add three practical…
As is known, an option price is a solution to a certain partial differential equation (PDE) with terminal conditions (payoff functions). There is a close association between the solution of PDE and the solution of a backward stochastic…
The use of deep neural networks to make high risk decisions creates a need for global and local explanations so that users and experts have confidence in the modeling algorithms. We introduce a novel technique to find global and local…
This article presents a type-based analysis for deriving upper bounds on the expected execution cost of probabilistic programs. The analysis is naturally compositional, parametric in the cost model, and supports higher order functions and…
Parameter fitting of data to a proposed equation almost always consider these parameters as independent variables. Here, the method proposed optimizes an arbitrary number of variables by the minimization of a function of a single variable.…
We develop a novel deep learning approach for pricing European options in diffusion models, that can efficiently handle high-dimensional problems resulting from Markovian approximations of rough volatility models. The option pricing partial…
In this paper we propose a simple and efficient method to compute the ordered default time distributions in both the homogeneous case and the two-group heterogeneous case under the interacting intensity default contagion model. We give the…