Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
strong data processing inequality
Description:
An information-theoretic inequality bounding how much statistical distinguishability or information can persist after a stochastic channel acts.
Related topics:
Markov Chains and Monte Carlo Methods (9%),
Quantum Information and Cryptography (8%),
Privacy-Preserving Technologies in Data (8%)
OpenAlex ID:
keywords/strong-data-processing-inequality
Strong Data Processing Inequalities and $\Phi $ -Sobolev Inequalities for Discrete Channels
2016
·
Maxim Raginsky
·
IEEE Transactions on Information Theory
·
181
Strong Data-Processing Inequalities for Channels and Bayesian Networks
2017
·
Yury Polyanskiy
, Yihong Wu
·
The IMA volumes in mathematics and its applications
·
175
PDF
Complete Entropic Inequalities for Quantum Markov Chains
2022
·
Li Gao
, Cambyse Rouzé
·
Archive for Rational Mechanics and Analysis
·
98
PDF
Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation
2016
·
Aolin Xu
, Maxim Raginsky
·
IEEE Transactions on Information Theory
·
66
PDF
A Strong Entropy Power Inequality
2017
·
Thomas A. Courtade
·
IEEE Transactions on Information Theory
·
56
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels
2017
·
Flavio du Pin Calmon
, Yury Polyanskiy
, et al.
·
IEEE Transactions on Information Theory
·
52
PDF
On Relations Between the Relative Entropy and χ2-Divergence, Generalizations and Applications
2020
·
Tomohiro Nishiyama
, Igal Sason
·
Entropy
·
47
PDF
Comparison of Contraction Coefficients for f-Divergences
2020
·
A. Makur
, L. Zheng
·
Problems of Information Transmission
·
40
Logarithmic Sobolev inequalities and strong data processing theorems for discrete channels
2013
·
Maxim Raginsky
·
IEEE International Symposium on Information Theory (ISIT)
·
38
Bounds between contraction coefficients
2015
·
Anuran Makur
, Lizhong Zheng
·
Allerton Conference on Communication, Control, and Computing
·
29
Communication complexity of estimating correlations
2019
·
Uri Hadar
, Jingbo Liu
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
26
PDF
Outer bounds for multiterminal source coding via a strong data processing inequality
2013
·
Thomas A. Courtade
·
IEEE International Symposium on Information Theory (ISIT)
·
24
PDF
Information-Theoretic Lower Bounds for Distributed Function Computation
2017
·
Aolin Xu
, Maxim Raginsky
·
IEEE Transactions on Information Theory
·
23
PDF
Information-Theoretic Perspectives on Brascamp-Lieb Inequality and Its Reverse
2017
·
Liu, Jingbo
, Courtade, Thomas A.
, et al.
·
arXiv (Cornell University)
·
22
PDF
Converses for distributed estimation via strong data processing inequalities
2015
·
Aolin Xu
, Maxim Raginsky
·
IEEE International Symposium on Information Theory (ISIT)
·
21
PDF
Non-linear Log-Sobolev Inequalities for the Potts Semigroup and Applications to Reconstruction Problems
2023
·
Yuzhou Gu
, Yury Polyanskiy
·
Communications in Mathematical Physics
·
18
PDF
Communication complexity of estimating correlations
2019
·
DSpace@MIT (Massachusetts Institute of Technology)
·
18
Information-Theoretic Generalization Bounds for Deep Neural Networks
2025
·
Haiyun He
, Ziv Goldfeld
·
IEEE Transactions on Information Theory
·
17
PDF
The Strong Data Processing Inequality Under the Heat Flow
2025
·
Bo'az Klartag
, Or Ordentlich
·
IEEE Transactions on Information Theory
·
17
PDF
Quantum Doeblin Coefficients: Interpretations and Applications
2026
·
Ian George
, Christoph Hirche
, et al.
·
Quantum
·
16
PDF
Contraction of $E_γ$-Divergence and Its Applications to Privacy
2020
·
Asoodeh, Shahab
, Diaz, Mario
, et al.
·
arXiv (Cornell University)
·
16
PDF
Strong data processing inequalities and $Φ$-Sobolev inequalities for discrete channels
2014
·
Raginsky, Maxim
·
arXiv (Cornell University)
·
16
PDF
Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
2026
·
Andre Wibisono
·
IEEE Transactions on Information Theory
·
15
PDF
Entropy contractions in Markov chains: Half-step, full-step and continuous-time
2025
·
Pietro Caputo
, Zongchen Chen
, et al.
·
Electronic Journal of Probability
·
15
Sum-of-Squares Proofs of Logarithmic Sobolev Inequalities on Finite Markov Chains
2023
·
Oisín Faust
, Hamza Fawzi
·
IEEE Transactions on Information Theory
·
15
PDF
Show more works
View as search
Works count:
84
Citation count:
1,270
Year
Topic
Type