AI & ML
Multifidelity Operator Inference for Non-intrusive Model Reduction under Data Scarcity
arXiv cs.NA0 views
arXiv:2611.13624v1 Announce Type: cross Abstract: Many-query analyses, in which a computational model is repeatedly evaluated, play an important role in uncertainty quantification and optimization for engineering design. However, many-query analyses can be prohibitively expensive when considering high-fidelity numerical models, especially those governed by partial differential equations (PDEs). Surrogate modeling replaces costly simulations with cheap approximations, enabling practical uncertainty quantification and design workflows. Machine learning (ML) approaches to surrogate modeling have gained significant traction in the development of surrogate models due to their non-intrusive nature; they do not require access to the underlying simulation code. The Operator Inference (OpInf) approach, in particular, fits reduced operators to state and corresponding time derivative data. However, high-fidelity training data is scarce due to limited computational budgets, and OpInf models trained on such scarce data often exhibit high variance, a critical liability in high-risk engineering design. We propose Multifidelity Operator Inference (MF-OpInf), which reduces this variance by supplementing scarce high-fidelity snapshots with abundant low-fidelity data drawn from coarser discretizations of the same problem. MF-OpInf handles data across varying fidelity levels by utilizing a multifidelity linear regression framework to estimate the reduced operators. Numerical experiments on model PDE problems demonstrate that MF-OpInf predicts PDE solution fields with higher accuracy compared to the high-fidelity-only OpInf with the same computational budget.
Source:https://arxiv.org/abs/2611.13624PreviousExact (Non-)Accelerations of Heavy-Ball DiscretizationsNextN -phase flow simulations using X-Mesh and an explicit marker interface representation
Related posts
SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
0arXiv cs.CR
Auditing Cross-Lingual Fairness in Language Model Watermarking
0arXiv cs.CR
Do Reasoning LLMs Refuse What They Infer in Long Contexts?
0arXiv cs.CR
Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
0arXiv cs.CR
RoCoMark: Robust Code Watermarking Against LLM-Based Functionality-Preserving Rewriting Attacks
0arXiv cs.CR
Design and Evaluation of Secure Distributed Chaotic Image Encryption on ESP32-S3
0arXiv cs.CR