Approximate Conditional Mean Particle Filtering for Linear/Nonlinear Dynamic State Space 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
We consider linear systems whose state parameters are separable into linear and nonlinear sets, and evolve according to some known transition distribution, and whose measurement noise is distributed according to a mixture of Gaussians. In doing so, we propose a novel particle filter that addresses the optimal state estimation problem for the aforementioned class of systems. The proposed filter, referred to as the approximate conditional mean particle filter (ACM-PF), is a combination of the approximate conditional mean filter and the sequential importance sampling particle filter. The algorithm development depends on approximating a mixture of Gaussians distribution with a moment-matched Gaussian in the weight update recursion. A condition indicating when this approximation is valid is given. In order to evaluate the performance of the proposed algorithm, we address the blind signal detection problem for an impulsive flat fading channel and the tracking of a maneuvering target in the presence of glint noise. Extensive computer simulations were carried out. For computationally intensive implementations (large number of particles), the proposed algorithm offers performance that is comparable to other state-of-the-art particle filtering algorithms. In the scenario where computational horsepower is heavily constrained, it is shown that the proposed algorithm offers the best performance amongst the considered algorithms for these specific examples.
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.001 | 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.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