Table of Contents
Fetching ...

Hyper-differential sensitivity analysis with respect to model discrepancy: Posterior Optimal Solution Sampling

Joseph Hart, Bart van Bloemen Waanders

TL;DR

The paper develops a Bayesian extension of hyper-differential sensitivity analysis to quantify and propagate uncertainty when updating a low-fidelity optimization with limited high-fidelity evaluations. By modeling the model discrepancy δ(z, θ) in an affine, Kronecker-structured form and using a Gaussian prior and likelihood, the authors derive closed-form expressions for posterior samples of the discrepancy and the updated optimal solution, enabling efficient computation even for high-dimensional problems. A Hessian-projection step focuses inference on directions with the greatest impact on the objective, improving robustness and reducing computational cost. The approach is demonstrated on three numerical examples (diffusion–reaction, mass–spring, and advection–diffusion) showing significant improvements over the low-fidelity solution with only a handful of high-fidelity evaluations. This framework offers a principled, scalable method to fuse low-fidelity models, high-fidelity data, and optimization objectives in PDE-constrained settings, with broad implications for design and control under uncertainty.

Abstract

Optimization constrained by high-fidelity computational models has potential for transformative impact. However, such optimization is frequently unattainable in practice due to the complexity and computational intensity of the model. An alternative is to optimize a low-fidelity model and use limited evaluations of the high-fidelity model to assess the quality of the solution. This article develops a framework to use limited high-fidelity simulations to update the optimization solution computed using the low-fidelity model. Building off a previous article [22], which introduced hyper-differential sensitivity analysis with respect to model discrepancy, this article provides novel extensions of the algorithm to enable uncertainty quantification of the optimal solution update via a Bayesian framework. Specifically, we formulate a Bayesian inverse problem to estimate the model discrepancy and propagate the posterior model discrepancy distribution through the post-optimality sensitivity operator for the low-fidelity optimization problem. We provide a rigorous treatment of the Bayesian formulation, a computationally efficient algorithm to compute posterior samples, a guide to specify and interpret the algorithm hyper-parameters, and a demonstration of the approach on three examples which highlight various types of discrepancy between low and high-fidelity models.

Hyper-differential sensitivity analysis with respect to model discrepancy: Posterior Optimal Solution Sampling

TL;DR

The paper develops a Bayesian extension of hyper-differential sensitivity analysis to quantify and propagate uncertainty when updating a low-fidelity optimization with limited high-fidelity evaluations. By modeling the model discrepancy δ(z, θ) in an affine, Kronecker-structured form and using a Gaussian prior and likelihood, the authors derive closed-form expressions for posterior samples of the discrepancy and the updated optimal solution, enabling efficient computation even for high-dimensional problems. A Hessian-projection step focuses inference on directions with the greatest impact on the objective, improving robustness and reducing computational cost. The approach is demonstrated on three numerical examples (diffusion–reaction, mass–spring, and advection–diffusion) showing significant improvements over the low-fidelity solution with only a handful of high-fidelity evaluations. This framework offers a principled, scalable method to fuse low-fidelity models, high-fidelity data, and optimization objectives in PDE-constrained settings, with broad implications for design and control under uncertainty.

Abstract

Optimization constrained by high-fidelity computational models has potential for transformative impact. However, such optimization is frequently unattainable in practice due to the complexity and computational intensity of the model. An alternative is to optimize a low-fidelity model and use limited evaluations of the high-fidelity model to assess the quality of the solution. This article develops a framework to use limited high-fidelity simulations to update the optimization solution computed using the low-fidelity model. Building off a previous article [22], which introduced hyper-differential sensitivity analysis with respect to model discrepancy, this article provides novel extensions of the algorithm to enable uncertainty quantification of the optimal solution update via a Bayesian framework. Specifically, we formulate a Bayesian inverse problem to estimate the model discrepancy and propagate the posterior model discrepancy distribution through the post-optimality sensitivity operator for the low-fidelity optimization problem. We provide a rigorous treatment of the Bayesian formulation, a computationally efficient algorithm to compute posterior samples, a guide to specify and interpret the algorithm hyper-parameters, and a demonstration of the approach on three examples which highlight various types of discrepancy between low and high-fidelity models.
Paper Structure (18 sections, 4 theorems, 84 equations, 10 figures, 5 tables, 1 algorithm)

This paper contains 18 sections, 4 theorems, 84 equations, 10 figures, 5 tables, 1 algorithm.

Key Result

Theorem 4.1

The posterior mean for the model discrepancy parameters $\boldsymbol{\Theta}$ is where

Figures (10)

  • Figure 1: Low-fidelity optimization solution for the reaction diffusion example. Left: optimal source $\tilde{{\boldsymbol{z}}}$; right: state target $T$ alongside the low and high-fidelity state solutions evaluated at $\tilde{{\boldsymbol{z}}}$, i.e. $\tilde{S}(\tilde{{\boldsymbol{z}}})$ and $S(\tilde{{\boldsymbol{z}}})$, respectively.
  • Figure 2: Left: generalized eigenvalues \ref{['eqn:hess_gen_eig']} for the reaction diffusion example; right: the posterior optimal solution mean relative error (in the left axis) and posterior optimal solution variance (in right axis) for various subspace ranks.
  • Figure 3: Left: the low and high-fidelity optimal sources $\tilde{{\boldsymbol{z}}}$ and ${\boldsymbol{z}}^\star$, respectively, alongside the posterior optimal solution mean $\overline{{\boldsymbol{z}}}$ with posterior optimal solution samples (in grey); right: the high-fidelity objective function values for 500 optimal source posterior samples, the vertical lines from left to right indicates the value the high-fidelity objective $J(S({\boldsymbol{z}}),{\boldsymbol{z}})$ evaluated at the high-fidelity optimal source, the posterior optimal source mean, and the low-fidelity optimal source. The top and bottom rows correspond to a subspace projection ranks of 4 and 11, respectively.
  • Figure 4: Diagram depicting the mass-spring system. We consider the coupled system for both blocks 1 and 2 as the high-fidelity model. A low-fidelity model is derived by assuming that block 2 is stationary.
  • Figure 5: Low-fidelity optimization solution for the mass-spring system. Left: low-fidelity optimal forcing $\tilde{{\boldsymbol{z}}}$; right: state trajectory $T$ alongside the low and high-fidelity block 1 displacement solutions evaluated at $\tilde{{\boldsymbol{z}}}$, i.e. $\tilde{S}(\tilde{{\boldsymbol{z}}})$ and $S(\tilde{{\boldsymbol{z}}})$, respectively.
  • ...and 5 more figures

Theorems & Definitions (4)

  • Theorem 4.1
  • Theorem 4.2
  • Theorem 4.3
  • Theorem 4.4