Skip to main content

All Questions

Filter by
Sorted by
Tagged with
16 votes
1 answer
397 views

Examples of problems in statistics accessible only using information geometry

I am just curious if there are some examples of problems in statistics that are indeed accessible using information geometry while proofs completely avoiding geometry are unknown. In other words, ...
温泽海's user avatar
  • 269
0 votes
0 answers
85 views

When is a family of distributions "closed" with respect to minimal sufficient statistics?

As in the title, I am interested in understanding how to express the idea that a parametric family of distribution is "closed" with respect to minimal sufficient statistics. Before giving ...
Francesco Bilotta's user avatar
3 votes
0 answers
80 views

Seeking strong bounds on KL-divergence and martingales for a hypothesis-testing inequality

Let's say we have a finite set $\mathcal{O}$ of observations, and let $\mathcal{C}(\Delta\mathcal{O})$ denote the space of closed convex sets of probability distributions. We have two hypotheses which ...
Alex Appel's user avatar
2 votes
0 answers
92 views

Construct a Bregman divergence from Wasserstein distance

I was wondering whether one has studied the Bregman divergence arising from a squared Wasserstein distance. More precisely, let $\Omega\subset \mathbb{R}^d$ be a compact set and $c\in \Omega\times \...
John's user avatar
  • 503
0 votes
1 answer
107 views

What's the lower bound for this quantity?

Suppose $p$ is a discrete distribution with $n$ values and the random variable $x$ satisfies $\mathbb{E}_p[x] = 0$ and $|x| < \infty$. Given $\alpha \in (0,1)$, does there exist a lower bound for ...
Jiacai Liu's user avatar
0 votes
0 answers
52 views

Classifier-specific lower bounds on the misclassification rate in binary classification

Consider a binary classification problem for $(X,Y)$, and let $\hat{f}$ be a proposed classifier. We wish to bound the misclassification rate $P(\hat{f}(X)\ne Y)$. There are many known lower bounds on ...
tim523's user avatar
  • 13
2 votes
0 answers
68 views

What is an efficient non-adaptive group testing scheme if the number of defectives, $d$, grows proportionally to the number of items, $n$?

Suppose that for some $p \in \left(0, 1\right)$ and some $n \in \mathbb{N}$, we have $n$ independent Bernoulli random variables, $X_{1}, X_{2}, \dots, X_{n}$, each with mean $p$. We shall call $X_{1}, ...
Matthew Barber's user avatar
2 votes
1 answer
415 views

Bounding Kullback-Leibler

Suppose we have a probability distribution $P$ on a finite set $S$. We draw $N$ i.i.d. samples according to $P$ and use these samples to define an empirical distribution $R$. We measure the Kullback-...
Bill Bradley's user avatar
  • 3,979
3 votes
0 answers
93 views

Asymptotic approximation of Fisher information matrix for small Gaussian perturbation

Let $$ X=Y/a+b+\epsilon Z, $$ where $Y\sim\operatorname{Poisson}(\lambda)$ and $Z\sim\mathcal N(0,1)$ are independent. Also define $\theta=(\lambda,a,b,\epsilon)$. The Fisher information matrix $$ ...
Aaron Hendrickson's user avatar
1 vote
1 answer
93 views

An inequality relating $\ell_1$ distance of input and output of a Markov krnel

Let $K$ be a Markov kernel from $\mathcal{X}$ to $\mathcal{Y}$, i.e., $K(\cdot|x)$ is a probability measure on $\mathcal{Y}$ for all $x\in \mathcal{X}$. Let $\mu$ and $\nu$ be two probability measures ...
math-Student's user avatar
  • 1,109
1 vote
0 answers
48 views

Sample complexity of estimating a doubly stochastic matrix

Let $P\in\mathbb{R}^{n\times n}$ be a doubly-stochastic matrix. That is: $$P(x,y)\geq 0,\quad \sum_xP(x,y)=1,\quad \sum_yP(x,y)=1.$$ I would like to know if lower and upper bounds on the sample ...
user134977's user avatar
6 votes
2 answers
344 views

Entropy & difference between max and min values of probability mass

Let $X$ be a random variable with probability mass function $p(x) = \mathbb{P}[X = x]$. I know entropy $H(X)$ of $X$ measures the uncertainty of $X$ and a large value of $H(X)$ means $p(x)$ is nearly ...
aest's user avatar
  • 163
4 votes
0 answers
144 views

Exponential families closed under affine transformations

