Bibliographic record
Abstract
We first introduce various algorithms and techniques for machine learning and data science. While there is a strong focus on neural network applications in unsupervised, supervised and reinforcement learning, other machine learning techniques are discussed as well. These include various clustering and anomaly detection algorithms, support vector machines, and decision trees. In addition, we review data science techniques such as genetic algorithms and topological data analysis. This first part of the review makes some reference to concepts in physics, but the explanations and examples do not assume any knowledge of string theory and should therefore be accessible to a wide variety of readers with a physics background. After that, we illustrate applications to string theory. We give an overview of existing string theory data sets and describe how they can be studied using data science techniques. We also explain the computational complexity involved in the investigation of string vacua. Example codes that illustrate the techniques introduced in this review are available from Fabian Ruehle (0000).
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.004 | 0.018 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.007 | 0.009 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.005 | 0.007 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.003 | 0.007 |
| Insufficient payload (model declined to judge) | 0.007 | 0.004 |
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".