Timeline for Prove or disprove a mutual information inequality
Current License: CC BY-SA 4.0
12 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Apr 5, 2022 at 3:06 | history | bounty ended | CommunityBot | ||
S Apr 5, 2022 at 3:06 | history | notice removed | CommunityBot | ||
S Mar 28, 2022 at 1:27 | history | bounty started | wanderer | ||
S Mar 28, 2022 at 1:27 | history | notice added | wanderer | Draw attention | |
Mar 25, 2022 at 21:56 | comment | added | wanderer | @Steve, I added numerical insights to the question for clarity. It tries to answer your queries. | |
Mar 25, 2022 at 21:55 | history | edited | wanderer | CC BY-SA 4.0 |
Added numerical analysis
|
Mar 25, 2022 at 20:53 | comment | added | Steve | Sorry, maybe my second question was not clear: What I meant was whether you can fix $p$ at the start and remove the $\max_p$ in the inequalities, and whether you have numerical insight as to whether this might still hold? | |
Mar 25, 2022 at 14:45 | comment | added | wanderer | @Steve I was wrong when I thought $H(Y)$ remains the same. (I deleted the comment to avoid misinformation). So $Y$ is not the same across different inequalities. | |
Mar 25, 2022 at 14:14 | comment | added | Steve | Thanks! Did you try numerically whether the inequality might hold for all $p$ elementwise or is taking the maximum necessary? | |
Mar 25, 2022 at 13:31 | comment | added | wanderer | $Y$ is not the same since the input arguments are different random variables in each inequality (Different linear combinations of the same $X_i$'s) . Also, $p$ can be different for different inequalities too. Since there is a maximization over $p$. | |
Mar 25, 2022 at 13:16 | comment | added | Steve | Could you perhaps clarify whether the variable $Y$ is the same in each display of the inequality or whether it changes depending on the first argument? | |
Mar 25, 2022 at 3:59 | history | asked | wanderer | CC BY-SA 4.0 |