Issue |
ESAIM: COCV
Volume 30, 2024
|
|
---|---|---|
Article Number | 16 | |
Number of page(s) | 53 | |
DOI | https://doi.org/10.1051/cocv/2023091 | |
Published online | 08 March 2024 |
On the identification and optimization of nonsmooth superposition operators in semilinear elliptic PDEs
Technische Universität München, Chair of Optimal Control, School of Computation, Information and Technology, Department of Mathematics,
Boltzmannstraße 3,
85748
Garching,
Germany
* Corresponding author: christof@cit.tum.de
Received:
8
June
2023
Accepted:
13
December
2023
We study an infinite-dimensional optimization problem that aims to identify the Nemytskii operator in the nonlinear part of a prototypical semilinear elliptic partial differential equation (PDE) which minimizes the distance between the PDE-solution and a given desired state. In contrast to previous works, we consider this identification problem in a low-regularity regime in which the function inducing the Nemytskii operator is a-priori only known to be an element of H1loc(ℝ). This makes the studied problem class a suitable point of departure for the rigorous analysis of training problems for learning-informed PDEs in which an unknown superposition operator is approximated by means of a neural network with nonsmooth activation functions (ReLU, leaky-ReLU, etc.). We establish that, despite the low regularity of the controls, it is possible to derive a classical stationarity system for local minimizers and to solve the considered problem by means of a gradient projection method. The convergence of the resulting algorithm is proven in the function space setting. It is also shown that the established first-order necessary optimality conditions imply that locally optimal superposition operators share various characteristic properties with commonly used activation functions: They are always sigmoidal, continuously differentiable away from the origin, and typically possess a distinct kink at zero. The paper concludes with numerical experiments which confirm the theoretical findings.
Mathematics Subject Classification: 35J61 / 49J50 / 49J52 / 49K20 / 49M05 / 68T07
Key words: Optimal control / superposition / Nemytskii operator / semilinear elliptic partial differential equation / data-driven models / learning-informed PDEs / inverse problems / Bouligand stationarity / Gâteaux differentiability / gradient projection method / artificial neural network / optimality condition / nonsmooth optimization / machine learning
© The authors. Published by EDP Sciences, SMAI 2024
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.