Chebyshev Interpolation

Function approximations for counterparty credit exposure calculations ArXiv ID: 2507.09004 “View on arXiv” Authors: Domagoj Demeterfi, Kathrin Glau, Linus Wunderlich Abstract The challenge to measure exposures regularly forces financial institutions into a choice between an overwhelming computational burden or oversimplification of risk. To resolve this unsettling dilemma, we systematically investigate replacing frequently called derivative pricers by function approximations covering all practically relevant exposure measures, including quantiles. We prove error bounds for exposure measures in terms of the $L^p$ norm, $1 \leq p < \infty$, and for the uniform norm. To fully exploit these results, we employ the Chebyshev interpolation and show exponential convergence of the resulting exposure calculations. As our main result we derive probabilistic and finite sample error bounds under mild conditions including the natural case of unbounded risk factors. We derive an asymptotic efficiency gain scaling with $n^{“1/2-\varepsilon”}$ for any $\varepsilon>0$ with $n$ the number of simulations. Our numerical experiments cover callable, barrier, stochastic volatility and jump features. Using 10,000 simulations, we consistently observe significant run-time reductions in all cases with speed-up factors up to 230, and an average speed-up of 87. We also present an adaptive choice of the interpolation degree. Finally, numerical examples relying on the approximation of Greeks highlight the merit of the method beyond the presented theory. ...

Effective dimensionality reduction for Greeks computation using Randomized QMC ArXiv ID: 2504.11576 “View on arXiv” Authors: Unknown Abstract Global sensitivity analysis is employed to evaluate the effective dimension reduction achieved through Chebyshev interpolation and the conditional pathwise method for Greek estimation of discretely monitored barrier options and arithmetic average Asian options. We compare results from finite difference and Monte Carlo methods with those obtained by using randomized Quasi Monte Carlo combined with Brownian bridge discretization. Additionally, we investigate the benefits of incorporating importance sampling with either the finite difference or Chebyshev interpolation methods. Our findings demonstrate that the reduced effective dimensionality identified through global sensitivity analysis explains the performance advantages of one approach over another. Specifically, the increased smoothness provided by Chebyshev or conditional pathwise methods enhances the convergence rate of randomized Quasi Monte Carlo integration, leading to the significant increase of accuracy and reduced computational costs. ...

Machine-learning regression methods for American-style path-dependent contracts ArXiv ID: 2311.16762 “View on arXiv” Authors: Unknown Abstract Evaluating financial products with early-termination clauses, in particular those with path-dependent structures, is challenging. This paper focuses on Asian options, look-back options, and callable certificates. We will compare regression methods for pricing and computing sensitivities, highlighting modern machine learning techniques against traditional polynomial basis functions. Specifically, we will analyze randomized recurrent and feed-forward neural networks, along with a novel approach using signatures of the underlying price process. For option sensitivities like Delta and Gamma, we will incorporate Chebyshev interpolation. Our findings show that machine learning algorithms often match the accuracy and efficiency of traditional methods for Asian and look-back options, while randomized neural networks are best for callable certificates. Furthermore, we apply Chebyshev interpolation for Delta and Gamma calculations for the first time in Asian options and callable certificates. ...