Average cost optimal threshold strategies for remote estimation with communication cost
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 consider a remote sensing system that consists of a sensor and an estimator. A sensor observes a first order Markov source and must communicate it to a remote estimator. Communication is noiseless but expensive. At each time, based on the history of its observations and decisions, the sensor chooses whether to transmit or not. If the sensor does not transmit, then the estimator must estimate the Markov process using its past observations. We study the average cost problem in the light of vanishing discount approach. The problem was studied previously by Lipsa and Martins, IEEE TAC, 2011 and by Nayyar et al, IEEE TAC, 2013, where it was shown that the optimal estimation policy is Kalman-like and the optimal communication policy is to communicate when the estimation error is greater than a threshold. In the discounted set-up, we had earlier characterized the optimal policy and the optimal thresholds as a function of communication cost. The average cost problem is investigated as the limiting case of the discounted cost problem as the discount factor approaches one. The average cost and the optimal values of the thresholds are provided in terms of the communication cost. Lastly, we present an example of birth-death Markov chain to illustrate our results.
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.001 | 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