A weighted Discrepancy Bound of quasi-Monte Carlo Importance Sampling

01/21/2019
by   Josef Dick, et al.
0

Importance sampling Monte-Carlo methods are widely used for the approximation of expectations with respect to partially known probability measures. In this paper we study a deterministic version of such an estimator based on quasi-Monte Carlo. We obtain an explicit error bound in terms of the star-discrepancy for this method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2013

Monte Carlo Inference via Greedy Importance Sampling

We present a new method for conducting Monte Carlo inference in graphica...
research
07/28/2023

Quasi-Monte Carlo Algorithms (not only) for Graphics Software

Quasi-Monte Carlo methods have become the industry standard in computer ...
research
02/27/2023

Double-loop quasi-Monte Carlo estimator for nested integration

Nested integration arises when a nonlinear function is applied to an int...
research
06/20/2019

Pushing the Limits of Importance Sampling through Iterative Moment Matching

The accuracy of an integral approximation via Monte Carlo sampling depen...
research
09/11/2018

Rethinking the Effective Sample Size

The effective sample size (ESS) is widely used in sample-based simulatio...
research
10/23/2021

Doubly Robust Stein-Kernelized Monte Carlo Estimator: Simultaneous Bias-Variance Reduction and Supercanonical Convergence

Standard Monte Carlo computation is widely known to exhibit a canonical ...
research
10/14/2020

Conditional Monte Carlo revisited

Conditional Monte Carlo refers to sampling from the conditional distribu...

Please sign up or login with your details

Forgot password? Click here to reset