Pith. sign in

REVIEW

The importance of being scrambled: supercharged Quasi Monte Carlo

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.16548 v2 pith:VIRRQBVK submitted 2022-10-29 q-fin.CP

classification q-fin.CP
keywords carloerrormontepracticalconvergencemethodsprovidingquasi
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In many financial applications Quasi Monte Carlo (QMC) based on Sobol low-discrepancy sequences (LDS) outperforms Monte Carlo showing faster and more stable convergence. However, unlike MC QMC lacks a practical error estimate. Randomized QMC (RQMC) method combines the best of two methods. Application of scrambled LDS allow to compute confidence intervals around the estimated value, providing a practical error bound. Randomization of Sobol' LDS by two methods: Owen's scrambling and digital shift are compared considering computation of Asian options and Greeks using hyperbolic local volatility model. RQMC demonstrated the superior performance over standard QMC showing increased convergence rates and providing practical error bounds.

Discussion (0). Continue with ORCID to comment.

Pith tools