Polynomial Approximation of Discounted Moments
We introduce an approximation strategy for the discounted moments of a stochastic process that can, for a large class of problems, approximate the true moments. These moments appear in pricing formulas of financial products such as bonds and credit derivatives. The approximation relies on high-order power series expansion of the infinitesimal generator, and draws parallels with the theory of polynomial processes. We demonstrate applications to bond pricing and credit derivatives. In the special cases that allow for an analytical solution the approximation error decreases to around 10 to 100 times machine precision for higher orders. When no analytical solution exists we tie out the approximation with Monte Carlo simulations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Moment Propagation of Discrete-Time Stochastic Polynomial Systems using Truncated Carleman Linearization
We propose a method to compute an approximation of the moments of a discrete-time stochastic polynomial system. We use the Carleman linearization technique to transform this finite-dimensional polynomial system into an i…
Moment Propagation of Polynomial Systems Through Carleman Linearization for Probabilistic Safety Analysis
We develop a method to approximate the moments of a discrete-time stochastic polynomial system. Our method is built upon Carleman linearization with truncation. Specifically, we take a stochastic polynomial system with f…
Perturbative Corrections for Approximate Inference in Gaussian Latent Variable Models
Expectation Propagation (EP) provides a framework for approximate inference. When the model under consideration is over a latent Gaussian field, with the approximation being Gaussian, we show how these approximations can…
Neural Injective Functions for Multisets, Measures and Graphs via a Finite Witness Theorem
Injective multiset functions have a key role in the theoretical study of machine learning on multisets and graphs. Yet, there remains a gap between the provably injective multiset functions considered in theory, which ty…
Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs
We study the infinite-horizon average-reward reinforcement learning with linear MDPs. Previous approaches either suffer from computational inefficiency or require strong assumptions on dynamics, such as ergodicity, for a…