Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2403.03444

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2403.03444 (cs)
[Submitted on 6 Mar 2024 ]

Title: Uncertainty quantification for deeponets with ensemble kalman inversion

Title: 深度网络的不确定性量化与集合卡尔曼反演

Authors:Andrew Pensoneault, Xueyu Zhu
Abstract: In recent years, operator learning, particularly the DeepONet, has received much attention for efficiently learning complex mappings between input and output functions across diverse fields. However, in practical scenarios with limited and noisy data, accessing the uncertainty in DeepONet predictions becomes essential, especially in mission-critical or safety-critical applications. Existing methods, either computationally intensive or yielding unsatisfactory uncertainty quantification, leave room for developing efficient and informative uncertainty quantification (UQ) techniques tailored for DeepONets. In this work, we proposed a novel inference approach for efficient UQ for operator learning by harnessing the power of the Ensemble Kalman Inversion (EKI) approach. EKI, known for its derivative-free, noise-robust, and highly parallelizable feature, has demonstrated its advantages for UQ for physics-informed neural networks [28]. Our innovative application of EKI enables us to efficiently train ensembles of DeepONets while obtaining informative uncertainty estimates for the output of interest. We deploy a mini-batch variant of EKI to accommodate larger datasets, mitigating the computational demand due to large datasets during the training stage. Furthermore, we introduce a heuristic method to estimate the artificial dynamics covariance, thereby improving our uncertainty estimates. Finally, we demonstrate the effectiveness and versatility of our proposed methodology across various benchmark problems, showcasing its potential to address the pressing challenges of uncertainty quantification in DeepONets, especially for practical applications with limited and noisy data.
Abstract: 近年来,算子学习,特别是DeepONet,在高效学习输入和输出函数之间的复杂映射方面引起了广泛关注,尤其是在多个领域中。然而,在有限和噪声数据的实际场景中,获取DeepONet预测的不确定性变得至关重要,特别是在任务关键或安全关键的应用中。现有的方法,要么计算密集,要么产生不令人满意的不确定性量化,因此需要开发针对DeepONets的高效且信息丰富的不确定性量化(UQ)技术。在本工作中,我们提出了一种新颖的推理方法,通过利用集成卡尔曼反演(EKI)方法的力量,实现了算子学习的高效UQ。EKI以其无需导数、抗噪声和高度并行化的特性而闻名,已在物理信息神经网络的UQ中展示了其优势[28]。我们创新地应用EKI,使我们能够高效地训练DeepONet的集合,同时获得感兴趣输出的信息性不确定性估计。我们部署了EKI的小批量变体以适应更大的数据集,从而减轻训练阶段由于大数据集带来的计算需求。此外,我们引入了一种启发式方法来估计人工动态协方差,从而改进我们的不确定性估计。最后,我们在各种基准问题上展示了所提出方法的有效性和通用性,展示了其在解决DeepONets中不确定性量化紧迫挑战方面的潜力,特别是在有限和噪声数据的实际应用中。
Comments: 25 pages
Subjects: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Numerical Analysis (math.NA); Machine Learning (stat.ML)
MSC classes: 65
Cite as: arXiv:2403.03444 [cs.LG]
  (or arXiv:2403.03444v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2403.03444
arXiv-issued DOI via DataCite

Submission history

From: Xueyu Zhu [view email]
[v1] Wed, 6 Mar 2024 04:02:30 UTC (38,527 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2024-03
Change to browse by:
cs
cs.AI
cs.NA
math
math.NA
stat
stat.ML

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号