Fetching the paper…
Reading the bibliography…
For any channel $P_{Y|X}$ the strong data processing constant is defined as the smallest number $\eta_{KL}\in[0,1]$ such that $I(U;Y)\le \eta_{KL} I(U;X)$ holds for any Markov chain $U-X-Y$.
I. Csiszár, “Information-type measures of difference of probability distributions and indirect observation,” studia scientiarum Mathematicarum Hungarica , vol. 2, pp. 229–318, 1967
1967
Earlier work this paper cites.
R. Ahlswede and P. Gács, “Spreading of sets in product spaces and hypercontraction of the markov operator,” The annals of probability , pp. 925–939, 1976
1976
Earlier work this paper cites.
J. Cohen, J. H. Kempermann, and G. Zbaganu, Comparisons of stochastic matrices with applications in information theory, statistics, economics and population . Springer Science & Business Media, 1998
1998
Cited alongside, same era.
Y. Polyanskiy and Y. Wu, “Strong data-processing inequalities for channels and Bayesian networks,” in Convexity and Concentration . Springer, 2017, pp. 211–249
2017
Cited alongside, same era.
Y. Polyanskiy, “Post-SDPI and distributed estimation”, Lecture 5, Information-Theoretic Methods in Statistics and Computer Science , EPFL, 2019. http://people.lids.mit.edu/yp/homepage/data/LN_sdpi3.pdf
2019
Later among the works it cites.
——, “Application of the information-percolation method to reconstruction problems on graphs,” Mathematical Statistics and Learning , vol. 2, no. 1, pp. 1–24, 2020
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…