Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,101,139 papers from all fields of science
Search
Sign In
Create Free Account
Data processing inequality
The Data processing inequality is an information theoretic concept which states that the information content of a signal cannot be increased via a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Garbage in, garbage out
Information theory
Markov chain
Mutual information
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Penetrating the influence of regularizations on neural network based on information bottleneck theory
Jiangshe Zhang
,
Cong Ma
,
Junmin Liu
,
Guang Shi
Neurocomputing
2020
Corpus ID: 214504683
2018
2018
Recovery and the Data Processing Inequality for Quasi-Entropies
E. Carlen
,
Anna Vershynina
IEEE Transactions on Information Theory
2018
Corpus ID: 52288913
We prove a number of quantitative stability bounds for the cases of equality in Petz’s monotonicity theorem for quasi-relative…
Expand
Highly Cited
2015
Highly Cited
2015
Communication lower bounds for statistical estimation problems via a distributed data processing inequality
M. Braverman
,
A. Garg
,
Tengyu Ma
,
Huy L. Nguyen
,
David P. Woodruff
Symposium on the Theory of Computing
2015
Corpus ID: 1172928
We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high…
Expand
Highly Cited
2013
Highly Cited
2013
Sandwiched Rényi divergence satisfies data processing inequality
S. Beigi
2013
Corpus ID: 17060667
Sandwiched (quantum) α-Renyi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for…
Expand
2013
2013
On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
T. Cui
,
T. Ho
,
J. Kliewer
IEEE Transactions on Information Theory
2013
Corpus ID: 2992696
The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such…
Expand
Highly Cited
2013
Highly Cited
2013
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
V. Anantharam
,
A. Gohari
,
Sudeep Kamath
,
Chandra Nair
ArXiv
2013
Corpus ID: 14080178
In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-R\'{e}nyi maximal correlation of a pair of…
Expand
2011
2011
Tsirelson's bound from a generalized data processing inequality
O. Dahlsten
,
Daniel M. Lercher
,
R. Renner
2011
Corpus ID: 53656877
The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a connection between this bound and…
Expand
2010
2010
Equality conditions for the quantum f-relative entropy and generalized data processing inequalities
N. Sharma
IEEE International Symposium on Information…
2010
Corpus ID: 1403835
We consider the quantum f-relative entropy where f is an operator convex function. We define a family of operator convex…
Expand
2010
2010
Identification and Lossy Reconstruction in Noisy Databases
E. Tuncel
,
Deniz Gündüz
IEEE Transactions on Information Theory
2010
Corpus ID: 8359289
A high-dimensional database system is studied where the noisy versions of the underlying feature vectors are observed in both the…
Expand
Highly Cited
2007
Highly Cited
2007
The Information Bottleneck Revisited or How to Choose a Good Distortion Measure
P. Harremoës
,
Naftali Tishby
IEEE International Symposium on Information…
2007
Corpus ID: 2677388
It is well-known that the information bottleneck method and rate distortion theory are related. Here it is described how the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE