{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T18:55:45Z","timestamp":1784055345334,"version":"3.55.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"crossref","award":["956585"],"award-info":[{"award-number":["956585"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>Russian roulette and splitting are widely used techniques to increase the efficiency of Monte Carlo estimators. But, despite their popularity, there is little work on how to best apply them. Most existing approaches rely on simple heuristics based on, e.g., surface albedo and roughness. Their efficiency often hinges on user-controlled parameters. We instead iteratively learn optimal Russian roulette and splitting factors during rendering, using a simple and lightweight data structure. Given perfect estimates of variance and cost, our fixed-point iteration provably converges to the optimal Russian roulette and splitting factors that maximize the rendering efficiency. In our application to unidirectional path tracing, we achieve consistent and significant speed-ups over the state of the art.<\/jats:p>","DOI":"10.1145\/3528223.3530168","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T21:06:27Z","timestamp":1658523987000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["EARS"],"prefix":"10.1145","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6084-2942","authenticated-orcid":false,"given":"Alexander","family":"Rath","sequence":"first","affiliation":[{"name":"Saarland University, Germany and German Research Center for Artificial Intelligence (DFKI), Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5325-3744","authenticated-orcid":false,"given":"Pascal","family":"Grittmann","sequence":"additional","affiliation":[{"name":"Saarland University, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1731-2548","authenticated-orcid":false,"given":"Sebastian","family":"Herholz","sequence":"additional","affiliation":[{"name":"Intel Corporation, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4276-1804","authenticated-orcid":false,"given":"Philippe","family":"Weier","sequence":"additional","affiliation":[{"name":"Saarland University, Germany and German Research Center for Artificial Intelligence (DFKI), Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2189-2429","authenticated-orcid":false,"given":"Philipp","family":"Slusallek","sequence":"additional","affiliation":[{"name":"Saarland University, Germany and German Research Center for Artificial Intelligence (DFKI), Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Attila T. \u00c1fra. 2019. Intel\u00ae Open Image Denoise. https:\/\/www.openimagedenoise.org\/."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/97879.97886"},{"key":"e_1_2_2_3_1","volume-title":"Sur les op\u00e9rations dans les ensembles abstraits et leur application aux \u00e9quations int\u00e9grales. Fund. math 3, 1","author":"Banach Stefan","year":"1922","unstructured":"Stefan Banach. 1922. Sur les op\u00e9rations dans les ensembles abstraits et leur application aux \u00e9quations int\u00e9grales. Fund. math 3, 1 (1922), 133--181."},{"key":"e_1_2_2_4_1","volume-title":"Iterative approximation of fixed points","author":"Berinde Vasile","unstructured":"Vasile Berinde. 2007. Iterative approximation of fixed points. Vol. 1912. Springer."},{"key":"e_1_2_2_5_1","unstructured":"Benedikt Bitterli. 2016. Rendering resources. https:\/\/benedikt-bitterli.me\/resources\/"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6858-5_6"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3478513.3480547"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366211"},{"key":"e_1_2_2_9_1","volume-title":"Modeling the interaction of light between diffuse surfaces. ACM SIGGRAPH computer graphics 18, 3","author":"Goral Cindy M","year":"1984","unstructured":"Cindy M Goral, Kenneth E Torrance, Donald P Greenberg, and Bennett Battaile. 1984. Modeling the interaction of light between diffuse surfaces. ACM SIGGRAPH computer graphics 18, 3 (1984), 213--222."},{"key":"e_1_2_2_10_1","volume-title":"Correlation-Aware Multiple Importance Sampling for Bidirectional Rendering Algorithms. Comput. Graph. Forum (EG 2021) 40, 2","author":"Grittmann Pascal","year":"2021","unstructured":"Pascal Grittmann, Iliyan Georgiev, and Philipp Slusallek. 2021. Correlation-Aware Multiple Importance Sampling for Bidirectional Rendering Algorithms. Comput. Graph. Forum (EG 2021) 40, 2 (2021)."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366210"},{"key":"e_1_2_2_12_1","unstructured":"J.M. Hammersley and D.C. Handscomb. 1968. Monte Carlo Methods. Springer Dordrecht."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230635"},{"key":"e_1_2_2_14_1","unstructured":"Wenzel Jakob. 2010. Mitsuba renderer. http:\/\/www.mitsuba-renderer.org."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/15886.15902"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/127719.122735"},{"key":"e_1_2_2_17_1","volume-title":"Willems","author":"Lafortune Eric P.","year":"1993","unstructured":"Eric P. Lafortune and Yves D. Willems. 1993. Bi-Directional Path Tracing. 93 (Dec. 1993), 145--153."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13227"},{"key":"e_1_2_2_19_1","unstructured":"Matt Pharr Wenzel Jakob and Greg Humphreys. 2016. Physically based rendering: From theory to implementation. Morgan Kaufmann."},{"key":"e_1_2_2_20_1","first-page":"4","article-title":"Probabilistic Connections for Bidirectional Path","volume":"34","author":"Popov Stefan","year":"2015","unstructured":"Stefan Popov, Ravi Ramamoorthi, Fredo Durand, and George Drettakis. 2015. Probabilistic Connections for Bidirectional Path Tracing. Comput. Graph. Forum 34, 4 (jul 2015), 75--86.","journal-title":"Tracing. Comput. Graph. Forum"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","unstructured":"Alexander Rath Pascal Grittmann Sebastian Herholz Philippe Weier and Philipp Slusallek. 2022. Implementation of EARS: Efficiency-Aware Russian Roulette and Splitting. 10.5281\/zenodo.6514751","DOI":"10.5281\/zenodo.6514751"},{"key":"e_1_2_2_22_1","unstructured":"Mateu Sbert Vlastimil Havran and L\u00e1szl\u00f3 Szirmay-Kalos. 2019. Optimal Deterministic Mixture Sampling.. In Eurographics (Short Papers). 73--76."},{"key":"e_1_2_2_23_1","volume-title":"Go with the winners strategy in path tracing. \u00a9 Journal of WSCG","author":"Szirmay-Kalos L\u00e1szl\u00f3","year":"2005","unstructured":"L\u00e1szl\u00f3 Szirmay-Kalos. 2005. Go with the winners strategy in path tracing. \u00a9 Journal of WSCG, 2005, vol. 13, n\u00fam. 1--3, p. 49--56 (2005)."},{"key":"e_1_2_2_24_1","unstructured":"L\u00e1szl\u00f3 Sz\u00e9csi L\u00e1szl\u00f3 Szirmay-Kalos and Csaba Kelemen. 2003. Variance Reduction for Russian-roulette."},{"key":"e_1_2_2_25_1","volume-title":"Robust Monte Carlo methods for light transport simulation","author":"Veach Eric","unstructured":"Eric Veach. 1997. Robust Monte Carlo methods for light transport simulation. Stanford University PhD thesis."},{"key":"e_1_2_2_26_1","volume-title":"Photorealistic Rendering Techniques","author":"Veach Eric","unstructured":"Eric Veach and Leonidas Guibas. 1995a. Bidirectional estimators for light transport. In Photorealistic Rendering Techniques. Springer, 145--167."},{"key":"e_1_2_2_27_1","volume-title":"Optimally Combining Sampling Techniques for Monte Carlo Rendering. In SIGGRAPH '95","author":"Veach Eric","year":"1995","unstructured":"Eric Veach and Leonidas J Guibas. 1995b. Optimally Combining Sampling Techniques for Monte Carlo Rendering. In SIGGRAPH '95. ACM, 419--428."},{"key":"e_1_2_2_28_1","volume-title":"On-line Learning of Parametric Mixture Models for Light Transport Simulation. ACM Trans. Graph. (Proceedings of SIGGRAPH 2014)","author":"Vorba Ji\u0159\u00ed","year":"2014","unstructured":"Ji\u0159\u00ed Vorba, Ond\u0159ej Karl\u00edk, Martin \u0160ik, Tobias Ritschel, and Jaroslav K\u0159iv\u00e1nek. 2014. On-line Learning of Parametric Mixture Models for Light Transport Simulation. ACM Trans. Graph. (Proceedings of SIGGRAPH 2014) 33, 4 (2014)."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925912"},{"key":"e_1_2_2_30_1","volume-title":"Computer graphics forum","author":"Zwicker Matthias","unstructured":"Matthias Zwicker, Wojciech Jarosz, Jaakko Lehtinen, Bochang Moon, Ravi Ramamoorthi, Fabrice Rousselle, Pradeep Sen, Cyril Soler, and S-E Yoon. 2015. Recent advances in adaptive sampling and reconstruction for Monte Carlo rendering. In Computer graphics forum, Vol. 34. Wiley Online Library, 667--681."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530168","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528223.3530168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:49Z","timestamp":1750186969000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530168"}},"subtitle":["efficiency-aware russian roulette and splitting"],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1145\/3528223.3530168"],"URL":"https:\/\/doi.org\/10.1145\/3528223.3530168","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"2022-07-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}