Turbulence closure modeling with data-driven techniques: Investigation of generalizable deep neural networks
Salar Taghizadeh, Freddie Witherden, Yassin Hassan, Sharath Girimaji

TL;DR
This paper investigates the ability of standard neural networks to generalize in turbulence closure modeling, revealing that larger networks are needed for accuracy and that extrapolation significantly reduces performance, highlighting challenges in practical applications.
Contribution
The study systematically examines the approximation capabilities of moderate-sized fully-connected neural networks for turbulence modeling using proxy-physics systems, emphasizing the effects of complexity, sampling, and optimization.
Findings
Neural networks require more degrees of freedom than proxy models for accurate approximation.
Approximation capability drops significantly when trained on limited parameter space data.
Finding optimal architectures for extrapolation remains challenging.
Abstract
Generalizability of machine-learning (ML) based turbulence closures to accurately predict unseen practical flows remains an important challenge. At the Reynolds-averaged Navier-Stokes (RANS) level, NN-based turbulence closure modeling is rendered difficult due to two important reasons: inherent complexity of the constitutive relation arising from flow-dependent non-linearity and bifurcations; and, inordinate difficulty in obtaining high-fidelity data covering the entire parameter space of interest. In this context, the objective of the work is to investigate the approximation capabilities of standard moderate-sized fully-connected NNs. We seek to systematically investigate the effects of: (i) intrinsic complexity of the solution manifold; (ii) sampling procedure (interpolation vs. extrapolation) and (iii) optimization procedure. To overcome the data acquisition challenges, three…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
