Uncertainty quantification for goal-oriented inverse problems via variational encoder-decoder networks

IF 2 2区 数学 Q1 MATHEMATICS, APPLIED
B. Afkham, Julianne Chung, Matthias Chung
{"title":"Uncertainty quantification for goal-oriented inverse problems via variational encoder-decoder networks","authors":"B. Afkham, Julianne Chung, Matthias Chung","doi":"10.1088/1361-6420/ad5373","DOIUrl":null,"url":null,"abstract":"\n In this work, we describe a new approach that uses variational encoder-decoder (VED) networks for efficient uncertainty quantification for goal-oriented inverse problems. Contrary to standard inverse problems, these approaches are goal-oriented in that the goal is to estimate some quantities of interest (QoI) that are functions of the solution of an inverse problem, rather than the solution itself. Moreover, we are interested in computing uncertainty metrics associated with the QoI, thus utilizing a Bayesian approach for inverse problems that incorporates the prediction operator and techniques for exploring the posterior. This may be particularly challenging, especially for nonlinear, possibly unknown, operators and nonstandard prior assumptions. We harness recent advances in machine learning, i.e., VED networks, to describe a data-driven approach to large-scale inverse problems. This enables a real-time uncertainty quantification for the QoI. One of the advantages of our approach is that we avoid the need to solve challenging inversion problems by training a network to approximate the mapping from observations to QoI. Another main benefit is that we enable uncertainty quantification for the QoI by leveraging probability distributions in the latent and target spaces. This allows us to efficiently generate QoI samples and circumvent complicated or even unknown forward models and prediction operators. Numerical results from medical tomography reconstruction and nonlinear hydraulic tomography demonstrate the potential and broad applicability of the approach.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":null,"pages":null},"PeriodicalIF":2.0000,"publicationDate":"2024-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Inverse Problems","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1088/1361-6420/ad5373","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

In this work, we describe a new approach that uses variational encoder-decoder (VED) networks for efficient uncertainty quantification for goal-oriented inverse problems. Contrary to standard inverse problems, these approaches are goal-oriented in that the goal is to estimate some quantities of interest (QoI) that are functions of the solution of an inverse problem, rather than the solution itself. Moreover, we are interested in computing uncertainty metrics associated with the QoI, thus utilizing a Bayesian approach for inverse problems that incorporates the prediction operator and techniques for exploring the posterior. This may be particularly challenging, especially for nonlinear, possibly unknown, operators and nonstandard prior assumptions. We harness recent advances in machine learning, i.e., VED networks, to describe a data-driven approach to large-scale inverse problems. This enables a real-time uncertainty quantification for the QoI. One of the advantages of our approach is that we avoid the need to solve challenging inversion problems by training a network to approximate the mapping from observations to QoI. Another main benefit is that we enable uncertainty quantification for the QoI by leveraging probability distributions in the latent and target spaces. This allows us to efficiently generate QoI samples and circumvent complicated or even unknown forward models and prediction operators. Numerical results from medical tomography reconstruction and nonlinear hydraulic tomography demonstrate the potential and broad applicability of the approach.
通过变分编码器-解码器网络实现面向目标的逆问题的不确定性量化
在这项工作中,我们介绍了一种新方法,该方法利用变分编码器-解码器(VED)网络对面向目标的逆问题进行高效的不确定性量化。与标准逆问题不同,这些方法以目标为导向,其目标是估计作为逆问题解的函数的一些相关量(QoI),而不是解本身。此外,我们还对计算与 QoI 相关的不确定性度量感兴趣,因此利用贝叶斯方法解决逆问题,该方法结合了预测算子和探索后验的技术。这可能特别具有挑战性,尤其是对于非线性、可能未知的算子和非标准先验假设。我们利用机器学习(即 VED 网络)的最新进展,描述了大规模逆问题的数据驱动方法。这样就能对 QoI 进行实时不确定性量化。我们的方法的优势之一是,我们无需通过训练网络来近似从观测到 QoI 的映射,从而解决具有挑战性的反演问题。另一个主要优点是,我们利用潜空间和目标空间的概率分布,实现了 QoI 的不确定性量化。这使我们能够高效地生成 QoI 样本,避开复杂甚至未知的前向模型和预测算子。医学层析成像重建和非线性水力层析成像的数值结果证明了这种方法的潜力和广泛适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Inverse Problems
Inverse Problems 数学-物理:数学物理
CiteScore
4.40
自引率
14.30%
发文量
115
审稿时长
2.3 months
期刊介绍: An interdisciplinary journal combining mathematical and experimental papers on inverse problems with theoretical, numerical and practical approaches to their solution. As well as applied mathematicians, physical scientists and engineers, the readership includes those working in geophysics, radar, optics, biology, acoustics, communication theory, signal processing and imaging, among others. The emphasis is on publishing original contributions to methods of solving mathematical, physical and applied problems. To be publishable in this journal, papers must meet the highest standards of scientific quality, contain significant and original new science and should present substantial advancement in the field. Due to the broad scope of the journal, we require that authors provide sufficient introductory material to appeal to the wide readership and that articles which are not explicitly applied include a discussion of possible applications.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信