Approximating inverse cumulative distribution functions to produce approximate random variables
For random variables produced through the inverse transform method, approximate random variables are introduced, which are produced using approximations to a distribution’s inverse cumulative distribution function. These approximations are designed to be computationally inexpensive, and much cheaper...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Association for Computing Machinery
2023
|
| _version_ | 1826311084924993536 |
|---|---|
| author | Giles, M Sheridan-Methven, O |
| author_facet | Giles, M Sheridan-Methven, O |
| author_sort | Giles, M |
| collection | OXFORD |
| description | For random variables produced through the inverse transform method, approximate random variables are introduced, which are produced using approximations to a distribution’s inverse cumulative distribution function. These approximations are designed to be computationally inexpensive, and much cheaper than library functions which are exact to within machine precision, and thus highly suitable for use in Monte Carlo simulations. The approximation errors they introduce can then be eliminated through use of the multilevel Monte Carlo method. Two approximations are presented for the Gaussian distribution: a piecewise constant on equally spaced intervals, and a piecewise linear using geometrically decaying intervals. The errors of the approximations are bounded and the convergence demonstrated, and the computational savings measured for C and C++ implementations. Implementations tailored for Intel and Arm hardware are inspected, alongside hardware agnostic implementations built using OpenMP. The savings are incorporated into a nested multilevel Monte Carlo framework with the Euler-Maruyama scheme to exploit the speed ups without losing accuracy, offering speed ups by a factor of 5–7. These ideas are empirically extended to the Milstein scheme, and the non-central χ2 distribution for the Cox-Ingersoll-Ross process, offering speed ups of a factor of 250 or more. |
| first_indexed | 2024-03-07T08:03:09Z |
| format | Journal article |
| id | oxford-uuid:1bcb9c71-6e1a-44a3-98cd-1bb09dd10c8f |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T08:03:09Z |
| publishDate | 2023 |
| publisher | Association for Computing Machinery |
| record_format | dspace |
| spelling | oxford-uuid:1bcb9c71-6e1a-44a3-98cd-1bb09dd10c8f2023-10-12T15:56:45ZApproximating inverse cumulative distribution functions to produce approximate random variablesJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:1bcb9c71-6e1a-44a3-98cd-1bb09dd10c8fEnglishSymplectic ElementsAssociation for Computing Machinery2023Giles, MSheridan-Methven, OFor random variables produced through the inverse transform method, approximate random variables are introduced, which are produced using approximations to a distribution’s inverse cumulative distribution function. These approximations are designed to be computationally inexpensive, and much cheaper than library functions which are exact to within machine precision, and thus highly suitable for use in Monte Carlo simulations. The approximation errors they introduce can then be eliminated through use of the multilevel Monte Carlo method. Two approximations are presented for the Gaussian distribution: a piecewise constant on equally spaced intervals, and a piecewise linear using geometrically decaying intervals. The errors of the approximations are bounded and the convergence demonstrated, and the computational savings measured for C and C++ implementations. Implementations tailored for Intel and Arm hardware are inspected, alongside hardware agnostic implementations built using OpenMP. The savings are incorporated into a nested multilevel Monte Carlo framework with the Euler-Maruyama scheme to exploit the speed ups without losing accuracy, offering speed ups by a factor of 5–7. These ideas are empirically extended to the Milstein scheme, and the non-central χ2 distribution for the Cox-Ingersoll-Ross process, offering speed ups of a factor of 250 or more. |
| spellingShingle | Giles, M Sheridan-Methven, O Approximating inverse cumulative distribution functions to produce approximate random variables |
| title | Approximating inverse cumulative distribution functions to produce approximate random variables |
| title_full | Approximating inverse cumulative distribution functions to produce approximate random variables |
| title_fullStr | Approximating inverse cumulative distribution functions to produce approximate random variables |
| title_full_unstemmed | Approximating inverse cumulative distribution functions to produce approximate random variables |
| title_short | Approximating inverse cumulative distribution functions to produce approximate random variables |
| title_sort | approximating inverse cumulative distribution functions to produce approximate random variables |
| work_keys_str_mv | AT gilesm approximatinginversecumulativedistributionfunctionstoproduceapproximaterandomvariables AT sheridanmethveno approximatinginversecumulativedistributionfunctionstoproduceapproximaterandomvariables |