Joint Sampling and Optimisation for Inverse Rendering
Not on the map. Why?
Abstract (arXiv)
When dealing with difficult inverse problems such as inverse rendering, using Monte Carlo estimated gradients to optimise parameters can slow down convergence due to variance. Averaging many gradient samples in each iteration reduces this variance trivially. However, for problems that require thousands of optimisation iterations, the computational cost of this approach rises quickly. We derive a theoretical framework for interleaving sampling and optimisation. We update and reuse past samples with low-variance finite-difference estimators that describe the change in the estimated gradients between each iteration. By combining proportional and finite-difference samples, we continuously reduce the variance of our novel gradient meta-estimators throughout the optimisation process. We investigate how our estimator interlinks with Adam and derive a stable combination. We implement our method for inverse path tracing and demonstrate how our estimator speeds up convergence on difficult optimisation tasks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 43 references that are in the map. First posted on arXiv 27 Sep 2023.
Builds on
7 of 43 references.
References · 7
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2013Generating Sequences With Recurrent Neural Networkscited by 554
- 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 402
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 320
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
- 2020Variance-Reduced Methods for Machine Learningcited by 79
- 2017Accelerating Stochastic Gradient Descent For Least Squares Regressioncited by 13
Built on by
Not cited yet.