Lasso logistic regression to derive workflow-specific algorithm performance requirements as demonstrated for head and neck cancer deformable image registration in adaptive radiation therapy
Bibliographic record
Abstract
As automation in radiation oncology becomes more common, it is important to determine which algorithms are equivalent for a given workflow. Often, algorithm comparisons are performed in isolation; however, clinical context can provide valuable insight into the importance of algorithm features and error magnification in subsequent workflow steps. We propose a strategy for deriving workflow-specific algorithm performance requirements. We considered two independent workflows indicating the need for radiotherapy treatment replanning for 15 head and neck cancer patients (15 planning CTs, 105 on-unit CBCTs). Each workflow was based on a different deformable image registration (DIR) algorithm. Differences in DIR output were assessed using three sets of QA metrics: (1) conventional, (2) workflow-specific, (3) a combination of (1) and (2). For a given set of algorithm metrics, lasso logistic regression modeled the probability of discrepant replan indications. Varying the minimum probability needed to predict a workflow discrepancy produced receiver operating characteristic (ROC) curves. ROC curves were compared using sensitivity, specificity, and the area under the curve (AUC). A heuristic then derived simple algorithm performance requirements. Including workflow-specific QA metrics improved AUC from 0.70 to 0.85, compared to the use of conventional metrics alone. Algorithm performance requirements had high sensitivity of 0.80, beneficial for replan assessments, with specificity of 0.57. This was an improvement over a naïve application of conventional QA criteria, which had sensitivity of 0.57 and specificity of 0.68. In addition, the algorithm performance requirements indicated practical refinements of conventional QA tolerances, indicated where auxiliary workflow processes should be standardized, and may be used to prioritize structures for manual review. Our algorithm performance requirements outperformed current comparison recommendations and provided practical means for ensuring workflow equivalence. This strategy may aid in trial credentialing, algorithm development, and streamlining expert adjustment of workflow output.
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.017 | 0.085 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".