Miscellaneous (problem 7)
Statement
We know that the following sub-modularity property of the entropy is true: if and are independent, real-valued random variables, then
We consider a conjecture relating to quantifying the gap (RHS - LHS) of the above inequality. The conjecture is the following: If , , and are i.i.d. with a given finite variance, is the gap minimized by Gaussians?
This would have an implication for the entropic CLT: it would imply that if is the normalized sum that appears in the CLT, then
which suggests that the sequence in the entropic CLT is not just decreasing (as shown by ABBN) but also convex, where , i.e.\ it is the relative entropy to the mean- and variance-matched Gaussian.
Sergey Bobkov suggested the following follow-up question. If and are random variables with , then . Moreover, implies . This is a special case of Cramer (1937). The question is, how do we prove Cramer (1937) using information-theoretic techniques?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.