Bibliographic record
Abstract
This chapter talks about improving the performance of computational processes. It shows an example where we can time how long it takes to generate a set of random uniform numbers. Profiling is best used on calculations we have already discovered are “slow.” The chapter shows how it is done by wrapping a call to the Rvmmin minimizer in commands that ask for a profile to be saved. It analyzes the byte-code compiler for R. The compiler package is part of the distribution but needs to be loaded or invoked via appropriate instructions when packages are installed. The chapter demonstrates the use of the minimization of the Rayleigh quotient to find the largest eigenvalue of a symmetric matrix. One of the major parts of any iterative algorithm is deciding when it is finished, or rather when the approximation to the answer we have is “good enough.”.
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.019 | 0.089 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.003 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.003 | 0.006 |
| Scholarly communication | 0.006 | 0.008 |
| Open science | 0.006 | 0.010 |
| Research integrity | 0.003 | 0.007 |
| Insufficient payload (model declined to judge) | 0.028 | 0.013 |
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".