Information-Distilling Quantizers

DOI10.1109/TIT.2021.3059338MaRDI QIDQ5001643zbMATH OpenOpenAlexFDO

Authors Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy

Publication date 22 July 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.03031

Mathematics Subject Classification ID

LOCC, teleportation, dense coding, remote state operations, distillation (81P48) Coding theorems (Shannon theory) (94A24)

Abstract: Let $X$ and $Y$ be dependent random variables. This paper considers the problem of designing a scalar quantizer for $Y$ to maximize the mutual information between the quantizer's output and $X$, and develops fundamental properties and bounds for this form of quantization, which is connected to the log-loss distortion criterion. The main focus is the regime of low $I(X;Y)$, where it is shown that, if $X$ is binary, a constant fraction of the mutual information can always be preserved using $mathcalO(log(1/I(X;Y)))$ quantization levels, and there exist distributions for which this many quantization levels are necessary. Furthermore, for larger finite alphabets $2<|mathcalX|<infty$, it is established that an $eta$-fraction of the mutual information can be preserved using roughly $(log(|mathcalX|/I(X;Y)){)}^{etacdot(|mathcalX|-1)}$ quantization levels.

Cited in

(4)

• Quadratically Constrained Information Theoretic Analysis
• scientific article; zbMATH DE number 5052074 (Why is no real title available?)
• Mini-workshop: Mathematical foundations of robust and generalizable learning. Abstracts from the mini-workshop held October 2--8, 2022
• Attainability of two-point testing rates for finite-sample location estimation

This page was built for publication: Information-Distilling Quantizers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001643)