Certified and accurate computation of function space norms of deep neural networks
Johannes Gr\"undler, Moritz Maibaum, Philipp Petersen

TL;DR
This paper develops a framework for certified, reliable computation of function space norms of neural networks, crucial for PDEs, by combining interval arithmetic, adaptive refinement, and quadrature methods.
Contribution
It introduces a novel approach that exploits neural network structure to compute guaranteed bounds on function space norms, surpassing point evaluation limitations.
Findings
Provides guaranteed bounds for Lebesgue and Sobolev norms of neural networks.
Establishes a convergence theorem for certified adaptive quadrature procedures.
Demonstrates practical certified bounds for PINN residuals through numerical experiments.
Abstract
Neural network methods for PDEs require reliable error control in function space norms. However, trained neural networks can typically only be probed at a finite number of point values. Without strong assumptions, point evaluations alone do not provide enough information to derive tight deterministic and guaranteed bounds on function space norms. In this work, we move beyond a purely black-box setting and exploit the neural network structure directly. We present a framework for the certified and accurate computation of integral quantities of neural networks, including Lebesgue and Sobolev norms, by combining interval arithmetic enclosures on axis-aligned boxes with adaptive marking/refinement and quadrature-based aggregation. On each box, we compute guaranteed lower and upper bounds for function values and derivatives, and propagate these local certificates to global lower and upper…
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.
