Hierarchically accelerated dynamic programming for finite-state machines
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A procedure called hierarchically accelerated dynamic programming (HADP) is presented which, at the cost of a degree of suboptimality, can significantly accelerate dynamic programming algorithms for discrete event systems modeled by finite-state machines (FSMs). The methodology is based. upon the (possibly iterated) dynamical abstraction of a given FSM by state aggregation in order to generate a so-called partition machine hierarchy. Necessary and sufficient conditions for the HADP procedure to generate globally optimal solutions are given as well as bounds on the degree of suboptimality of the method. A group of examples called the Broken Manhattan Grid problems is used to illustrate an implementation of HADP with two and three level hierarchies. A set of open problems is described concerning the construction and selection of the partition machine abstractions and the improvement of the estimation of HADP suboptimality.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it