Editorial: Special issue on operations research and machine learning
Bibliographic record
Abstract
Many machine learning techniques work through optimizing specific objective functions. Supervised learning techniques are to minimize the prediction error such as mean square error (MSE) and misclassification rate, or maximize the conditional likelihood, posterior probability, etc. Unsupervised learning techniques usually group instances into clusters in a way that instances within each group are optimally similar while they are distant from instances in other groups. In reinforcement learning, the goal of an agent is to maximize its cumulative reward. However, there is still room to exploit optimization and operations research (OR) in machine learning, and vice versa.
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.007 | 0.024 |
| Meta-epidemiology (narrow) | 0.007 | 0.002 |
| Meta-epidemiology (broad) | 0.008 | 0.006 |
| Bibliometrics | 0.006 | 0.004 |
| Science and technology studies | 0.003 | 0.004 |
| Scholarly communication | 0.012 | 0.006 |
| Open science | 0.005 | 0.002 |
| Research integrity | 0.019 | 0.021 |
| Insufficient payload (model declined to judge) | 0.063 | 0.039 |
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".