181,418 research outputs found

    Sumset and Inverse Sumset Inequalities for Differential Entropy and Mutual Information

    Get PDF
    The sumset and inverse sumset theories of Freiman, Pl\"{u}nnecke and Ruzsa, give bounds connecting the cardinality of the sumset A+B={a+b  ;  a∈A, b∈B}A+B=\{a+b\;;\;a\in A,\,b\in B\} of two discrete sets A,BA,B, to the cardinalities (or the finer structure) of the original sets A,BA,B. For example, the sum-difference bound of Ruzsa states that, ∣A+B∣ ∣A∣ ∣B∣≤∣A−B∣3|A+B|\,|A|\,|B|\leq|A-B|^3, where the difference set A−B={a−b  ;  a∈A, b∈B}A-B= \{a-b\;;\;a\in A,\,b\in B\}. Interpreting the differential entropy h(X)h(X) of a continuous random variable XX as (the logarithm of) the size of the effective support of XX, the main contribution of this paper is a series of natural information-theoretic analogs for these results. For example, the Ruzsa sum-difference bound becomes the new inequality, h(X+Y)+h(X)+h(Y)≤3h(X−Y)h(X+Y)+h(X)+h(Y)\leq 3h(X-Y), for any pair of independent continuous random variables XX and YY. Our results include differential-entropy versions of Ruzsa's triangle inequality, the Pl\"{u}nnecke-Ruzsa inequality, and the Balog-Szemer\'{e}di-Gowers lemma. Also we give a differential entropy version of the Freiman-Green-Ruzsa inverse-sumset theorem, which can be seen as a quantitative converse to the entropy power inequality. Versions of most of these results for the discrete entropy H(X)H(X) were recently proved by Tao, relying heavily on a strong, functional form of the submodularity property of H(X)H(X). Since differential entropy is {\em not} functionally submodular, in the continuous case many of the corresponding discrete proofs fail, in many cases requiring substantially new proof strategies. We find that the basic property that naturally replaces the discrete functional submodularity, is the data processing property of mutual information.Comment: 23 page

    Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series

    Get PDF
    We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypotheses testing in a framework of classical mathematical statistics. The methods for identity testing and nonparametric testing of serial independence for time series are suggested.Comment: submitte

    The Inflation Technique for Causal Inference with Latent Variables

    Full text link
    The problem of causal inference is to determine if a given probability distribution on observed variables is compatible with some causal structure. The difficult case is when the causal structure includes latent variables. We here introduce the inflation technique\textit{inflation technique} for tackling this problem. An inflation of a causal structure is a new causal structure that can contain multiple copies of each of the original variables, but where the ancestry of each copy mirrors that of the original. To every distribution of the observed variables that is compatible with the original causal structure, we assign a family of marginal distributions on certain subsets of the copies that are compatible with the inflated causal structure. It follows that compatibility constraints for the inflation can be translated into compatibility constraints for the original causal structure. Even if the constraints at the level of inflation are weak, such as observable statistical independences implied by disjoint causal ancestry, the translated constraints can be strong. We apply this method to derive new inequalities whose violation by a distribution witnesses that distribution's incompatibility with the causal structure (of which Bell inequalities and Pearl's instrumental inequality are prominent examples). We describe an algorithm for deriving all such inequalities for the original causal structure that follow from ancestral independences in the inflation. For three observed binary variables with pairwise common causes, it yields inequalities that are stronger in at least some aspects than those obtainable by existing methods. We also describe an algorithm that derives a weaker set of inequalities but is more efficient. Finally, we discuss which inflations are such that the inequalities one obtains from them remain valid even for quantum (and post-quantum) generalizations of the notion of a causal model.Comment: Minor final corrections, updated to match the published version as closely as possibl
    • …
    corecore