Differential Walk on Spheres

被引:0
|
作者
Miller, Bailey [1 ]
Sawhney, Rohan [2 ]
Crane, Keenan [1 ]
Gkioulekas, Ioannis [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
[2] NVIDIA, Santa Clara, CA USA
来源
ACM TRANSACTIONS ON GRAPHICS | 2024年 / 43卷 / 06期
关键词
Walk on spheres; differentiable simula- tion; shape optimization; INFORMED NEURAL-NETWORKS; TOPOLOGY OPTIMIZATION; SHAPE OPTIMIZATION; INVERSE PROBLEMS; REPRESENTATION; IMPLICIT; DESIGN;
D O I
10.1145/3687913
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We introduce a Monte Carlo method for computing derivatives of the solution to a partial differential equation (PDE) with respect to problem parameters (such as domain geometry or boundary conditions). Derivatives can be evaluated at arbitrary points, without performing a global solve or constructing a volumetric grid or mesh. The method is hence well suited to inverse problems with complex geometry, such as PDE-constrained shape optimization. Like other walk on spheres (WoS) algorithms, our method is trivial to parallelize, and is agnostic to boundary representation (meshes, splines, implicit surfaces, etc.), supporting large topological changes. We focus in particular on screened Poisson equations, which model diverse problems from scientific and geometric computing. As in differentiable rendering, we jointly estimate derivatives with respect to all parameters-hence, cost does not grow significantly with parameter count. In practice, even noisy derivative estimates exhibit fast, stable convergence for stochastic gradient-based optimization, as we show through examples from thermal design, shape from diffusion, and computer graphics.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] RANDOM-WALK ON SPHERES
    BINGHAM, NH
    ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1972, 22 (03): : 169 - &
  • [2] A bidirectional formulation for Walk on Spheres
    Qi, Yang
    Seyb, Dario
    Bitterli, Benedikt
    Jarosz, Wojciech
    COMPUTER GRAPHICS FORUM, 2022, 41 (04) : 51 - 62
  • [3] The rate of convergence of the Walk on Spheres Algorithm
    Ilia Binder
    Mark Braverman
    Geometric and Functional Analysis, 2012, 22 : 558 - 587
  • [4] Boundary Value Caching for Walk on Spheres
    Miller, Bailey
    Sawhney, Rohan
    Crane, Keenan
    Gkioulekas, Ioannis
    ACM TRANSACTIONS ON GRAPHICS, 2023, 42 (04):
  • [5] Elastic spheres can walk on water
    Jesse Belden
    Randy C. Hurd
    Michael A. Jandron
    Allan F. Bower
    Tadd T. Truscott
    Nature Communications, 7
  • [6] The rate of convergence of the Walk on Spheres Algorithm
    Binder, Ilia
    Braverman, Mark
    GEOMETRIC AND FUNCTIONAL ANALYSIS, 2012, 22 (03) : 558 - 587
  • [7] Elastic spheres can walk on water
    Belden, Jesse
    Hurd, Randy C.
    Jandron, Michael A.
    Bower, Allan F.
    Truscott, Tadd T.
    NATURE COMMUNICATIONS, 2016, 7
  • [8] Acceleration and Parallelization of ZENO/Walk-on-Spheres
    Juba, Derek
    Keyrouz, Walid
    Mascagni, Michael
    Brady, Mary
    INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE 2016 (ICCS 2016), 2016, 80 : 269 - 278
  • [9] ε-shell error analysis for "Walk On Spheres" algorithms
    Mascagni, M
    Hwang, CO
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2003, 63 (02) : 93 - 104
  • [10] Erratum: Elastic spheres can walk on water
    Jesse Belden
    Randy C. Hurd
    Michael A. Jandron
    Allan F. Bower
    Tadd T. Truscott
    Nature Communications, 7