# Guiding-Based Importance Sampling for Walk on Stars

arXiv: https://arxiv.org/abs/2410.18944 · HTML: https://mlsanity.com/paper/2410.18944/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Oct 2024.

## Built on by (most cited first, 2 of 2)

- [Monte Carlo Steklov Operators for Large-Scale Geometry Processing in the Wild](https://mlsanity.com/paper/2606.05581/) (2026)
- [Neural Harmonic Measure Operator](https://mlsanity.com/paper/2609.35752/) (2026)

## Abstract (arXiv)

Walk on stars (WoSt) has shown its power in being applied to Monte Carlo methods for solving partial differential equations, but the sampling techniques in WoSt are not satisfactory, leading to high variance. We propose a guiding-based importance sampling method to reduce the variance of WoSt. Drawing inspiration from path guiding in rendering, we approximate the directional distribution of the recursive term of WoSt using online-learned parametric mixture distributions, decoded by a lightweight neural field. This adaptive approach enables importance sampling the recursive term, which lacks shape information before computation. We introduce a reflection technique to represent guiding distributions at Neumann boundaries and incorporate multiple importance sampling with learnable selection probabilities to further reduce variance. We also present a practical GPU implementation of our method. Experiments show that our method effectively reduces variance compared to the original WoSt, given the same time or the same sample budget. Code and data for this paper are at https://github.com/tyanyuy3125/elaina.