Filtrage statistique optimal rapide dans des systèmes linéaires à sauts non stationnaires
Bibliographic record
Abstract
Nous traitons du problème de filtrage statistique optimal dans des systèmes à sauts. Nous considérons trois processus : un processus continu caché X, un processus continu observé Y, et un processus discret caché R modélisant les « sauts », qui peuvent être vus comme les changements aléatoires des paramètres régissant localement les distributions markoviennes du couple (X,Y). Nous nous intéressons à une famille récente de modèles dans laquelle il est possible de mettre en place un filtrage optimal rapide, dont la complexité est linéaire en temps. Nous étendons cette famille en introduisant un quatrième processus discret fini U permettant de modéliser les possibles non-stationnarités du triplet (X, R, Y). Nous montrons que les filtrages optimaux rapides demeurent possibles dans la famille étendue et nous illustrons leur intérêt via quelques simulations.
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 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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 teacher head, 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".