Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes

03/19/2021
by   Meysam Ghomi, et al.
0

Optimal zero-delay coding (quantization) of ℝ^d-valued linearly generated Markov sources is studied under quadratic distortion. The structure and existence of deterministic and stationary coding policies that are optimal for the infinite horizon average cost (distortion) problem is established. Prior results studying the optimality of zero-delay codes for Markov sources for infinite horizons either considered finite alphabet sources or, for the ℝ^d-valued case, only showed the existence of deterministic and non-stationary Markov coding policies or those which are randomized. In addition to existence results, for finite blocklength (horizon) T the performance of an optimal coding policy is shown to approach the infinite time horizon optimum at a rate O(1/T). This gives an explicit rate of convergence that quantifies the near-optimality of finite window (finite-memory) codes among all optimal zero-delay codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2018

Zero-Delay Rate Distortion via Filtering for Vector-Valued Gaussian Sources

We deal with zero-delay source coding of a vector-valued Gauss-Markov so...
research
11/29/2012

On the Use of Non-Stationary Policies for Stationary Infinite-Horizon Markov Decision Processes

We consider infinite-horizon stationary γ-discounted Markov Decision Pro...
research
12/16/2019

On Zero-Delay RDF for Vector-Valued Gauss-Markov Sources with Additional Noise

We consider a zero-delay remote source coding problem where a hidden sou...
research
12/16/2019

A Converse Bound Characterization on Zero-Delay Indirect RDF for Vector Gauss-Markov Sources

We consider a zero-delay remote source coding problem where a hidden sou...
research
10/15/2020

Near Optimality of Finite Memory Feedback Policies in Partially Observed Markov Decision Processes

In the theory of Partially Observed Markov Decision Processes (POMDPs), ...
research
09/03/2019

Optimal Causal Rate-Constrained Sampling of the Wiener Process

We consider the following communication scenario. An encoder causally ob...
research
03/22/2021

Convergence of Finite Memory Q-Learning for POMDPs and Near Optimality of Learned Policies under Filter Stability

In this paper, for POMDPs, we provide the convergence of a Q learning al...

Please sign up or login with your details

Forgot password? Click here to reset