arXiv research

This paper simplifies hedge ratios in financial models using pathwise algorithmic differentiation.

The Monte Carlo pathwise sensitivities approach is well established for smooth payoff functions. In this work, we present a new Monte Carlo algorithm that is able to calculate the pathwise sensitivities for discontinuous payoff functions. Our main tool is to combine the one-step survival idea of Glasserman and Staum wi…

We study the use of the multilevel Monte Carlo technique in the context of the calculation of Greeks. The pathwise sensitivity analysis differentiates the path evolution and reduces the payoff's smoothness. This leads to new challenges: the inapplicability of pathwise sensitivities to non-Lipschitz payoffs often makes …

New method reduces errors in pricing and sensitivities for discontinuous payoffs.

Quasi-Monte Carlo speeds up option Greeks calculation on GPUs.

Effective dimensionality reduction improves accuracy and reduces costs in estimating option Greeks.

We consider a strictly pathwise setting for Delta hedging exotic options, based on Föllmer's pathwise Itō calculus. Price trajectories are $d$-dimensional continuous functions whose pathwise quadratic variations and covariations are determined by a given local volatility matrix. The existence of Delta hedging strategie…

This work proposes using zero-variance control variates to reduce variance in pathwise gradient estimators for variational inference.

Pathwise uniqueness shown for specific stochastic equations.

Study cash-flow forecasting for derivatives, aligning with replication strategy and addressing timing frictions.

Second-order optimization speeds up deep hedging for complex options.

Develops pathwise analysis for log-optimal portfolios using rough paths theory.

Develops portfolio theory without probabilistic analysis, focusing on pathwise decomposition.

A new approach to continuous-time universal portfolios using pathwise Itô calculus.

The pathwise coordinate optimization is one of the most important computational frameworks for high dimensional convex and nonconvex sparse learning problems. It differs from the classical coordinate optimization algorithms in three salient features: {\it warm start initialization}, {\it active set updating}, and {\it …

We use pathwise Itô calculus to prove two strictly pathwise versions of the master formula in Fernholz' stochastic portfolio theory. Our first version is set within the framework of Föllmer's pathwise Itô calculus and works for portfolios generated from functions that may depend on the current states of the market port…

This paper deals with the computation of second or higher order greeks of financial securities. It combines two methods, Vibrato and automatic differentiation and compares with other methods. We show that this combined technique is faster than standard finite difference, more stable than automatic differentiation of se…

This paper develops a mathematical framework for the analysis of continuous-time trading strategies which, in contrast to the classical setting of continuous-time mathematical finance, does not rely on stochastic integrals or other probabilistic notions. Our purely analytic framework allows for the derivation of a path…

This paper gives several simple constructions of the pathwise Ito integral $\int_0^tφdω$ for an integrand $φ$ and a price path $ω$ as integrator, with $φ$ and $ω$ satisfying various topological and analytical conditions. The definitions are purely pathwise in that neither $φ$ nor $ω$ are assumed to be paths of stochast…

This dissertation advances scalable Gaussian processes using iterative methods and pathwise conditioning.

This work introduces efficient sampling methods for Gaussian processes by focusing on pathwise conditioning.

MuRiT efficiently computes multi-parameter persistence barcodes.

We exploit the link between the transport equation and derivatives of expectations to construct efficient pathwise gradient estimators for multivariate distributions. We focus on two main threads. First, we use null solutions of the transport equation to construct adaptive control variates that can be used to construct…

We observe that gradients computed via the reparameterization trick are in direct correspondence with solutions of the transport equation in the formalism of optimal transport. We use this perspective to compute (approximate) pathwise gradients for probability distributions not directly amenable to the reparameterizati…

We investigate whether it is possible to formulate option pricing and hedging models without using probability. We present a model that is consistent with two notions of volatility: a historical volatility consistent with statistical analysis, and an implied volatility consistent with options priced with the model. The…

Efficient estimators for smooth Hilbert-valued parameters with theoretical guarantees.

The paper optimizes bridge-type estimators for sparse models using pathwise methods.

Unified market making controls risk, arbitrage, and volatility surfaces.

We consider a class $\mathscr{X}$ of continuous functions on $[0,1]$ that is of interest from two different perspectives. First, it is closely related to sets of functions that have been studied as generalizations of the Takagi function. Second, each function in $\mathscr{X}$ admits a linear pathwise quadratic variatio…

This paper presents efficient sampling methods for Gaussian processes.

This study improves credit risk management using advanced reinforcement learning.

A new method in finance without probabilities or integrals.

Study shows how market firm capitalization models converge to stochastic PDE solutions.

Following a hedging based approach to model free financial mathematics, we prove that it should be possible to make an arbitrarily large profit by investing in those one-dimensional paths which do not possess local times. The local time is constructed from discrete approximations, and it is shown that it is $α$-Hölder …

Exact simulation method for market impact estimation under various execution strategies.

NM-PPG optimizes adaptive feature acquisition in POMDPs for better predictions.

Develops a method for solving optimal stopping problems with multiple exercise rights.

We provide a unifying treatment of pathwise moderate deviations for models commonly used in financial applications, and for related integrated functionals. Suitable scaling allows us to transfer these results into small-time, large-time and tail asymptotics for diffusions, as well as for option prices and realised vari…

Develops a fast algorithm for high-dimensional LASSO penalized quantile regression.

The paper proves signatures of non-geometric rough paths can approximate functionals uniformly.

Agent maximizes utility with pathwise constraint on portfolio value.

We study pathwise invariances of centred random fields that can be controlled through the covariance. A result involving composition operators is obtained in second-order settings, and we show that various path properties including additivity boil down to invariances of the covariance kernel. These results are extended…

In this paper we provide a pricing-hedging duality for the model-independent superhedging price with respect to a prediction set $Ξ\subseteq C[0,T]$, where the superhedging property needs to hold pathwise, but only for paths lying in $Ξ$. For any Borel measurable claim $ξ$ which is bounded from below, the superhedging …

Consider a family of portfolio strategies with the aim of achieving the asymptotic growth rate of the best one. The idea behind Cover's universal portfolio is to build a wealth-weighted average which can be viewed as a buy-and-hold portfolio of portfolios. When an optimal portfolio exists, the wealth-weighted average c…

We develop recursive, data-driven, stochastic subgradient methods for optimizing a new, versatile, and application-driven class of convex risk measures, termed here as mean-semideviations, strictly generalizing the well-known and popular mean-upper-semideviation. We introduce the MESSAGEp algorithm, which is an efficie…

A scalable method for BED with implicit models using approximate gradients.

Picasso is a new library for sparse learning problems in R and Python.

Method learns dynamics from noisy partial observations.