Bibliographic record
Abstract
Training a neural network for semantic segmentation with many images and pixel-level segmentations is a well-established computer-vision technique. When pixel-level segmentations are unavailable, weak supervision or prior information like bounding boxes and the size/shape of objects still enables training a network. Directly including prior knowledge on the segmentations means constraining the network output. This complicates the possible optimization strategies because the regularization then acts on the non-linear neural-network function output and not on the optimization variables. We present a new algorithm to include prior information via constraints on the network output, implemented via projection-based point-to-set distance functions, that are differentiable and always have the same functional form for the derivative. Thus, there is no need to adapt penalty functions or algorithms to various constraints. The distance function's differentiability also avoids issues related to constraining properties typically associated with non-differentiable penalties. We show that by explicitly taking a general neural network structure into account, the Lagrangian for the problem 'naturally' decouples the constraints and neural network, which allows for a gradient computation via backpropagation/adjoint-state as is common in deep learning. We present a suite of constraint sets suitable for segmentation problems. The numerical experiments show that learning from constraint sets applies to the broader imaging sciences, including visual and non-visual imagery, even when training a network for a single example.
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.003 | 0.011 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.003 | 0.005 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".