Skip to main content

Amortized Finite Element Analysis for Fast PDE-Constrained Optimization

Author(s): Xue, Tianju; Beatson, Alex; Adriaenssens, Sigrid; Adams, Ryan

To refer to this page use:
Abstract: Optimizing the parameters of partial differential equations (PDEs), i.e., PDE-constrained optimization (PDE-CO), allows us to model natural systems from observations or perform rational design of structures with complicated mechanical, thermal, or electromagnetic properties. However, PDE-CO is often computationally prohibitive due to the need to solve the PDE—typically via finite element analysis (FEA)—at each step of the optimization procedure. In this paper we propose amortized finite element analysis (AmorFEA), in which a neural network learns to produce accurate PDE solutions, while preserving many of the advantages of traditional finite element methods. This network is trained to directly minimize the potential energy from which the PDE and finite element method are derived, avoiding the need to generate costly supervised training data by solving PDEs with traditional FEA. As FEA is a variational procedure, AmorFEA is a direct analogue to popular amortized inference approaches in latent variable models, with the finite element basis acting as the variational family. AmorFEA can perform PDE-CO without the need to repeatedly solve the associated PDE, accelerating optimization when compared to a traditional workflow using FEA and the adjoint method.
Publication Date: 2020
Citation: Xue, Tianju, Alex Beatson, Sigrid Adriaenssens, and Ryan Adams. "Amortized finite element analysis for fast PDE-constrained optimization." In Proceedings of the 37th International Conference on Machine Learning (2020): pp. 10638-10647.
Pages: 10638 - 10647
Type of Material: Conference Article
Journal/Proceeding Title: Proceedings of the 37th International Conference on Machine Learning
Version: Final published version. Article is made available in OAR by the publisher's permission or policy.

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.