MARS: Multi-sample Allocation through Russian roulette and Splitting
Joshua Meyer (Saarland University), Alexander Rath (Saarland, University), \"Omercan Yazici (Saarland University), Philipp Slusallek, (German Research Center for Artificial Intelligence, Saarland University)

TL;DR
This paper introduces a flexible, iterative sample allocation method for multiple importance sampling that optimizes sample distribution across techniques, significantly improving rendering efficiency in path guiding and bidirectional path tracing.
Contribution
It presents a novel, lightweight iterative approach to optimize sample counts per technique, bridging the gap between mixture sampling and fixed-point spatial variation methods.
Findings
Achieves substantial speedups in path guiding.
Demonstrates improvements in bidirectional path tracing.
Provides a flexible, local sample allocation strategy.
Abstract
Multiple importance sampling (MIS) is an indispensable tool in rendering that constructs robust sampling strategies by combining the respective strengths of individual distributions. Its efficiency can be greatly improved by carefully selecting the number of samples drawn from each distribution, but automating this process remains a challenging problem. Existing works are mostly limited to mixture sampling, in which only a single sample is drawn in total, and the works that do investigate multi-sample MIS only optimize the sample counts at a per-pixel level, which cannot account for variations beyond the first bounce. Recent work on Russian roulette and splitting has demonstrated how fixed-point schemes can be used to spatially vary sample counts to optimize image efficiency but is limited to choosing the same number of samples across all sampling strategies. Our work proposes a highly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
