Two-sided change detection under unknown initial state
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
The problem of detecting a change in distribution of a sequence of independent and identically distributed (IID) random variables is addressed. Unlike previous approaches to sequential change detection, which assume a known initial probability density function (PDF) for the sequence, in this paper we address the case where the initial distribution of the sequence is unknown. An optimal stopping approach based on Bayesian hypothesis testing with exponential delay cost is proposed. The tradeoffs among average detection delay, probability of false alarm and probability of detecting a change in the incorrect direction are investigated. It is shown that the proposed test's probability of change detection in the incorrect direction can be made arbitrarily small without significantly increasing average detection delay for change times larger than a minimum value determined by the hypothesis testing problem itself. The proposed test also has a recursive algorithm to track the minimum risk hypotheses with fixed complexity per sample. Simulation results confirm the derived properties and reveal that the average delay, after an initial transient period, approaches that of the CUSUM test, which is delay-optimal if the initial state were known.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 it