Improved option pricing for SABR model using Gauss-Hermite quadrature.
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
Efficient method for pricing Bermudan moving average options using GPR-GHQ.
In this study, a numerical quadrature for the generalized inverse Gaussian distribution is derived from the Gauss-Hermite quadrature by exploiting its relationship with the normal distribution. The proposed quadrature is not Gaussian, but it exactly integrates the polynomials of both positive and negative orders. Using…
This article is concerned with Gaussian process quadratures, which are numerical integration methods based on Gaussian process regression methods, and sigma-point methods, which are used in advanced non-linear Kalman filtering and smoothing algorithms. We show that many sigma-point methods can be interpreted as Gaussia…
There is a vast literature on numerical valuation of exotic options using Monte Carlo, binomial and trinomial trees, and finite difference methods. When transition density of the underlying asset or its moments are known in closed form, it can be convenient and more efficient to utilize direct integration methods to ca…
Gaussian Process Latent Variable Model (GPLVM) is a flexible framework to handle uncertain inputs in Gaussian Processes (GPs) and incorporate GPs as components of larger graphical models. Nonetheless, the standard GPLVM variational inference approach is tractable only for a narrow family of kernel functions. The most p…
Improves Bayesian optimization for multi-fidelity functions.
New approach improves computational efficiency of Bass Local Volatility model.
In this paper, we review pricing of variable annuity living and death guarantees offered to retail investors in many countries. Investors purchase these products to take advantage of market growth and protect savings. We present pricing of these products via an optimal stochastic control framework, and review the exist…
Sequential quantile estimation refers to incorporating observations into quantile estimates in an incremental fashion thus furnishing an online estimate of one or more quantiles at any given point in time. Sequential quantile estimation is also known as online quantile estimation. This area is relevant to the analysis …
New deep learning method for option pricing in jump-diffusion models.
In this paper we present a numerical valuation of variable annuities with combined Guaranteed Minimum Withdrawal Benefit (GMWB) and Guaranteed Minimum Death Benefit (GMDB) under optimal policyholder behaviour solved as an optimal stochastic control problem. This product simultaneously deals with financial risk, mortali…
We investigate the potential of stochastic neural networks for learning effective waveform-based acoustic models. The waveform-based setting, inherent to fully end-to-end speech recognition systems, is motivated by several comparative studies of automatic and human speech recognition that associate standard non-adaptiv…
New quadrature method using randomly pivoted Cholesky outperforms existing techniques.
A variable annuity contract with Guaranteed Minimum Withdrawal Benefit (GMWB) promises to return the entire initial investment through cash withdrawals during the policy life plus the remaining account balance at maturity, regardless of the portfolio performance. Under the optimal withdrawal strategy of a policyholder,…
Bayesian quadrature uses probabilistic models for estimating intractable integrals.
SOBER optimizes and quadrates efficiently in parallel for diverse tasks.
This paper presents a convergence analysis of kernel-based quadrature rules in misspecified settings, focusing on deterministic quadrature in Sobolev spaces. In particular, we deal with misspecified settings where a test integrand is less smooth than a Sobolev RKHS based on which a quadrature rule is constructed. We pr…
Improved Gaussian Process regression using TQFF over RFF and Gaussian QFF.
We study quadrature rules for functions from an RKHS, using nodes sampled from a determinantal point process (DPP). DPPs are parametrized by a kernel, and we use a truncated and saturated version of the RKHS kernel. This link between the two kernels, along with DPP machinery, leads to relatively tight bounds on the qua…
Bayesian quadrature improves integration efficiency with invariant priors.
Herding and kernel herding are deterministic methods of choosing samples which summarise a probability distribution. A related task is choosing samples for estimating integrals using Bayesian quadrature. We show that the criterion minimised when selecting samples in kernel herding is equivalent to the posterior varianc…
Herding and kernel herding are deterministic methods of choosing samples which summarise a probability distribution. A related task is choosing samples for estimating integrals using Bayesian quadrature. We show that the criterion minimised when selecting samples in kernel herding is equivalent to the posterior varianc…
This paper presents numerical algorithm and results for pricing a capital protection option offered by many asset managers for investment portfolios to take advantage of market growth and protect savings. Under optimal withdrawal policyholder behaviour the pricing of such a product is an optimal stochastic control prob…
Improved kernel quadrature with convex weights using subsampling.
A new type of quadrature is developed. The Gaussian quadrature, for a given measure, finds optimal values of a function's argument (nodes) and the corresponding weights. In contrast, the Lebesgue quadrature developed in this paper, finds optimal values of function (value-nodes) and the corresponding weights. The Gaussi…
The sigma-point filters, such as the UKF, which exploit numerical quadrature to obtain an additional order of accuracy in the moment transformation step, are popular alternatives to the ubiquitous EKF. The classical quadrature rules used in the sigma-point filters are motivated via polynomial approximation of the integ…
Adaptive Bayesian quadrature (ABQ) is a powerful approach to numerical integration that empirically compares favorably with Monte Carlo integration on problems of medium dimensionality (where non-adaptive quadrature is not competitive). Its key ingredient is an acquisition function that changes as a function of previou…
The aim of this article is to design a moment transformation for Student- t distributed random variables, which is able to account for the error in the numerically computed mean. We employ Student-t process quadrature, an instance of Bayesian quadrature, which allows us to treat the integral itself as a random variable…
Unified quadrature framework for large-scale kernel machines.
This paper introduces repulsive Monte Carlo methods for computing the sliced Wasserstein distance.
Novel approach for estimating conditional expectations using Bayesian quadrature.
New Fourier features improve high-precision approximation in large-scale problems.
Improved Nyström approximation for kernel quadrature with theoretical guarantees.
Computation of moments of transformed random variables is a problem appearing in many engineering applications. The current methods for moment transformation are mostly based on the classical quadrature rules which cannot account for the approximation errors. Our aim is to design a method for moment transformation for …
Parallelized Bayesian quadrature improves sample efficiency and inference.
A variable annuity contract with Guaranteed Minimum Withdrawal Benefit (GMWB) promises to return the entire initial investment through cash withdrawals during the contract plus the remaining account balance at maturity, regardless of the portfolio performance. Under the optimal(dynamic) withdrawal strategy of a policyh…
Adaptive quadrature improves Bayesian inference through active learning.
A new method calculates accurate SABR model option prices and deltas.
DBQPG improves policy gradient estimation with fewer samples.
Improved kernel herding algorithm for faster quadrature rule convergence.
Bayesian quadrature improves conformal prediction for better risk assessment.
Efficiently marginalizes over Gaussian Process kernels for better model flexibility and uncertainty.
The paper improves error bounds for Bayesian quadrature in noisy settings.
Bayesian Quadrature improves ensembling for neural networks with dispersed likelihood peaks.
We present a framework for accelerating a spectrum of machine learning algorithms that require computation of bilinear inverse forms , where is a positive definite matrix and a given vector. Our framework is built on Gauss-type quadrature and easily scales to large, sparse matrices. Further, it …
Several numerical approximation strategies for the expectation-propagation algorithm are studied in the context of large-scale learning: the Laplace method, a faster variant of it, Gaussian quadrature, and a deterministic version of variational sampling (i.e., combining quadrature with variational approximation). Exper…
BayesSum improves Bayesian quadrature for discrete domains, requiring fewer samples.