Heuristic Methods and Performance Bounds for Photonic Design
Guillermo Angeris, Jelena Vu\v{c}kovi\'c, Stephen Boyd

TL;DR
This paper reviews heuristic methods for photonic design and discusses performance bounds that assess how close these designs are to the theoretical optimum, demonstrating that heuristic solutions are often nearly optimal.
Contribution
It unifies existing approaches for calculating performance bounds in photonic design and shows that heuristic methods often produce near-optimal solutions.
Findings
Heuristic methods often produce near-optimal designs.
Performance bounds indicate heuristic solutions are close to global optima.
The paper provides a unified framework for performance bounds in photonic design.
Abstract
In the photonic design problem, a scientist or engineer chooses the physical parameters of a device to best match some desired device behavior. Many instances of the photonic design problem can be naturally stated as a mathematical optimization problem that is computationally difficult to solve globally. Because of this, several heuristic methods have been developed to approximately solve such problems. These methods often produce very good designs, and, in many practical applications, easily outperform 'traditional' designs that rely on human intuition. Yet, because these heuristic methods do not guarantee that the approximate solution found is globally optimal, the question remains of just how much better a designer might hope to do. This question is addressed by performance bounds or impossibility results, which determine a performance level that no design can achieve. We focus on…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
