mlsanityData to 7 Oct 2026

Neural-network methods for two-dimensional finite-source reflector design

arXiv 2604.02184 ↗First posted 2 Apr 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We address the inverse problem of designing two-dimensional reflectors that transform light from a finite, extended source into a prescribed far-field distribution. The reflector height is represented by a neural network and optimized with two objective functions: a direct change-of-variables loss based on the closed-form inverse ray map, and a mesh-based loss that maps target cells back to the source and remains usable for discontinuous sources. Gradients are computed by automatic differentiation and minimized with a robust quasi-Newton method. As a baseline, we adapt a deconvolution pipeline built on a simplified finite-source approximation: a one-dimensional monotone map is recovered from flux balance, converted to a reflector by an integrating-factor ODE solve, and embedded in a modified Van Cittert iteration with nonnegativity clipping and ray-traced feedback. Across four benchmarks, covering continuous and discontinuous sources and minimum-height constraints, accuracy is measured by ray-traced normalized mean absolute error. On the two main benchmarks, the neural method reaches errors of about 2e-5 and 5e-5 within a few seconds on one NVIDIA RTX 4090 GPU, compared with 4e-3 and 5e-2 for the deconvolution baseline after several hundred seconds. The results show that the neural formulation is both more accurate and substantially faster, while still supporting practical height constraints. We also discuss extensions to rotationally symmetric and full three-dimensional reflector design through iterative correction schemes.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 2 of its 10 references that are in the map. First posted on arXiv 2 Apr 2026.

Builds on

2 of 10 references.

References · 2

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2015A Linearly-Convergent Stochastic L-BFGS Algorithmcited by 39

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.