A Particle Filter Approach to Approximate Posterior Cramer-Rao Lower Bound: The Case of Hidden States
Bibliographic record
Abstract
The posterior Cramer-Rao lower bound (PCRLB) derived in [1] provides a bound on the mean square error (MSE) obtained with any nonlinear state filter. Computing the PCRLB involves solving complex, multi-dimensional expectations, which do not lend themselves to an easy analytical solution. Furthermore, any attempt to approximate it using numerical or simulation-based approaches require a priori access to the true states, which may not be available, except in simulations or in carefully designed experiments. To allow recursive approximation of the PCRLB when the states are hidden or unmeasured, a new approach based on sequential Monte-Carlo (SMC) or particle filters (PFs) is proposed. The approach uses SMC methods to estimate the hidden states using a sequence of the available sensor measurements. The developed method is general and can be used to approximate the PCRLB in nonlinear systems with non-Gaussian state and sensor noise. The efficacy of the developed method is illustrated on two simulation examples, including a practical problem of ballistic target tracking at reentry phase.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), 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".