Data-efficient operator learning for solving high Mach number fluid flow problems

• URL: http://arxiv.org/abs/2311.16860v2
• Date: Mon, 4 Dec 2023 13:46:17 GMT
• Title: Data-efficient operator learning for solving high Mach number fluid flow problems
• Abstract summary: We consider the problem of using SciML to predict solutions of high Mach fluid flows over irregular geometries. We show that Neural Basis Functions (NBF), which learns a basis of behavior modes from the data, is more effective than a basis-unaware baseline model.
• Score: 43.148818844265236
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the problem of using SciML to predict solutions of high Mach fluid flows over irregular geometries. In this setting, data is limited, and so it is desirable for models to perform well in the low-data setting. We show that Neural Basis Functions (NBF), which learns a basis of behavior modes from the data and then uses this basis to make predictions, is more effective than a basis-unaware baseline model. In addition, we identify continuing challenges in the space of predicting solutions for this type of problem.

Related papers

• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• Towards Learning Stochastic Population Models by Gradient Descent [0.0]
  We show that simultaneous estimation of parameters and structure poses major challenges for optimization procedures. We demonstrate accurate estimation of models but find that enforcing the inference of parsimonious, interpretable models drastically increases the difficulty.
  arXiv  Detail & Related papers  (2024-04-10T14:38:58Z)
• Large-Scale OD Matrix Estimation with A Deep Learning Method [70.78575952309023]
  The proposed method integrates deep learning and numerical optimization algorithms to infer matrix structure and guide numerical optimization. We conducted tests to demonstrate the good generalization performance of our method on a large-scale synthetic dataset.
  arXiv  Detail & Related papers  (2023-10-09T14:30:06Z)
• Meta-Learning for Airflow Simulations with Graph Neural Networks [3.52359746858894]
  We present a meta-learning approach to enhance the performance of learned models on out-of-distribution (OoD) samples. Specifically, we set the airflow simulation in CFD over various airfoils as a meta-learning problem, where each set of examples defined on a single airfoil shape is treated as a separate task. We experimentally demonstrate the efficiency of the proposed approach for improving the OoD generalization performance of learned models.
  arXiv  Detail & Related papers  (2023-06-18T19:25:13Z)
• Physics-informed deep-learning applications to experimental fluid mechanics [2.992602379681373]
  High-resolution reconstruction of flow-field data from low-resolution and noisy measurements is of interest in experimental fluid mechanics. Deep-learning approaches have been shown suitable for such super-resolution tasks. In this study, we apply physics-informed neural networks (PINNs) for super-resolution of flow-field data in time and space.
  arXiv  Detail & Related papers  (2022-03-29T09:58:30Z)
• Extension of Dynamic Mode Decomposition for dynamic systems with incomplete information based on t-model of optimal prediction [69.81996031777717]
  The Dynamic Mode Decomposition has proved to be a very efficient technique to study dynamic data. The application of this approach becomes problematic if the available data is incomplete because some dimensions of smaller scale either missing or unmeasured. We consider a first-order approximation of the Mori-Zwanzig decomposition, state the corresponding optimization problem and solve it with the gradient-based optimization method.
  arXiv  Detail & Related papers  (2022-02-23T11:23:59Z)
• Offline Model-Based Optimization via Normalized Maximum Likelihood Estimation [101.22379613810881]
  We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process. We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
  arXiv  Detail & Related papers  (2021-02-16T06:04:27Z)
• Sufficiently Accurate Model Learning for Planning [119.80502738709937]
  This paper introduces the constrained Sufficiently Accurate model learning approach. It provides examples of such problems, and presents a theorem on how close some approximate solutions can be. The approximate solution quality will depend on the function parameterization, loss and constraint function smoothness, and the number of samples in model learning.
  arXiv  Detail & Related papers  (2021-02-11T16:27:31Z)
• MAIN: Multihead-Attention Imputation Networks [4.427447378048202]
  We propose a novel mechanism based on multi-head attention which can be applied effortlessly in any model. Our method inductively models patterns of missingness in the input data in order to increase the performance of the downstream task.
  arXiv  Detail & Related papers  (2021-02-10T13:50:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.