Fragment-Based Deep Learning for Simultaneous Prediction of Polarizabilities and NMR Shieldings of Macromolecules and Their Aggregates
Bibliographic record
Abstract
Simultaneous prediction of the molecular response properties, such as polarizability and the NMR shielding constant, at a low computational cost is an unresolved issue. We propose to combine a linear-scaling generalized energy-based fragmentation (GEBF) method and deep learning (DL) with both molecular and atomic information-theoretic approach (ITA) quantities as effective descriptors. In GEBF, the total molecular polarizability can be assembled as a linear combination of the corresponding quantities calculated from a set of small embedded subsystems in GEBF. In the new GEBF-DL(ITA) protocol, one can predict subsystem polarizabilities based on the corresponding molecular wave function (thus electron density and ITA quantities) and DL model rather than calculate them from the computationally intensive coupled-perturbed Hartree-Fock or Kohn-Sham equations and finally obtain the total molecular polarizability via a linear combination equation. As a proof-of-concept application, we predict the molecular polarizabilities of large proteins and protein aggregates. GEBF-DL(ITA) is shown to be as accurate enough as GEBF, with mean absolute percentage error <1%. For the largest protein aggregate (>4000 atoms), GEBF-DL(ITA) gains a speedup ratio of 3 compared with GEBF. It is anticipated that when more advanced electronic structure methods are used, this advantage will be more appealing. Moreover, one can also predict the NMR chemical shieldings of proteins with reasonably good accuracy. Overall, the cost-efficient GEBF-DL(ITA) protocol should be a robust theoretical tool for simultaneously predicting polarizabilities and NMR shieldings of large systems.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| 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.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".