Recognition: unknown
A randomized Halton algorithm in R
read the original abstract
Randomized quasi-Monte Carlo (RQMC) sampling can bring orders of magnitude reduction in variance compared to plain Monte Carlo (MC) sampling. The extent of the efficiency gain varies from problem to problem and can be hard to predict. This article presents an R function rhalton that produces scrambled versions of Halton sequences. On some problems it brings efficiency gains of several thousand fold. On other problems, the efficiency gain is minor. The code is designed to make it easy to determine whether a given integrand will benefit from RQMC sampling. An RQMC sample of n points in $[0,1]^d$ can be extended later to a larger n and/or d.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Sampling-based Model Predictive Control Using Trust Regions
A KL-divergence trust-region formulation for sampling-based MPC replaces heuristic hyperparameter adaptation with Lagrangian-optimal updates and improves convergence when combined with deterministic LCD sampling.
-
labrador: A domain-optimized machine-learning tool for gravitational wave inference
Labrador is a domain-optimized neural posterior estimation tool achieving 1% median importance-sampling efficiency and first extensive coverage of long-duration low-mass gravitational wave signals through equivariance...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.