Search arXivSearch

arXiv · 1801.03592

Estimation of the Robin coefficient field in a Poisson problem with uncertain conductivity field

Abstract

We consider the reconstruction of a heterogeneous coefficient field in a Robin boundary condition on an inaccessible part of the boundary in a Poisson problem with an uncertain (or unknown) inhomogeneous conductivity field in the interior of the domain. To account for model errors that stem from the uncertainty in the conductivity coefficient, we treat the unknown conductivity as a nuisance parameter and carry out approximative premarginalization over it, and invert for the Robin coefficient field only. We approximate the related modelling errors via the Bayesian approximation error (BAE) approach. The uncertainty analysis presented here relies on a local linearization of the parameter-to-observable map at the maximum a posteriori (MAP) estimates, which leads to a normal (Gaussian) approximation of the parameter posterior density. To compute the MAP point we apply an inexact Newton conjugate gradient approach based on the adjoint methodology. The construction of the covariance is made tractable by invoking a low-rank approximation of the data misfit component of the Hessian. Two numerical experiments are considered: one where the prior covariance on the conductivity is isotropic, and one where the prior covariance on the conductivity is anisotropic. Results are compared to those based on standard error models, with particular emphasis on the feasibility of the posterior uncertainty estimates. We show that the BAE approach is a feasible one in the sense that the predicted posterior uncertainty is consistent with the actual estimation errors, while neglecting the related modelling error yields infeasible estimates for the Robin coefficient. In addition, we demonstrate that the BAE approach is approximately as computationally expensive (measured in the number of PDE solves) as the conventional error approach.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruanui Nicholson, Noemi Petra, Jari Kaipio. 2018-01-11. Estimation of the Robin coefficient field in a Poisson problem with uncertain conductivity field. https://doi.org/10.1088/1361-6420%2Faad91e

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC