Table of Contents
Fetching ...

Solving Inverse Parametrized Problems via Finite Elements and Extreme Learning Networks

Erik Burman, Mats G. Larson, Karl Larsson, Jonatan Vallin

TL;DR

This work develops a reduction framework for parameterized PDEs that marries finite element discretization in the physical domain with a parameter-domain surrogate strategy. By proving existence, uniqueness, and regularity of the parametric solution and deriving joint error bounds, the approach separates spatial discretization from parameter approximation and adapts to both low- and high-dimensional parameter spaces. In the low-dimensional regime it leverages classical interpolation with algebraic convergence, while in the high-dimensional regime it adopts Extreme Learning Machines with Barron-space-based error controls, yielding dimension-independent rates under explicit assumptions. The framework is applied to inverse problems in quantitative photoacoustic tomography (QPAT), where potential and parameter reconstructions are bounded and validated with numerical experiments, demonstrating substantial computational savings over conventional methods without sacrificing accuracy. Its unified ROM structure supports fast optimization, uncertainty quantification, and multi-query tasks across diverse parameter regimes.

Abstract

We develop an interpolation-based reduced-order modeling framework for parameter-dependent partial differential equations arising in control, inverse problems, and uncertainty quantification. The solution is discretized in the physical domain using finite element methods, while the dependence on a finite-dimensional parameter is approximated separately. We establish existence, uniqueness, and regularity of the parametric solution and derive rigorous error estimates that explicitly quantify the interplay between spatial discretization and parameter approximation. In low-dimensional parameter spaces, classical interpolation schemes yield algebraic convergence rates based on Sobolev regularity in the parameter variable. In higher-dimensional parameter spaces, we replace classical interpolation by extreme learning machine (ELM) surrogates and obtain error bounds under explicit approximation and stability assumptions. The proposed framework is applied to inverse problems in quantitative photoacoustic tomography, where we derive potential and parameter reconstruction error estimates and demonstrate substantial computational savings compared to standard approaches, without sacrificing accuracy.

Solving Inverse Parametrized Problems via Finite Elements and Extreme Learning Networks

TL;DR

This work develops a reduction framework for parameterized PDEs that marries finite element discretization in the physical domain with a parameter-domain surrogate strategy. By proving existence, uniqueness, and regularity of the parametric solution and deriving joint error bounds, the approach separates spatial discretization from parameter approximation and adapts to both low- and high-dimensional parameter spaces. In the low-dimensional regime it leverages classical interpolation with algebraic convergence, while in the high-dimensional regime it adopts Extreme Learning Machines with Barron-space-based error controls, yielding dimension-independent rates under explicit assumptions. The framework is applied to inverse problems in quantitative photoacoustic tomography (QPAT), where potential and parameter reconstructions are bounded and validated with numerical experiments, demonstrating substantial computational savings over conventional methods without sacrificing accuracy. Its unified ROM structure supports fast optimization, uncertainty quantification, and multi-query tasks across diverse parameter regimes.

Abstract

We develop an interpolation-based reduced-order modeling framework for parameter-dependent partial differential equations arising in control, inverse problems, and uncertainty quantification. The solution is discretized in the physical domain using finite element methods, while the dependence on a finite-dimensional parameter is approximated separately. We establish existence, uniqueness, and regularity of the parametric solution and derive rigorous error estimates that explicitly quantify the interplay between spatial discretization and parameter approximation. In low-dimensional parameter spaces, classical interpolation schemes yield algebraic convergence rates based on Sobolev regularity in the parameter variable. In higher-dimensional parameter spaces, we replace classical interpolation by extreme learning machine (ELM) surrogates and obtain error bounds under explicit approximation and stability assumptions. The proposed framework is applied to inverse problems in quantitative photoacoustic tomography, where we derive potential and parameter reconstruction error estimates and demonstrate substantial computational savings compared to standard approaches, without sacrificing accuracy.
Paper Structure (32 sections, 156 equations, 14 figures, 6 tables)

This paper contains 32 sections, 156 equations, 14 figures, 6 tables.

Figures (14)

  • Figure 1: Domains.(a) The spatial domain $\Omega_x$ is a bounded subset in $\IR^d$ for $d\in \{2,3\}$. (b) The parameter domain $\Omega_t$ is the hypercube $[0,1]^{N_t}$ where $N_t$ may be large.
  • Figure 2: Spatial domain discretization. The spatial domain $\Omega_x$ is discretized using a finite element mesh $\mathcal{T}_{h_x}$ of mesh size $h_x$.
  • Figure 3: Low-dimensional interpolation in $\Omega_t$. For $N_t\leq 4$, the parameter domain can be partitioned into simplices with interpolation points at the vertices. This partition constitutes a mesh $\mathcal{T}_{h_t}$ of the parameter domain with mesh size $h_t$ on which we may employ standard piecewise-linear interpolation.
  • Figure 4: High-dimensional interpolation in $\Omega_t$. For $N_t>4$, an ELM surrogate is used for interpolation. (a)$J$ quasi-random (Sobol') points in $\Omega_t$ are used as interpolation points. (b) Random ReLU feature hyperplanes for the ELM surrogate in $\Omega_t$; each hyperplane marks where one unit switches between active and inactive regions.
  • Figure 5: Convergence in low-dimensional setting.(a) The heatmap shows approximation error for different values of the pair $(h_t,h_x)$. (b) The figure shows the approximation error as a function of $h_x$ for different choices of $h_t$.
  • ...and 9 more figures

Theorems & Definitions (10)

  • proof
  • proof
  • proof
  • proof
  • proof
  • definition 1: Barron Space
  • proof
  • proof
  • proof
  • proof