A Novel &#x0026; Stable Stochastic-Mean-Field-Game for Lossy Source-Coding Paradigms: A <italic>Many-Body-Theoretic</italic> Perspective

Adaptive controllers and signal processors play a key role in dealing with parameter uncertainties. This paper proposes an adaptive and new information theoretic algorithm for secure and optimal source-coding. We optimise the volume of the achievable rate-distortion-equivocation region by the privat...

Full description

Bibliographic Details
Main Author: Makan Zamanipour
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8794828/
Description
Summary:Adaptive controllers and signal processors play a key role in dealing with parameter uncertainties. This paper proposes an adaptive and new information theoretic algorithm for secure and optimal source-coding. We optimise the volume of the achievable rate-distortion-equivocation region by the private Helen's rate (HR), defining a stochastic mean-field game (MFG). The aforementioned stochasticity deals with the additional uncoded side-information (SI) at the encoder-decoder, or even possibly-decoded SI at the eavesdropper (Eve). The stochastic partial derivative equations (SPDEs), namely the Hamilton-JacobiBellman (HJB) and the Fokker-Planck-Kolmogorov (FPK) are presented, being solved by a discretised Lagrangian. We explore the Information-flow over the resultant Riemann-Sphere and our proposed SMFG's stability from a many-body-theoretic perspective. We also show that while the equivocation (uncertainty) rate is &#x0394; &#x2264; min{H(X), R<sub>h</sub>}, I(Y; Z|W) which is upper-bounded to min{I(X; Y), I(Y; Z|W)}, versus I(X; Z|W) theoretically converges to the information-Bottleneck-bound H(X). Simulation results also show an out-performance of our scheme over the existing work, proving the SMFG's stability and an adequate distance to Pareto-Optimal sets. Our generic solution covers a comprehensive field of studies determining smooth non-linearity.
ISSN:2169-3536