Counterparts of variance reduction techniques for Quasi-Monte Carlo integration
Bennett L. Fox
Abstract
Bennett L. Fox
Abstract
Quasi-Monte Carlo integration, when applicable, has an order of magnitude smaller error bound than standard Monte Carlo. For the former we consider analogs of variance reduction techniques for the latter and discuss their effectiveness. The results are applicable to stochastic programming and stochastic networks, for example.A May 1983 technical report by the same title is available from the author.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Quasi-Monte Carlo integration, when applicable, has an order of magnitude smaller error bound than standard Monte Carlo. For the former we consider analogs of variance reduction techniques for the latter and discuss their effectiveness. The results are applicable to stochastic programming and stochastic networks, for example.A May 1983 technical report by the same title is available from the author.
Key concepts: Variance reduction, Monte Carlo method, Control variates, Monte Carlo integration, Quasi-Monte Carlo method, Computer science, Reduction (mathematics), Variance (accounting)