An official website of the United States government
Recent developments in the computational automated design of electromagnetic devices, otherwise known as inverse design, have significantly enhanced the design process for nanophotonic systems. Inverse design can both reduce design time considerably and lead to high-performance, nonintuitive structures that would otherwise have been impossible to develop manually. Despite the successes enjoyed by structure optimization techniques, most approaches leverage electromagnetic solvers that require significant computational resources and suffer from slow convergence and numerical dispersion. Recently, a fast simulation and boundary-based inverse design approach based on boundary integral equations was demonstrated for two-dimensional nanophotonic problems. In this work, we introduce a new full-wave three-dimensional simulation and boundary-based optimization framework for nanophotonic devices also based on boundary integral methods, which achieves high accuracy even at coarse mesh discretizations while only requiring modest computational resources. The approach has been further accelerated by leveraging GPU computing, a sparse block-diagonal preconditioning strategy, and a matrix-free implementation of the discrete adjoint method. As a demonstration, we optimize three different devices: a 1:2 1550 nm power splitter and two nonadiabatic mode-preserving waveguide tapers. To the best of our knowledge, the tapers, which span 40 wavelengths in the silicon material, are the largest silicon photonic waveguiding devices to have been optimized using full-wave 3D solution of Maxwell’s equations.
more »
« less
Hybrid supervised and reinforcement learning for the design and optimization of nanophotonic structures
From higher computational efficiency to enabling the discovery of novel and complex structures, deep learning has emerged as a powerful framework for the design and optimization of nanophotonic circuits and components. However, both data-driven and exploration-based machine learning strategies have limitations in their effectiveness for nanophotonic inverse design. Supervised machine learning approaches require large quantities of training data to produce high-performance models and have difficulty generalizing beyond training data given the complexity of the design space. Unsupervised and reinforcement learning-based approaches on the other hand can have very lengthy training or optimization times associated with them. Here we demonstrate a hybrid supervised learning and reinforcement learning approach to the inverse design of nanophotonic structures and show this approach can reduce training data dependence, improve the generalizability of model predictions, and significantly shorten exploratory training times. The presented strategy thus addresses several contemporary deep learning-based challenges, while opening the door for new design methodologies that leverage multiple classes of machine learning algorithms to produce more effective and practical solutions for photonic design.
more »
« less
- Award ID(s):
- 2146577
- PAR ID:
- 10494165
- Publisher / Repository:
- Optical Society of America
- Date Published:
- Journal Name:
- Optics Express
- Volume:
- 32
- Issue:
- 6
- ISSN:
- 1094-4087; OPEXFF
- Format(s):
- Medium: X Size: Article No. 9920
- Size(s):
- Article No. 9920
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Designing functional materials requires a deep search through multidimensional spaces for system parameters that yield desirable material properties. For cases where conventional parameter sweeps or trial-and-error sampling are impractical, inverse methods that frame design as a constrained optimization problem present an attractive alternative. However, even efficient algorithms require time- and resource-intensive characterization of material properties many times during optimization, imposing a design bottleneck. Approaches that incorporate machine learning can help address this limitation and accelerate the discovery of materials with targeted properties. In this article, we review how to leverage machine learning to reduce dimensionality in order to effectively explore design space, accelerate property evaluation, and generate unconventional material structures with optimal properties. We also discuss promising future directions, including integration of machine learning into multiple stages of a design algorithm and interpretation of machine learning models to understand how design parameters relate to material properties.more » « less
-
null (Ed.)Abstract Automated inverse design methods are critical to the development of metamaterial systems that exhibit special user-demanded properties. While machine learning approaches represent an emerging paradigm in the design of metamaterial structures, the ability to retrieve inverse designs on-demand remains lacking. Such an ability can be useful in accelerating optimization-based inverse design processes. This paper develops an inverse design framework that provides this capability through the novel usage of invertible neural networks (INNs). We exploit an INN architecture that can be trained to perform forward prediction over a set of high-fidelity samples and automatically learns the reverse mapping with guaranteed invertibility. We apply this INN for modeling the frequency response of periodic and aperiodic phononic structures, with the performance demonstrated on vibration suppression of drill pipes. Training and testing samples are generated by employing a transfer matrix method. The INN models provide competitive forward and inverse prediction performance compared to typical deep neural networks (DNNs). These INN models are used to retrieve approximate inverse designs for a queried non-resonant frequency range; the inverse designs are then used to initialize a constrained gradient-based optimization process to find a more accurate inverse design that also minimizes mass. The INN-initialized optimizations are found to be generally superior in terms of the queried property and mass compared to randomly initialized and inverse DNN-initialized optimizations. Particle swarm optimization with INN-derived initial points is then found to provide even better solutions, especially for the higher-dimensional aperiodic structures.more » « less
-
Tasks across diverse application domains can be posed as large-scale optimization problems, these include graphics, vision, machine learning, imaging, health, scheduling, planning, and energy system forecasting. Independently of the application domain, proximal algorithms have emerged as a formal optimization method that successfully solves a wide array of existing problems, often exploiting problem-specific structures in the optimization. Although model-based formal optimization provides a principled approach to problem modeling with convergence guarantees, at first glance, this seems to be at odds with black-box deep learning methods. A recent line of work shows that, when combined with learning-based ingredients, model-based optimization methods are effective, interpretable, and allow for generalization to a wide spectrum of applications with little or no extra training data. However, experimenting with such hybrid approaches for different tasks by hand requires domain expertise in both proximal optimization and deep learning, which is often error-prone and time-consuming. Moreover, naively unrolling these iterative methods produces lengthy compute graphs, which when differentiated via autograd techniques results in exploding memory consumption, making batch-based training challenging. In this work, we introduce ∇-Prox, a domain-specific modeling language and compiler for large-scale optimization problems using differentiable proximal algorithms. ∇-Prox allows users to specify optimization objective functions of unknowns concisely at a high level, and intelligently compiles the problem into compute and memory-efficient differentiable solvers. One of the core features of ∇-Prox is its full differentiability, which supports hybrid model- and learning-based solvers integrating proximal optimization with neural network pipelines. Example applications of this methodology include learning-based priors and/or sample-dependent inner-loop optimization schedulers, learned with deep equilibrium learning or deep reinforcement learning. With a few lines of code, we show ∇-Prox can generate performant solvers for a range of image optimization problems, including end-to-end computational optics, image deraining, and compressive magnetic resonance imaging. We also demonstrate ∇-Prox can be used in a completely orthogonal application domain of energy system planning, an essential task in the energy crisis and the clean energy transition, where it outperforms state-of-the-art CVXPY and commercial Gurobi solvers.more » « less
-
Abstract This work presents a deep reinforcement learning (DRL) approach for procedural content generation (PCG) to automatically generate three-dimensional (3D) virtual environments that users can interact with. The primary objective of PCG methods is to algorithmically generate new content in order to improve user experience. Researchers have started exploring the use of machine learning (ML) methods to generate content. However, these approaches frequently implement supervised ML algorithms that require initial datasets to train their generative models. In contrast, RL algorithms do not require training data to be collected a priori since they take advantage of simulation to train their models. Considering the advantages of RL algorithms, this work presents a method that generates new 3D virtual environments by training an RL agent using a 3D simulation platform. This work extends the authors’ previous work and presents the results of a case study that supports the capability of the proposed method to generate new 3D virtual environments. The ability to automatically generate new content has the potential to maintain users’ engagement in a wide variety of applications such as virtual reality applications for education and training, and engineering conceptual design.more » « less
