English
Related papers

Related papers: Logarithmic Asymptotic Relations Between $p$-Value…

200 papers

Given two random variables $X$ and $Y$, an operational approach is undertaken to quantify the ``leakage'' of information from $X$ to $Y$. The resulting measure $\mathcal{L}(X \!\! \to \!\! Y)$ is called \emph{maximal leakage}, and is…

Information Theory · Computer Science 2018-07-23 Ibrahim Issa , Aaron B. Wagner , Sudeep Kamath

In data science, it is often required to estimate dependencies between different data sources. These dependencies are typically calculated using Pearson's correlation, distance correlation, and/or mutual information. However, none of these…

Statistics Theory · Mathematics 2015-06-03 Rahul Agarwal , Pierre Sacre , Sridevi V. Sarma

The achievable error-exponent pairs for the type I and type II errors are characterized in a hypothesis testing setup where the observation consists of independent and identically distributed samples from either a known joint probability…

Information Theory · Computer Science 2018-09-19 Amos Lapidoth , Christoph Pfister

Multiple testing has been a popular topic in statistical research. Although vast works have been done, controlling the false discoveries remains a challenging task when the corresponding test statistics are dependent. Various methods have…

Statistics Theory · Mathematics 2022-07-05 Meng Mei , Tao Yu , Yuan Jiang

A simple proof is given for the monotonicity of entropy and Fisher information associated to sums of i.i.d. random variables. The proof relies on a characterization of maximal correlation for partial sums due to Dembo, Kagan and Shepp.

Information Theory · Computer Science 2016-10-14 Thomas A. Courtade

This article proposes a new method to estimate an existing mutual information based dependence measure using histogram density estimates. Finding a suitable bin length for histogram is an open problem. We propose a new way of computing the…

Information Theory · Computer Science 2015-09-15 Namita Jain , C. A. Murthy

This paper considers the estimation of Shannon entropy for discrete distributions with countably infinite support. While minimax rates for finite-support distributions are established, infinite-support distributions present distinct…

Statistics Theory · Mathematics 2025-12-03 Octavio César Mesner

We study inference with a small labeled sample, a large unlabeled sample, and high-quality predictions from an external model. We link prediction-powered inference with empirical likelihood by stacking supervised estimating equations based…

Methodology · Statistics 2025-12-19 Guanghui Wang , Mengtao Wen , Changliang Zou

We derive a connection between performance of estimators the performance of the ideal observer on related detection tasks. Specifically we show how Shannon Information for the task of detecting a change in a parameter is related to the…

Information Theory · Computer Science 2019-07-24 Eric Clarkson

In randomized experiments with noncompliance, tests may focus on compliers rather than on the overall sample. Rubin (1998) put forth such a method, and argued that testing for the complier average causal effect and averaging permutation…

Methodology · Statistics 2016-02-23 Laura Forastiere , Fabrizia Mealli , Luke Miratrix

Constraint-based causal discovery algorithms utilize many statistical tests for conditional independence to uncover networks of causal dependencies. These approaches to causal discovery rely on an assumed correspondence between the…

Machine Learning · Computer Science 2025-04-18 Bijan Mazaheri , Jiaqi Zhang , Caroline Uhler

Given independent samples generated from the joint distribution $p(\mathbf{x},\mathbf{y},\mathbf{z})$, we study the problem of Conditional Independence (CI-Testing), i.e., whether the joint equals the CI distribution…

Machine Learning · Statistics 2018-06-27 Rajat Sen , Karthikeyan Shanmugam , Himanshu Asnani , Arman Rahimzamani , Sreeram Kannan

Testing effect size homogeneity is an essential part when conducting a meta-analysis. Comparative studies of effect size homogeneity tests in case of binary outcomes are found in the literature, but no test has come out as an absolute…

Methodology · Statistics 2022-03-11 Osama Almalik

The persistent mutual information (PMI) is a complexity measure for stochastic processes. It is related to well-known complexity measures like excess entropy or statistical complexity. Essentially it is a variation of the excess entropy so…

Mathematical Physics · Physics 2012-10-19 Peter Gmeiner

We consider a Bayesian problem of estimating of probability of success in a series of conditionally independent trials with binary outcomes. We study the asymptotic behaviour of differential entropy for posterior probability density…

Information Theory · Computer Science 2015-07-30 Mark Kelbert , Pavel Mozgunov

The participation coefficient is a widely used metric of the diversity of a node's connections with respect to a modular partition of a network. An information-theoretic formulation of this concept of connection diversity, referred to here…

Physics and Society · Physics 2023-07-25 Pavle Cajic , Dominic Agius , Oliver M. Cliff , James M. Shine , Joseph T. Lizier , Ben D. Fulcher

We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of information theoretic quantities from data uncovers…

Quantitative Methods · Quantitative Biology 2007-07-13 Ilya Nemenman

It is well known that there is no direct one-to-one relation between $p$-values and likelihood ratios or Bayes factors, since their relation crucially involves the sample size $n$. We investigate their (asymptotic) relation in a…

Statistics Theory · Mathematics 2026-03-23 Wouter Kager , Ronald Meester

Let $X$, $Y$ be two correlated discrete random variables. We consider an estimation of $X$ from encoded data $\varphi(Y)$ of $Y$ by some encoder function $\varphi(Y)$. We derive an inequality describing a relation of the correct probability…

Information Theory · Computer Science 2018-12-26 Yasutada Oohama

We investigate the sample complexity of mutual information and conditional mutual information testing. For conditional mutual information testing, given access to independent samples of a triple of random variables $(A, B, C)$ with unknown…

Data Structures and Algorithms · Computer Science 2025-06-05 Jan Seyfried , Sayantan Sen , Marco Tomamichel