New approximations for Asian basket spread options using stochastic Taylor expansions.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
The paper is concerned with non-linear Gaussian filtering and smoothing in continuous-discrete state-space models, where the dynamic model is formulated as an Itô stochastic differential equation (SDE), and the measurements are obtained at discrete time instants. We propose novel Taylor moment expansion (TME) Gaussian …
We apply results of Malliavin-Thalmaier-Watanabe for strong and weak Taylor expansions of solutions of perturbed stochastic differential equations (SDEs). In particular, we work out weight expressions for the Taylor coefficients of the expansion. The results are applied to LIBOR market models in order to deal with the …
Paper introduces cubature method for stochastic Volterra equations.
We consider closed-form approximations for European put option prices within the Heston and GARCH diffusion stochastic volatility models with time-dependent parameters. Our methodology involves writing the put option price as an expectation of a Black-Scholes formula and performing a second-order Taylor expansion aroun…
Taylor expansions improve reinforcement learning policies.
New formulas for pricing Asian and basket options using stochastic expansion.
We derive asymptotic expansions for the prices of a variety of European and barrier-style claims in a general local-stochastic volatility setting. Our method combines Taylor series expansions of the diffusion coefficients with an expansion in the correlation parameter between the underlying asset and volatility process…
In this paper we study the pricing of exchange options when underlying assets have stochastic volatility and stochastic correlation. An approximation using a closed-form approximation based on a Taylor expansion of the conditional price is proposed. Numerical results are illustrated for exchanges between WTI and Brent …
Paper develops a new algorithm to find shortest paths on surfaces.
TaylorPODA uses Taylor expansions to improve feature attributions for opaque models.
Approximates option prices in Barndorff-Nielsen and Shephard models using Taylor expansion.
Proposes a method to estimate SDE noise from a single trajectory.
We provide a general method to compute a Taylor expansion in time of implied volatility for stochastic volatility models, using a heat kernel expansion. Beyond the order 0 implied volatility which is already known, we compute the first order correction exactly at all strikes from the scalar coefficient of the heat kern…
In this article we develop a method for the strong approximation of stochastic differential equations (SDEs) driven by Lévy processes or general semimartingales. The main ingredients of our method is the perturbation of the SDE and the Taylor expansion of the resulting parameterized curve. We apply this method to devel…
In this work we consider the Taylor expansion of the exponential map of a submanifold immersed in R^n up to order three, in order to introduce the concepts of lateral and frontal deviation. We compute the directions of extreme lateral and frontal deviation for surfaces in R^3. Also we compute, by using the Taylor expan…
Proposes a method for approximating transition densities of SDEs driven by gamma processes.
Taylorized training improves neural network training at finite width.
The paper calculates Bachelier option prices using Taylor expansions and applies it as a variance reduction technique.
Paper develops formulas for shape derivatives in wave scattering.
Develops AMITE for analyzing neural network nonlinearities.
In this paper we propose a closed-form approximation for the price of basket options under a multivariate Black-Scholes model, based on Taylor expansions and the calculation of mixed exponential-power moments of a Gaussian distribution. Our numerical results show that a second order expansion provides accurate prices o…
We introduce Taylor expansions that do not require the differentiability. We also provide new solutions to partial differential equations. We apply our methods to finance.
Expanding the rough Heston model in
A new method reduces variance in training discrete latent variable models.
New insights on pruning deep networks by preserving function locality.
We provide new exact Taylor's series with fixed coefficients and without the remainder. We demonstrate the usefulness of this contribution by using it to obtain very simple solutions to (non-linear) PDEs. We also apply the method to the portfolio model.
9We consider complex structures with totally real zero section of the tangent bundle. We assume that the complex structure tensor is real-analytic along the fibers of the tangent bundle. This assumption is quite natural in view of a well known existence result by Bruhat and Whitney. We provide explicit integrability eq…
In this paper we introduce a family of stochastic gradient estimation techniques based of the perturbative expansion around the mean of the sampling distribution. We characterize the bias and variance of the resulting Taylor-corrected estimators using the Lagrange error formula. Furthermore, we introduce a family of va…
This work explores functional expansions to handle path dependence in various fields.
Paper approximates XVA for European contingent claims using BSDEs and polynomial expansions.
Develops state-space deep Gaussian processes for irregular signals.
Iterative tilting fine-tunes diffusion models for reward-tilted distributions.
By analyzing the affine Taylor expansion of a non-degenerate plane curve, we obtain characterizations of classes of such curves via curvature properties of the gravity curve. The proof is based on an analysis of the degree parity and leading coefficients of polynomials occurring in the expansion.
The paper modifies asset pricing models using Taylor series expansions and market-based averages.
In this paper we study the pricing of exchange options under a dynamic described by stochastic correlation with random jumps. In particular, we consider a Ornstein-Uhlenbeck covariance model with Levy Background Noise Process driven by Inverse Gaussian subordinators. We use expansion in terms of Taylor polynomials and …
We introduce two simple models of forward-backward stochastic differential equations with a singular terminal condition and we explain how and why they appear naturally as models for the valuation of CO2 emission allowances. Single phase cap-and-trade schemes lead readily to terminal conditions given by indicator funct…
Study on Einstein deformations of negative Kähler Einstein metrics.
Paper proposes a closed-form formula for geometric Istanbul call options.
Study Bergman kernel metrics on degenerating hyperelliptic surfaces.
Although Deep Neural Networks(DNNs) have achieved successful applications in many fields, they are vulnerable to adversarial examples.Adversarial training is one of the most effective methods to improve the robustness of DNNs, and it is generally considered as solving a saddle point problem that minimizes risk and maxi…
Modern convolutional networks, incorporating rectifiers and max-pooling, are neither smooth nor convex; standard guarantees therefore do not apply. Nevertheless, methods from convex optimization such as gradient descent and Adam are widely used as building blocks for deep learning algorithms. This paper provides the fi…
Derives functional Itô formula for non-anticipative maps of rough paths.
TEAM generates more powerful adversarial examples for DNNs.
Formalizes synthetic differential geometry in Lean.
Paper extracts features from time series to improve forecasting accuracy.
We consider a financial market with liquidity cost as in Çetin, Jarrow and Protter [2004], where the supply function depends on a parameter with corresponding to the perfect liquid situation. Using the PDE characterization of Çetin, Soner and Touzi [2010] of the super-hedging cost of a…
Developing a differentially private deep learning algorithm is challenging, due to the difficulty in analyzing the sensitivity of objective functions that are typically used to train deep neural networks. Many existing methods resort to the stochastic gradient descent algorithm and apply a pre-defined sensitivity to th…