Robust Entropy Rate for Uncertain Sources: Applications to Communication and Control Systems
Bibliographic record
Abstract
In this paper the notion of robust entropy and subsequently, robust entropy rate for a family of discrete time uncertain sources is introduced. When the uncertainty is described by a relative entropy constraint between the set of uncertain source densities and a given nominal source density, the solution to this robust notion of information is presented and its connection with other notions of entropy definitions, such as, Renyi entropy and Tsallis entropy is presented. Then, the robust entropy rate is calculated for 1) Uncertain sources corresponding to a partially observed Gauss Markov process, 2) Sources with uncertain frequency response, and 3) Uncertain sources corresponding to a partially observed controlled Gauss Markov Process. Finally, an application of the robust entropy rate in networked control systems is presented by defining necessary conditions for uniform asymptotic stabilizability and observability. I. I NTRODUCTION The entropy and entropy rate are information theoretic measures. They have applications in physics, probability and statistics, communication theory and economics. The importance of entropy in communication theory was first introduced by Shannon in terms of Shannon first coding theorem. Then, the application of entropy rate in joint source channel coding theorem, the AEP and etc. is shown (1). The objective of this paper is to extend the notion of entropy and subsequently entropy rate to the case when there is uncertainty in the source. The robust entropy is defined as the maximum of the Shannon entropy over a family of sources belonging to an uncertainty set. The explicit solution to the robust entropy is presented when the uncertainty is described by a constraint on the relative entropy between the set of uncertain source densities and the corresponding nominal source density. Subsequently, the connection between this solution with other entropies is shown. Then, for different families of uncertain source densities, the robust entropy rate is calculated and an application of the robust entropy rate in stabilizability and observability of networked control systems is presented. This paper is organized as follows. In Section II, the robust entropy and the robust entropy rate are defined. The solution to the robust entropy and its connection to other kinds of entropy are presented. In Section III, for different families of uncertain sources, the robust entropy rate is calculated. Finally in Section IV, an application of robust entropy rate in stabilizability and observability of networked control system is presented.
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 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.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".