Online identification of switched linear output error models
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
In this paper, we describe a modified recursive least squares (RLS) algorithm for the online identification of switched linear systems (SLSs). For this problem, a real time mode detection (MD) method is usually employed to detect the running mode for each output data and this part is very important for the estimation results. In fact, it is rather difficult to design a perfect MD method that can identify the running modes without errors, especially in stochastic systems. As a result, there often exist some mode mismatches in the MD procedure. For this reason, we cope with this problem from the compensation point of view. By introducing a resetting strategy to the RLS algorithm, the negative effects of mode mismatches will be separated into a few resetting intervals, which can effectively avoid them to be accumulated and thereby result in good estimation. The performance of the proposed algorithm is evaluated by Monte Carlo simulations in comparison with another alternative method.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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