Importance Sampling
Importance sampling is a powerful variance reduction technique that exploits the fact that the Monte Carlo estimator converges more quickly if the samples are taken from a distribution that is similar to the function in the integrand. The basic idea is that by concentrating work where the value of the integrand is relatively high, an accurate estimate is computed more efficiently (Figure 13.19). For example, suppose we are evaluating the scattering equation, Equation (5.9). Consider what happens when this integral is estimated; if a direction is randomly sampled that is nearly perpendicular to the surface normal, the cosine term will be close to 0. All the expense of evaluating the BSDF and tracing a ray to find the incoming radiance at that sample location will be essentially wasted, as the contribution to the final result will be minuscule. In general, we would be better served if we sampled directions in a way that reduced the likelihood of choosing directions near the horizon. Mo
Importance Sampling 13.10 Importance Sampling Importance sampling is a powerful variance reduction technique that exploits the fact that the Monte Carlo estimator converges more quickly if the samples are taken from a distribution that is similar to the function in the integrand. The basic idea is that by concentrating work where the value of the integrand is relatively high, an accurate estimate is computed more efficiently (Figure 13.19 ). Figure 13.19: (1) Using a stratified uniform distribution of rays over the hemisphere gives an image with much more variance than (2) applying importance
Explore this link on the map →related reading
- Importance Sampling Explained | Built Inbuiltin.com
- Efficient Weighted Sampling // A Random Walk Through Geek-Spacesebastiansylvan.com
- Competing with sampling — Alignment Research Centeralignment.org
- Inverse transform sampling - Wikipediaen.wikipedia.org
- Approximating KL Divergencejoschu.net
- [2411.13462] Sampling and Integration of Logconcave Functions by Algorithmic Diffusionarxiv.org
- ARC progress update: Competing with sampling — LessWronglesswrong.com
- Step-by-Step Diffusion: An Elementary Tutorialarxiv.org
- Gibbs sampling - Wikipediaen.wikipedia.org
- Visualizing Algorithmsbost.ocks.org
- Gregory Gundersengregorygundersen.com
- An optimization perspective on log-concave sampling and beyond | Sinho Chewichewisinho.github.io