English
Related papers

Related papers: Chebyshev Methods for Ultra-efficient Risk Calcula…

200 papers

We present a numerical method for the frequent pricing of financial derivatives that depends on a large number of variables. The method is based on the construction of a polynomial basis to interpolate the value function of the problem by…

Computational Finance · Quantitative Finance 2017-09-27 Javier de Frutos , Victor Gaton

The valuation of over-the-counter derivatives is subject to a series of valuation adjustments known as xVA, which pose additional risks for financial institutions. Associated risk measures, such as the value-at-risk of an underlying…

Computational Finance · Quantitative Finance 2024-05-24 Michael B. Giles , Abdul-Lateef Haji-Ali , Jonathan Spence

Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative polynomial approximation algorithms to…

Signal Processing · Electrical Eng. & Systems 2025-04-22 Cheng Cheng , Qiyu Sun , Cong Zheng

In a recent paper we have suggested that the finite temperature density matrix can be computed efficiently by a combination of polynomial expansion and iterative inversion techniques. We present here significant improvements over this…

Materials Science · Physics 2010-10-19 Michele Ceriotti , Thomas D. Kühne , Michele Parrinello

Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…

Numerical Analysis · Mathematics 2017-04-19 Victor Y. Pan

Based upon the fast computation of the coefficients of the interpolation polynomials at Chebyshev-type points by FFT, DCT and IDST, respectively, together with the efficient evaluation of the modified moments by forwards recursions or by…

Numerical Analysis · Mathematics 2013-12-16 Shuhaung Xiang , Guo He , Haiyong Wang

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…

Pricing of Securities · Quantitative Finance 2025-07-21 Matteo Gambara , Giulia Livieri , Andrea Pallavicini

We study the problem of evaluating the excess risk of large-scale empirical risk minimization under the square loss. Leveraging the idea of wild refitting and resampling, we assume only black-box access to the training algorithm and develop…

Machine Learning · Computer Science 2026-04-03 Haichen Hu , David Simchi-Levi

Numerical challenges inherent in algorithms for computing worst Value-at-Risk in homogeneous portfolios are identified and solutions as well as words of warning concerning their implementation are provided. Furthermore, both conceptual and…

Risk Management · Quantitative Finance 2015-12-29 Marius Hofert , Amir Memartoluie , David Saunders , Tony Wirjanto

A new algebraic cubature formula of degree $2n+1$ for the product Chebyshev measure in the $d$-cube with $\approx n^d/2^{d-1}$ nodes is established. The new formula is then applied to polynomial hyperinterpolation of degree $n$ in three…

Numerical Analysis · Mathematics 2008-05-26 Stefano De Marchi , Marco Vianello , Yuan Xu

A critical problem in the financial world deals with the management of risk, from regulatory risk to portfolio risk. Many such problems involve the analysis of securities modelled by complex dynamics that cannot be captured analytically,…

Quantum Physics · Physics 2025-04-03 Jeong Yu Han , Bin Cheng , Dinh-Long Vu , Patrick Rebentrost

In this paper we propose a novel algorithm, factored value iteration (FVI), for the approximate solution of factored Markov decision processes (fMDPs). The traditional approximate value iteration algorithm is modified in two ways. For one,…

Artificial Intelligence · Computer Science 2008-08-13 Istvan Szita , Andras Lorincz

Cross-validation (CV) is one of the most popular tools for assessing and selecting predictive models. However, standard CV suffers from high computational cost when the number of folds is large. Recently, under the empirical risk…

Methodology · Statistics 2023-05-30 Yuetian Luo , Zhimei Ren , Rina Foygel Barber

The constrained mock-Chebyshev least squares operator is a linear approximation operator based on an equispaced grid of points. Like other polynomial or rational approximation methods, it was recently introduced in order to defeat the Runge…

Numerical Analysis · Mathematics 2022-09-21 Francesco Dell'Accio , Federico Nudo

Valuation adjustments, collectively named XVA, play an important role in modern derivatives pricing to take into account additional price components such as counterparty and funding risk premia. They are an exotic price component carrying a…

Pricing of Securities · Quantitative Finance 2025-03-06 Lorenzo Silotto , Marco Scaringi , Marco Bianchetti

Methods for stochastic trace estimation often require the repeated evaluation of expressions of the form $z^T p_n(A)z$, where $A$ is a symmetric matrix and $p_n$ is a degree $n$ polynomial written in the standard or Chebyshev basis. We show…

Numerical Analysis · Mathematics 2021-01-05 Eric Hallman

One way to investigate the precision of estimates likely to result from planned experiments and planned epidemiological studies is to simulate a large number of possible outcomes and analyse the sets of possible results. This appears to be…

Computation · Statistics 2013-06-28 G. K. Robinson , L. M. Ryan

Risk allocation, the decomposition of a portfolio-wide risk measure into component contributions, is a fundamental problem in financial risk management due to the non-additive nature of risk measures, the layered organizational structures…

Risk Management · Quantitative Finance 2025-12-25 Marco Scaringi , Marco Bianchetti

For a function that is analytic on and around an interval, Chebyshev polynomial interpolation provides spectral convergence. However, if the function has a singularity close to the interval, the rate of convergence is near one. In these…

Numerical Analysis · Mathematics 2017-08-10 Kevin W. Aiton , Tobin A. Driscoll

A novel method which is called the Chebyshev inertial iteration for accelerating the convergence speed of fixed-point iterations is presented. The Chebyshev inertial iteration can be regarded as a valiant of the successive over relaxation…

Optimization and Control · Mathematics 2021-06-09 Tadashi Wadayama , Satoshi Takabe