Heuristic Search Strategy for Transforming Microstructural Patterns to Optimal Copolymerization Recipes
Bibliographic record
Abstract
Abstract Manipulation and optimization of copolymer microstructure for tailoring final properties is of great importance in macromolecular science and engineering. Uncovering the complexities of the interrelationships between copolymerization recipe and copolymer microstructure (a challenging field of study in its own right) is a multiobjective optimization problem, which has attracted a lot of attention in the last 10–15 years. In the present study, a powerful optimizer is developed based on the Non‐dominated Sorting Genetic Algorithm (NSGA‐II) for transforming desired microstructural copolymerization profiles, including molecular weight distribution and chemical composition distribution, back to optimal copolymerization recipes and operating conditions. The optimizer developed has the beneficial features of robust machine learning and multiobjective optimization based upon heuristic search strategies. The metallocene‐catalyzed ethylene/α‐olefin copolymerization is selected as a sufficiently complex system to challenge the proposed optimization tool. The developed computer code is used to explore copolymerization recipes (polymerization temperature and concentrations of ethylene, 1butene, cocatalyst, and hydrogen) needed to synthesize copolymers having desired microstructural features. Based on the results obtained, it is now possible to produce various grades or tailor‐make the copolymer structure by suggesting the “best” copolymerization recipe/conditions as reliably as possible.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".