Skip to main content
Christian Chapman's user avatar
Christian Chapman's user avatar
Christian Chapman's user avatar
Christian Chapman
  • Member for 14 years, 1 month
  • Last seen this week
comment
Who is Mrs. Gerber?
I heard during an information theory course that Wyner and Ziv ideated the lemma during a stay at Mrs. Gerber's inn.
revised
Loading…
Loading…
comment
How much reduction in expected variance can we get from a single bit?
Is Alice's alphabet restricted to $\{0,1\}$ or can they send any message with Shannon entropy 1? (Not sure if this matters yet)
comment
An inequality of KL Divergence for two different distributions passing through a same channel
I'm guessing that you're trying to formalize a notion similar to this: $${}$$ "$X_1$ and $X_2$ are like $X$, but with different types of noise. $Z$ is a mixing of $X_1$ and $X_2$. There is also some process $Y(\cdot)$ that acts on RVs that live in $\mathcal{X}$. Can I always mix $Z$ so that I learn less about $Y(Z)$ from $Z$ than I learn about $Y(X)$ from $X$?". $${}$$ The answer seems like yes, but what you've written isn't quite the right formalization yet. In particular you need to more closely specify the nature of $X_1$ and $X_2$ (and more cleanly specify the entire problem).
comment
An inequality of KL Divergence for two different distributions passing through a same channel
What's more, as you've written it, the LHS $D(P_{Y|Z}|P_{Y_2})$ is going to be a random variable depending on $Z$ and the RHS is a RV depending on $X$. I'm not sure that this is what you are really after.
comment
An inequality of KL Divergence for two different distributions passing through a same channel
Math_Y, your definitions are too lax. Nothing about X1, X2 enforces that Z resemble or preserves information about X in any way. This leaves the two sides of your desired inequality unrelated.
comment
comment
Do enough permutations of an initial set probably cover most permutations?
I guess I could have meant something by "with high probability"... it could have been that there was a sequence of $S_n$ put together so that the quotient only goes to 1 with probability $f(\alpha,\varepsilon)< 1$.
revised
Loading…
revised
Loading…
comment
Do enough permutations of an initial set probably cover most permutations?
sorry, i misspoke. meant converges "in probability" not "with high probability"
comment
Do enough permutations of an initial set probably cover most permutations?
i didn't mean that in the original post but i guess it is true
Loading…
Loading…
comment
Random variables with no first moment
An argument I believe can be made formal: Your absolute value is going to be the difference of the magnitude of the ones that come out positive from the magnitude of the ones that come out non-positive, or vice-versa. but no matter the selection for which come out positive and which come out negative, the resulting difference has undefined or infinite expected value. from here you can get your limsup to infinity with a large numbers law
comment
How to explain to an engineer what algebraic geometry is?
this engineer you have imagined seems to have a pretty impoverished mind
comment
$\varepsilon$-net of a $d$-dimensional unit ball formed by power set of $V = \{+1, 0 -1\}^d$
Purely out of curiosity where did you find this set $V_{sum}$?
comment
Can we show equivalence of two distributions based on their statistics?
This is related to the moment problem. You need really strong conditions on $f$ and the space of possible distributions.
1
2
3 4 5
13