Let $(\Omega,\Sigma,\mu)$ be a probability space and let $\mathcal{M}$ be an exponential family of probability distributions for $\mu$ of the following form: There are $\varphi_1,\dots,\varphi_n:\...
ABIM's user avatar
  • 5,405
2 votes
1 answer
294 views

An inequality in the optimality of Bayes' theorem

$\DeclareMathOperator\Ent{Ent}\newcommand{\prior}{\mathrm{prior}}\newcommand\Data{\mathrm{Data}}$I came across this paper on the optimality of Bayes' theorem https://sinews.siam.org/Portals/Sinews2/...
Chp's user avatar
  • 23
5 votes
1 answer
150 views

Kullback–Leibler chains

The following question was asked and then deleted by the post author: Let $P$ and $Q$ be two probability distributions defined over the same space, with $KL(P \parallel Q) < \infty$. For $\epsilon ...
Iosif Pinelis's user avatar
1 vote
1 answer
135 views

KL-divergence and sub-$\sigma$-algebras

I am trying to understand if the following claim is true: Let $P$, $Q$ be probability measures on $\mathcal{X}$. For any $\sigma$-algebra $\mathcal{G}$, with countably many atoms (sets with $\...
T.T.'s user avatar
  • 13
7 votes
1 answer
1k views

reverse KL-divergence: Bregman or not?

I am having a little trouble getting my head around the two "directions" of the Kullback-Leibler divergence: Definition (Kullback-Leibler divergence) For discrete probability distributions $...
jw7642's user avatar
  • 101
0 votes
0 answers
171 views

A basic property of maximal correlation

Let $𝑋$ and $𝑌$ be random variables. Then the maximal correlation $\rho_{m}(X;Y)$ is defined as: $$\rho_{m}(X;Y):=\max_{f,g}\mathbb{E}[f(X)g(Y)],$$ where the maximization is taken over real-valued ...
Vince_maths's user avatar
1 vote
0 answers
65 views

Normalizing constants preserve metric entropy

Suppose $\mathcal{F}=\left\{f\in L^2([a,b]): 0<\underline{c}\leq f\leq\overline{c} \right\}$. Consider the following transformation $$\tilde{\mathcal{F}} := \left\{\frac{f}{\int f d\mu}: f\in \...
lucaszz's user avatar
  • 11
2 votes
1 answer
199 views

Do enough permutations of an initial set probably cover most permutations?

Fix $\alpha, \epsilon \in(0,1)$. Take $(S_n)_n$ to be any sequence of sets with each $S_n$ containing $ \lceil (n!)^\alpha\rceil$ permutations of $n$ elements. Also build another sequence of sets $(...
Christian Chapman's user avatar
4 votes
1 answer
361 views

Information monotonicity of divergence => function of $f$-divergence

It is well-known that $f$-divergences defined on $\mathcal P(\mathcal X)$ where $\mathcal X$ is a measure space with $\sigma$-algebra $\mathcal B$ satisfy the property of information monotonicity: ...
Lance's user avatar
  • 203
1 vote
0 answers
212 views

A new notion of probability coupling

Let $X$ and $Y$ be two discrete random variables distributed according to $\mu$ and $\nu$, respectively. Consider the following optimization problems $$\inf_{\pi\in \Pi(\mu, \nu)}\Pr(X\neq Y),$$ ...
math-Student's user avatar
  • 1,109
6 votes
1 answer
527 views

Can information be extracted more precisely using more random trials?

Write $n$ iid draws of $(x,y)$ as $(x^n, y^n)$. Fix $R\in (0,H(x))$. What is the min of $n^{-1}H(y^n|f(x^n))$ over maps $f$ with range $\lbrace 1,\dots,\exp nR\}$, taking $n\to \infty$?
Christian Chapman's user avatar
4 votes
1 answer
312 views

Given three distributions p, q and h. If KL(p||q) is large enough and KL(q||h) is small enough, does there exist a number N such that KL(p||h)>N?)

Given three distributions $p, q$ and $h$, assume we know that the Kullback-Leibler divergence obeys $KL(p\Vert q)$ is large enough, say $KL(p\Vert q) > M$ where $M$ is large enough, and $KL(q\Vert ...
user1388672's user avatar
3 votes
1 answer
167 views

Maximal correlation and independence

Let $X$ and $Y$ be random variables. Then the maximal correlation $\rho_m(X;Y)$ is defined as $$ \rho_m (X;Y) := \max_{(f(X),g(Y))\in S} \mathbb{E} [f(X)g(Y)] $$ where $S$ is the collection of pairs ...
poiuy's user avatar
  • 33
4 votes
1 answer
839 views

A balls into bins problem with combinatorial constraints

We are given $m$ balls and $n$ bins, with $m \ge n$. Each bin can contain at most $c$ balls (we assume that $c$ is an even integer). In a sequential fashion, at each time step, one ball is placed into ...
Penelope Benenati's user avatar
1 vote
1 answer
105 views

What is the distribution of a Cartesian power of a collection of iid uniform points? (renewed)

The following question was asked recently at https://mathoverflow.net/questions/326631/what-is-the-distribution-of-a-cartesian-power-of-a-collection-of-iid-uniform-poi : Take a rectangle with ...
Iosif Pinelis's user avatar
7 votes
1 answer
231 views

Relation between the two possible KL divergences of two distributions

Given that I know $$D\left(P\parallel Q\right)<\alpha,$$ can I say anything about $D\left(Q\parallel P\right)$ in terms of an upper bound on it? Also, given this upper bound on $D\left(P\parallel ...
Student88's user avatar
  • 503
3 votes
1 answer
355 views

Upper bounding the start of a distribution's CDF, given bounds on first moments

Take nonnegative random variables $X$ whose first $K$ moments have bounds: $\mu^k\leq E[X^k]\leq c\mu^k$ for each $k=1,\dots,K$. In this case what is an upper bound for $P(X\leq O(\mu))$? I am ...
Christian Chapman's user avatar
3 votes
0 answers
178 views

Partitioning the coupons collected in the classical coupon collector's problem

Suppose that there is an urn containing $n$ different coupons, from which $m$ coupons are being collected, equally likely, with replacement. Let $C(m)$ be the whole set of the $m$ collected coupons. ...
Penelope Benenati's user avatar
3 votes
1 answer
196 views

Uniform Convergence for Vectors

$\textbf{Problem statement:}$ Let $\mathcal H:\mathcal X \rightarrow \{0,1\}$ be a class of Boolean functions for $\mathcal X \subset \mathbb R^n$, and let the VC Dimension of $\mathcal H$ be $VC_{...
AvidLearner's user avatar
8 votes
2 answers
4k views

Lower bounds on Kullback-Leibler divergence

This was originally a question on Cross Validated. Are there any (nontrivial) lower bounds on the Kullback-Leibler divergence $KL(f\Vert g)$ between two measures / densities? Informally, I am ...
JohnA's user avatar
  • 710
1 vote
1 answer
146 views

Conformal prediction for the case of single tailed events

I'll start with a motivating example and only then proceed to the question. Consider a list of total packages of milk that were purchased on 9 consecutive days on a given store, $z_1,\ldots,z_9 = 1,...
mvc's user avatar
  • 153
2 votes
0 answers
149 views

Min Max Equality in Information Theory

Let $\mathcal{Y}$ and $\mathcal{X}$ be finite sets and let $Q_Y$ be a fixed probability mass function on $\mathcal{Y}$. Also, let $P_{X | Y}$ be some fixed conditional distribution on $\mathcal{X} \...
R.G.'s user avatar
  • 121
6 votes
1 answer
2k views

Minimizing KL divergence: the asymmetry, when will the solution be the same?

The KL divergence between two distribution $p$ and $q$ is defined as $$ D( q \| p)\int q(x)\log \frac{q(x)}{p(x)} dx $$ and is known to be asymmetry: $D(q\|p)\neq D(p\|q)$. If we fix $p$ and try to ...
Sung-En Chiu's user avatar
14 votes
1 answer
3k views

How is the "conformal prediction" conformal?

The question is clarified by Prof.V.Vovk. See his answer below for discussion. Recently, early works of Gammerman, Vanpnik and Vovk[4] are rediscovered by Wasserman et.al[1] and proposed it as a ...
Henry.L's user avatar
  • 8,071
2 votes
1 answer
269 views

Distribution-free statistics on compact Lie groups

(Cross-listed from the math stackexchange) Let $(X_i)_{i=1}^n$ be iid random variables with joint cdf $F$. Recall that the empirical distribution function is: $$ F_n(x) = \frac{1}{n} \sum_{i=1}^n \...
Daniel Miller's user avatar
3 votes
0 answers
158 views

How are these two multi-armed bandit problems similar?

I am reading the multi-armed bandit survey by Bubeck and Bianchi. This question is for the lower bound section (2.3) of the survey. Let us define Kullback-Leibler divergence $kl(p, q) = p \log \frac{p}...
Shishir Pandey's user avatar
4 votes
1 answer
203 views

Can samples be compressed?

The Fisher information of a random variable $Y$ about a parameter $\theta$ upon which the probability of $Y$ depends is: $\mathcal{I}_Y(\theta)= -E\left[\left.\strut \frac{\partial^2}{\partial \theta^...
Daniel Moskovich's user avatar
4 votes
0 answers
573 views

An inequality involving conditional variance and its connection to information theory

Given absolutely continuous random variables $(X, Y)$ with joint distribution $P_{XY}$, we construct $Z:=\sqrt{\gamma} Y+N_\mathsf{G}$ where $N_\mathsf{G}\sim N(0, 1)$ and is independent of $(X,Y)$ ...
math-Student's user avatar
  • 1,109
3 votes
0 answers
698 views

How does Jensen Shannon divergence and KL divergence correlate?

I am wondering if there is way to derive the correlation between Jensen Shannon divergence and KL divergence for two distributions: P and Q, in order to show that if JSD(P,Q) decreases, KLD(P,Q) ...
Jack Cheng's user avatar
2 votes
1 answer
250 views

An Inequality Regarding the Squared Conditional Variance

Given absolutely continuous random variables $(X, Y)$ with joint distribution $P_{XY}$, we construct $Z:=\sqrt{\gamma} Y+N_\mathsf{G}$ where $N_\mathsf{G}\sim N(0, 1)$ and is independent of $(X,Y)$. ...
math-Student's user avatar
  • 1,109
1 vote
1 answer
494 views

Do there exist random variables that force transitivity of dependence? [closed]

In general, statistical dependence is not transitive. If $Y$ and $X_{1}$ are dependent, and $Y$ and $X_{2}$ are dependent, then $X_{1}$ and $X_{2}$ are NOT necessarily dependent. However, in some ...
Julian Byrnes's user avatar
6 votes
0 answers
578 views

Maximal Correlation versus Correlation Coefficient When one RV is Gaussian

Let a pair of random variables $(X,Y)$ be continuous random variables (i.e., they both have density with respect to Lebesgue measure) with joint distribution $P_{XY}$. The maximal correlation $\rho_m(...
math-Student's user avatar
  • 1,109
2 votes
1 answer
160 views

Do product distributions (or graph products) eventually cluster as more products are taken?

Say we have a joint distribution on a finite alphabet $\mathcal{X}\times \mathcal{Y}$. It could be a communication link where we want to send a random message $X$ over a channel, but it gets garbled ...
Christian Chapman's user avatar
1 vote
0 answers
438 views

Chain rule for maximal correlation

Let a pair of random variables $(X,Y)$ be defined over finite alphabet $\mathcal{X}\times \mathcal{Y}$ with joint distribution $P_{XY}$. The maximal correlation $\rho(X;Y)$ between $X$ and $Y$ is ...
math-Student's user avatar
  • 1,109
1 vote
1 answer
202 views

An inequality for Maximal Correlation over a Markov Chain

Let a pair of random variables $(X,Y)$ be defined over finite alphabet $\mathcal{X}\times \mathcal{Y}$ with joint distribution $P_{XY}$. The maximal correlation $\rho(X;Y)$ between $X$ and $Y$ is ...
math-Student's user avatar
  • 1,109
8 votes
1 answer
3k views

An Inequality of KL Divergence

Given two probability distributions $P$ and $Q$ defined over a finite set $\mathcal{X}$, one can define the KL divergence between $P$ and $Q$ as $$D(P||Q):=\sum_{x\in \mathcal{X}}P(x)\log\frac{P(x)}{...
math-Student's user avatar
  • 1,109
9 votes
1 answer
385 views

A Generalized Version of Maximal Correlation and Hypercontractivity of Conditional Expectation Operator

Given a pair of random variables $(X,Y)$ over a product space $\mathcal{X}\times \mathcal{Y}$, the maximal correlation coefficient is defined as $$\rho_2(X;Y):=\sup\frac{\mathbb{E}[f(X)g(Y)]}{||f||_2||...
math-Student's user avatar
  • 1,109
3 votes
1 answer
306 views

Mutual information decrease with coarse-graining

Let $X,A,Y,B,C,D$ be random binary variables. $D$ is independent from $X,A,C$ and $C$ is independent from $Y,B,D$. Is it true that: If $I(Y:B|D=0)\leq \epsilon$ then $I(X\oplus Y:A\oplus B|C=0,D=0)\...
Issam Ibnouhsein's user avatar