A new reduction scheme for Gaussian Sum Filters
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 many signal processing applications it is required to estimate the unobservable state of a dynamic system from its noisy measurements. For linear dynamic systems with Gaussian Mixture (GM) noise distributions, Gaussian Sum Filters (GSF) provide the MMSE state estimate by tracking the GM posterior. However, since the number of the clusters of the GM posterior grows exponentially over time, suitable reduction schemes need to be used to maintain the size of the bank in GSF. In this work we propose a low computational complexity reduction scheme which uses an initial state estimation to find the active noise clusters and removes all the others. Since the performance of our proposed method relies on the accuracy of the initial state estimation, we also propose five methods for finding this estimation. We provide simulation results showing that with suitable choice of the initial state estimation (based on the shape of the noise models), our proposed reduction scheme provides better state estimations both in terms of accuracy and precision when compared with other reduction methods.
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.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.001 | 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