Reduced-order modeling for stochastic large-scale and time-dependent flow problems using deep spatial and temporal convolutional autoencoders
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A non-intrusive reduced-order model based on convolutional autoencoders is proposed as a data-driven tool to build an efficient nonlinear reduced-order model for stochastic spatiotemporal large-scale flow problems. The objective is to perform accurate and rapid uncertainty analyses of the flow outputs of interest for which the input parameters are deemed uncertain. The data are constituted from a set of high-fidelity snapshots, collected using an inhouse high-fidelity flow solver, which correspond to a sample of the uncertain input parameters. The method uses a 1D-convolutional autoencoder to reduce the spatial dimension of the unstructured meshes used by the flow solver. Another convolutional autoencoder is used for the time compression. The encoded latent vectors, generated from the two compression levels, are then mapped to the input parameters using a regression-based multilayer perceptron. The proposed model allows for rapid predictions for unseen parameter values, allowing the output statistical moments to be computed efficiently. The accuracy of the proposed approach is compared to that of the linear reduced-order technique based on an artificial neural network through two benchmark tests (the one-dimensional Burgers and Stoker's solutions) and a hypothetical dam break flow problem, with an unstructured mesh and over a complex bathymetry river. The numerical results show that the proposed methods present strong predictive capabilities to accurately approximate the statistical moments of the outputs. In particular, the predicted statistical moments are oscillations-free, unlike those obtained with the traditional proper orthogonal decomposition method. The proposed reduction framework is simple to implement and can be applied to other parametric and time-dependent problems governed by partial differential equations, which are commonly encountered in many engineering and science problems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it