Predicting Ultra-High-Performance Concrete Compressive Strength Using Tabular Generative Adversarial Networks
Bibliographic record
Abstract
There have been abundant experimental studies exploring ultra-high-performance concrete (UHPC) in recent years. However, the relationships between the engineering properties of UHPC and its mixture composition are highly nonlinear and difficult to delineate using traditional statistical methods. There is a need for robust and advanced methods that can streamline the diverse pertinent experimental data available to create predictive tools with superior accuracy and provide insight into its nonlinear materials science aspects. Machine learning is a powerful tool that can unravel underlying patterns in complex data. Accordingly, this study endeavors to employ state-of-the-art machine learning techniques to predict the compressive strength of UHPC using a comprehensive experimental database retrieved from the open literature consisting of 810 test observations and 15 input features. A novel approach based on tabular generative adversarial networks was used to generate 6513 plausible synthetic data for training robust machine learning models, including random forest, extra trees, and gradient boosting regression. While the models were trained using the synthetic data, their ability to generalize their predictions was tested on the 810 experimental data thus far unknown and never presented to the models. The results indicate that the developed models achieved outstanding predictive performance. Parametric studies using the models were able to provide insight into the strength development mechanisms of UHPC and the significance of the various influential parameters.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".