A Nonstochastic Information Theory for Communication and State Estimation

Abstract

In communications, unknown variables are usually modelled as random variables, and concepts such as independence, entropy and information are defined in terms of the underlying probability distributions. In contrast, control theory often treats uncertainties and disturbances as bounded unknowns having no statistical structure. The area of networked control combines both fields, raising the question of whether it is possible to construct meaningful analogues of stochastic concepts such as independence, Markovness, entropy and information without assuming a probability space. This paper introduces a framework for doing so, leading to the construction of a maximin information functional for nonstochastic variables. It is shown that the largest maximin information rate through a memoryless, error-prone channel in this framework coincides with the block-coding zero-error capacity of the channel. Maximin information is then used to derive tight conditions for uniformly estimating the state of a linear time-invariant system over such a channel, paralleling recent results of Matveev and Savkin.

References in corpus (1)

• Error Correcting Codes for Distributed Control

Cited by in corpus (14)

• The value of timing information in event-triggered control
• Development and Analysis of Deterministic Privacy-Preserving Policies Using Non-Stochastic Information Theory
• Approximate Information States for Worst-Case Control and Learning in Uncertain Systems
• Synergy, Redundancy and Common Information
• Measuring Information Leakage in Non-stochastic Brute-Force Guessing
• State Estimation over Worst-Case Erasure and Symmetric Channels with Memory
• Bounded State Estimation over Finite-State Channels: Relating Topological Entropy and Zero-Error Capacity
• Zero-Error Communication over Adversarial MACs
• Non-Stochastic Information Theory
• Non-Stochastic Hypothesis Testing with Application to Privacy Against Hypothesis-Testing Adversary
• Developing Non-Stochastic Privacy-Preserving Policies Using Agglomerative Clustering
• Feedback Capacity over Networks
• Passive-Aggressive Learning and Control
• Rethinking the Mathematical Framework and Optimality of Set-Membership Filtering