Team Optimal Decentralized State Estimation
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 the problem of optimal decentralized estimation of a linear stochastic process by multiple agents. Each agent receives a noisy observation of the state of the process and delayed observations of its neighbors (according to a pre-specified, strongly connected, communication graph). Based on their observations, all agents generate a sequence of estimates of the state of the process. The objective is to minimize the total expected weighted mean square error between the state and the agents' estimates over a finite horizon. In centralized estimation with weighted mean square error criteria, the optimal estimator does not depend on the weight matrix in the cost function. We show that this is not the case when the information is decentralized. The optimal decentralized estimates depend on the weight matrix in the cost function. In particular, we show that the optimal estimate consists of two parts: a common estimate which is the conditional mean of the state given the common information and a correction term which is a linear function of the offset of the local information from the conditional expectation of the local information given the common information. The corresponding gain depends on the weight matrix as well as on the covariance between the offset of agents' local information from the conditional mean of the local information given the common information. We show that the local and common estimates can be computed from a single Kalman filter and derive recursive expressions for computing the offset covariances and the estimation gains.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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