Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Garbage in, garbage outInformation theoryMarkov chainMutual 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
2018
2018
Recovery and the Data Processing Inequality for Quasi-Entropies
We prove a number of quantitative stability bounds for the cases of equality in Petz’s monotonicity theorem for quasi-relative… 
Highly Cited
2015
Highly Cited
2015
Communication lower bounds for statistical estimation problems via a distributed data processing inequality
We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high… 
Highly Cited
2013
Highly Cited
2013
Sandwiched Rényi divergence satisfies data processing inequality
Sandwiched (quantum) α-Renyi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for… 
2013
2013
On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such… 
Highly Cited
2013
Highly Cited
2013
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-R\'{e}nyi maximal correlation of a pair of… 
2011
2011
Tsirelson's bound from a generalized data processing inequality
The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a connection between this bound and… 
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… 
2010
2010
Identification and Lossy Reconstruction in Noisy Databases
A high-dimensional database system is studied where the noisy versions of the underlying feature vectors are observed in both the… 
Highly Cited
2007
Highly Cited
2007
The Information Bottleneck Revisited or How to Choose a Good Distortion Measure
It is well-known that the information bottleneck method and rate distortion theory are related. Here it is described how the… 
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)