A fast and accurate physics-informed neural network reduced order model with shallow masked autoencoder
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Traditional linear subspace reduced order models (LS-ROMs) are able to accelerate physical simulations, in which the intrinsic solution space falls into a subspace with a small dimension, i.e., the solution space has a small Kolmogorov n-width. However, for physical phenomena not of this type, e.g., any advection-dominated flow phenomena, such as in traffic flow, atmospheric flows, and air flow over vehicles, a low-dimensional linear subspace poorly approximates the solution. To address cases such as these, we have developed a fast and accurate physics-informed neural network ROM, namely nonlinear manifold ROM (NM-ROM), which can better approximate high-fidelity model solutions with a smaller latent space dimension than the LS-ROMs. Our method takes advantage of the existing numerical methods that are used to solve the corresponding full order models. The efficiency is achieved by developing a hyper-reduction technique in the context of the NM-ROM. Numerical results show that neural networks can learn a more efficient latent space representation on advection-dominated data from 1D and 2D Burgers' equations. A speedup of up to 2.6 for 1D Burgers' and a speedup of 11.7 for 2D Burgers' equations are achieved with an appropriate treatment of the nonlinear terms through a hyper-reduction technique. Finally, a posteriori error bounds for the NM-ROMs are derived that take account of the hyper-reduced operators.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
PyTorch: An Imperative Style, High-Performance Deep Learning Library
Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.01703 · Cited by 31,473
Raissi, M., Perdikaris, P., & Karniadakis, G. E. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.10.045 · Cited by 20,384 · cited 1×
“Such models include, but are not limited to, attempts to mimic temporal evolution by incorporating a time integrator in a loss function [59,15,36,47,4] and to represent the solution with a trained NN [59,77,6], the deep Galerkin method [65], approximating spatial gradient functions with a multilayer feedforward NN [30…”
Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification
He, K., Zhang, X., Ren, S., & Sun, J. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.123 · Cited by 19,741
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Neural ordinary differential equations
Chen, R. T. Q., Rubanova, Y., Bettencourt, J., & Duvenaud, D. (2018) · arXiv · doi:10.48550/arxiv.1806.07366 · Cited by 2,097
fPINNs: Fractional Physics-Informed Neural Networks
Pang, G., Lu, L., & Karniadakis, G. E. (2019) · SIAM Journal on Scientific Computing · doi:10.1137/18m1229845 · Cited by 1,105 · cited 1×
“Such models include, but are not limited to, attempts to mimic temporal evolution by incorporating a time integrator in a loss function [59,15,36,47,4] and to represent the solution with a trained NN [59,77,6], the deep Galerkin method [65], approximating spatial gradient functions with a multilayer feedforward NN [30…”
MethodLarge-scale deep unsupervised learning using graphics processors
Raina, R., Madhavan, A., & Ng, A. Y. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553486 · Cited by 742 · cited 1×
“Furthermore, graphics processing units (GPUs) are utilized to parallelize the autonencoder’s training by simultaneously approximating multiple snapshots [58].”
Cited by
Enhancing computational fluid dynamics with machine learning
Vinuesa, R., & Brunton, S. L. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00264-7 · Cited by 596
Explainable machine learning in materials science
Zhong, X., Gallagher, B., Liu, S., Kailkhura, B., Hiszpanski, A., & Han, T. Y.-J. (2022) · npj Computational Materials · doi:10.1038/s41524-022-00884-7 · Cited by 501
Perspectives on the integration between first-principles and data-driven modeling
Bradley, W., Kim, J., Kilwein, Z., Blakely, L., Eydenberg, M., Jalvin, J., Laird, C., & Boukouvala, F. (2022) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2022.107898 · Cited by 231
Metadata
- Authors
- Kim, Y., Choi, Y., Widemann, D., & Zohdi, T.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 2022-02
- Volume
- 451
- Pages
- 110841
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W3212629973
- Cited by
- 221
- References
- 9
- FWCI
- 13.69
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A fast and accurate physics-informed neural network reduced order model with shallow masked autoencoder. https://app.cochat.ai/papers/10.1016/j.jcp.2021.110841
- The paper
- Kim, Y., Choi, Y., Widemann, D., & Zohdi, T. (2022). A fast and accurate physics-informed neural network reduced order model with shallow masked autoencoder. Journal of Computational Physics. https://doi.org/10.1016/j.jcp.2021.110841
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.