# The strong converse for the MAC summary

here are the four posts I made on the strong converse for the MAC:

1. Part 1 : the setup and Fano distributions
2. Part 2 : choosing a non-product subcode
3. Part 3 : a wringing lemma
4. Part 4 : almost-independence via wringing

# The strong converse for the MAC, part 4

In the previous post we saw how to take two distributions ${P}$ and ${Q}$ on ${\mathcal{X}^n}$ that are close and show that there must be some fixed values ${\{ \bar{x}_{t_i} : i = 1, 2, \ldots, k\}}$ for individual variables ${\{X_{t_i} : i = 1, 2, \ldots, k\}}$ such that the single letter marginals of ${P}$ and ${Q}$ are close when you condition on ${X_{t_i} = \bar{x}_{t_i}}$.

Corollary 1 Let ${\mathcal{A} \subset \{1,2, \ldots, M\} \times \{1,2,\ldots,N\}}$ and suppose ${|\mathcal{A} \ge (1 - \lambda^{\ast}) MN}$ and let ${\{(u_i,v_j, D_{ij}) : (i,j) \in \mathcal{A}\}}$ be a code for the MAC with maximal error probability ${\lambda}$. Then for an ${0 < \gamma < c = \frac{\lambda^{\ast}}{1 - \lambda^{\ast}}}$ and ${0 \le \epsilon < }$ there exist ${\{t_1,\ldots, t_k\}}$ for ${k \le c/\gamma}$ and fixed values ${\{(\bar{x}_{t_i},\bar{y}_{t_i})\}}$ such that the subcode formed by $\displaystyle \bar{\mathcal{A}} = \{ (i,j) : u_{i,t_i} = \bar{x}_{t_i}, v_{i,t_i} = \bar{y}_{t_i} \}$

has maximal error ${\lambda}$, $\displaystyle \begin{array}{rcl} |\bar{\mathcal{A}}| &\ge& \epsilon^k |\mathcal{A}| \\ \bar{M} &=& | \{ u_i : (i,j) \in \bar{\mathcal{A}} \} | \ge \epsilon^{k} M \\ \bar{N} &=& | \{ v_i : (i,j) \in \bar{\mathcal{A}} \} | \ge \epsilon^{k} N \end{array}$

and for all ${x \in \mathcal{X}}$ and ${y \in \mathcal{Y}}$ and all ${t = 1,2, \ldots, n}$, $\displaystyle \begin{array}{rcl} \mathbb{P}( \bar{X}_t = x, \bar{Y}_t = y ) &\ge& (1 + \gamma) \mathbb{P}(\bar{X}_t = x) \mathbb{P}(\bar{Y}_t = y) - \gamma \\ & & \qquad - |\mathcal{X}||\mathcal{Y}|\epsilon \\ \mathbb{P}( \bar{X}_t = x, \bar{Y}_t = y ) &\le& \max\left\{ (1 + \gamma) \mathbb{P}(\bar{X}_t = x) \mathbb{P}(\bar{Y}_t = y), \epsilon \right\}, \end{array}$

where ${\bar{X}^n}$ and ${\bar{Y}^n}$ are distributed according to the Fano distribution of the subcode.

That is, we can condition on some values at ${\{t_i\}}$ and (a) not lose too much rate for each user and (b) the joint distribution of the subcode is almost a product distribution. Remember, the Fano distribution is just the uniform distribution on the codewords of the subcode induced by ${\bar{\mathcal{A}}}$.

So how does this result follow from the Wringing Lemma discussed before? Let ${P}$ be the Fano distribution of the original code, and let ${Q}$ be the product distribution induced by the marginal distributions on the code: $\displaystyle \begin{array}{rcl} P_{X^n Y^n}(u_i,v_j) &=& \frac{1}{|\mathcal{A}|} \\ Q_{X^n Y^n}(u_i,v_j) &=& P_{X^n}(u_i) P_{Y^n}(v_j). \end{array}$

Then just churn through the implications of the Lemma.

So putting the whole argument together, we start first with an ${(n,M,N,\bar{\lambda})}$ code for the MAC and then we get a subcode from pairs ${\mathcal{A}}$ defined before. This code satisfies rate bounds which look almost like what we want — they have sums of mutual informations like ${I(X_t ; Z_t | Y_t)}$ except that ${(X^n,Y^n)}$ are distributed uniformly on ${\mathcal{A}}$, so they are not independent. We can then apply the corollary above to get that there is a sub-subcode indexed by ${\bar{\mathcal{A}}}$ for which the Fano distribution on ${\bar{\mathcal{A}}}$ is almost independent, and for which we have not lost too much rate. Now we have rate bounds with a sum of terms ${I(\bar{X}_t ; \bar{Z}_t | \bar{Y}_t)}$ where the inputs are almost independent, so then we can use the continuity of mutual information and entropy to get upper bounds with sums of ${I(\hat{X}_t ; \hat{Z}_t | \hat{Y}_t)}$ where the inputs are finally independent.

There are three steps here — first you find a subcode with more uniform error properties but dependence between the codewords, then you wring out the dependence without giving up too much rate, and finally you substitute in the independent inputs without giving up too much rate. And that’s the value of wringing arguments: in order to get the nice structure from the subcode with ${\mathcal{A}}$ you have to get back the independence of inputs that you lost.

# Patal Bhaji

Now that I am not traveling around as much and stressed out about job decisions, I have gotten back to cooking. I miss my mother’s cooking and frequently call home to check on recipes (to the point where my mother’s first question is sometimes “what do you want to cook today?”). I figured I’d post some recipes here occasionally. This recipe is for Patal Bhaji, a Maharashtrian comfort dish. Although there are a lot of ingredients, most of them are “pantry items,” at least in Indian kitchens.

Alas there are no pictures because it’s been eaten. I made the variety with chana dal because I seem to have a metric ton of chana dal at my apartment.

# The strong converse for the MAC, part 3

This post was written using Luca’s LATEX2WP tool.

The topic of this (late) post is “wringing” techniques, which are a way of converting a statement like “ ${ P(x^n)}$ and ${ Q(x^n)}$ are close” into a statement about per-letter probabilities. Such a statement looks like “we can find some indices and values at those indices such that if we condition on those values, the marginals of ${ P}$ and ${ Q}$ are close.” I’m going to skip straight to the simpler of the two “Wringing Lemmas” in this paper and sketch its proof. Then I’ll go back and state the first one (without proof). There are some small typos in the original which I will try to correct here.

Lemma 1 Let ${ P}$ and ${ Q}$ be probability distributions on ${ \mathcal{X}^n}$ such that for a positive constant ${ c}$, $\displaystyle P(x^n) = (1 + c) Q(x^n) \qquad \forall x^n \in \mathcal{X}^n \ \ \ \ \ (1)$

then for any ${ 0 < \gamma < c}$ and ${0 \le \epsilon < 1}$ there exist ${ t_1, t_2, \ldots, t_k \in \{1, 2, \ldots, n\}}$, where $\displaystyle 0 \le k \le c/\gamma$

such that for some ${ \bar{x}_{t_1}, \bar{x}_{t_2}, \ldots, \bar{x}_{t_k}}$, $\displaystyle P(x_t | \bar{x}_{t_1}, \bar{x}_{t_2}, \ldots, \bar{x}_{t_k}) \le \max\{ (1 + \gamma) Q(x_t | \bar{x}_{t_1}, \bar{x}_{t_2}, \ldots, \bar{x}_{t_k}), \epsilon \}$

for all ${ x_t \in \mathcal{X}}$ and all ${ t = 1, 2, \ldots, n}$. Furthermore, $\displaystyle P(\bar{x}_{t_1}, \bar{x}_{t_2}, \ldots, \bar{x}_{t_k}) \ge \epsilon^{k}.$

The proof works pretty mechanically. Fix a ${\gamma}$ and ${\epsilon}$. Suppose that the conclusion doesn’t hold for ${k = 0}$. Then there is a ${t_1}$ and ${\bar{x}_{t_1}}$ such that $\displaystyle (1 + c) Q(\bar{x}_{t_1}) \ge P(\bar{x}_{t_1}) \ge \max((1 + \gamma) Q(\bar{x}_{t_1}),\epsilon),$

where the first bound is from the assumption and the second because the conclusion doesn’t hold. Then we have ${P(\bar{x}_{t_1}) > \epsilon}$. Now dividing (1) by ${P(\bar{x}_{t_1})}$ and using the lower bound on ${P(\bar{x}_{t_1})}$ we get for all ${x^n \in \mathcal{X}^n}$, $\displaystyle P(x^n | \bar{x}_{t_1}) \le \frac{1 + c}{1 + \gamma} Q(x^n | \bar{x}_{t_1}) \ \ \ \ \ (2)$

Now, either the conclusion is true or we use (2) in place of (1) to find a ${t_2}$ and a ${\bar{x}_{t_2}}$ such that $\displaystyle P(x^n | \bar{x}_{t_1},\bar{x}_{t_2}) \le \frac{1 + c}{(1 + \gamma)^2} Q(x^n | \bar{x}_{t_1},\bar{x}_{t_2}) \ \ \ \ \ (3)$

We can keep going in this way until we get ${(1 + \gamma)^k}$ in the denominator. This yields the condition on ${k}$.

Rather than describe how to apply this to our coding problem, I want to contrast this rather simple statement to the other wringing lemma in the paper, which is a generalization of the lemma developed by Dueck. This one is more “information theoretic” in the sense that it says if the block mutual information is small, then we can find positions to condition on such that the per-letter mutual informations are small too.

Lemma 2 Let ${X^n}$ and ${Y^n}$ be ${n}$-tuples of random variables from discrete finite alphabets ${\mathcal{X}^n}$ and ${\mathcal{Y}^n}$ and assume that $\displaystyle I(X^n; Y^n) \le \sigma.$

Then for any ${ 0 < \delta < \sigma}$ and there exist ${ t_1, t_2, \ldots, t_k \in \{1, 2, \ldots, n\}}$, where $\displaystyle 0 \le k \le 2 \sigma/\delta$

such that for some ${\{ (\bar{x}_{t_i}, \bar{y}_{t_i}) : i = 1 ,2 \ldots, k\}}$, $\displaystyle I(X_t ; Y_t ~|~ (X_{t_i},Y_{t_i}) = (\bar{x}_{t_i}, \bar{y}_{t_i}), i = 1 ,2 \ldots, k) \le \delta.$

for all ${ t = 1, 2, \ldots, n}$. Furthermore, $\displaystyle \mathbb{P}((X_{t_i},Y_{t_i}) = (\bar{x}_{t_i}, \bar{y}_{t_i}), i = 1 ,2 \ldots, k) \ge \left( \frac{\delta}{|\mathcal{X}||\mathcal{Y}| (2 \sigma - \delta)} \right)^{k}.$

This lemma proved in basically the same way as the previous lemma, but it’s a bit messier. Dueck’s original version was the similar but gave a bound on the conditional mutual information, rather than this bound where we condition on particular values. This way of taking a small mutual information and getting small per-letter mutual informations can be useful outside of this particular problem, I imagine.

Next time I’ll show how to apply the first lemma to our codebooks in the converse for the MAC.

Kenji explains the science of no-knead bread. I have to try making some this summer.

A nice post about Punjabi Mexicans in California, a little-known bit of South Asian immigration history in the US.

Detection of correlations is a snazzy title, but they mean something very particular by it. Also, why does everyone hate on the GLRT so much?

I want to see The Trip, especially after watching this clip. (h/t Adam G.)

P. Sainath on civil society in India. (h/t Soumya C.)

# clarification on reviewer incentives

I seem to given the wrong impression (probably due to grumpiness) in the previous post about my views on the value of reviewing. I actually enjoy reviewing – I get a sneak preview of new results and techniques through the review process, and there are often many interesting tidbits. My perspective is skewed by the IEEE Transactions on Information Theory, which has a notoriously lengthy review process. For example, it took 15 months for me to get two reviews of a manuscript that I submitted. One of the top priorities for the IT Society has been to get the time from submission to publication down to something reasonable. That’s the motivation for my question about incentives for timely reviewing. So why should you submit a timely review?

Reviewing is service. Firstly, it’s your obligation to review papers if you submit papers. Furthermore, you should do it quickly because you would like your reviews quickly. This seems pretty fair.

Reviewing builds your reputation. There is the claim that you build reputation by submitting timely and thorough reviews. I think this is a much weaker claim — this reputation is not public, which is an issue that was raised in the paper by Parv and Anant that I linked to earlier. It’s true that the editorial board might talk about how you’re a good reviewer and that later on down the line, an Associate Editor for whom you did a fair bit of work may be asked to write you a tenure letter, but this is all a bit intangible. I’ve reviewed for editors whom I have never met and likely never will meet.

Doing a good review on time is its own reward. This is certainly true. As I said, I have learned a ton from reviewing papers and it has also helped me improve my own writing. Plus, as Rif mentioned, you can feel satisfied that you were true to your word and did a good job.

Isn’t all of this enough? Apparently not. There are a lot of additional factors which make these benefits “not enough.” Firstly, doing service for your intellectual community is good, but this takes you as far as “you should accept reviews if the paper seems relevant and you would be a good reviewer.” I don’t think the big problem is freeloading; people accept reviews but then miss lots of deadlines. Most people don’t bother to say “no” when asked to do a review, leaving the AE (or TPC member) in limbo. There needs to be a way to make saying “no” acceptable and obligatory.

The real issue with reputation-building is that it’s a slow process; the incentive to review a particular paper now is both incremental and non-immediate. One way out would be to hold submitted papers hostage until the authors review another paper, but that is a terrible idea. There should be a way for reviewers to benefit more immediately from going a good and timely job. Cash payouts are probably not the best option…

Finally, the self-satisfaction of doing a good job is a smaller-scale benefit than those from other activities. It is the sad truth that many submitted manuscripts are a real chore to review. These papers languish in the reviewer’s stack because working up the energy to review them is hard and because doing the review doesn’t seem nearly as important as other things, like finishing your own paper, or that grant proposal, etc. The longer a paper sits gathering dust on the corner of your desk, the less likely you are to pick it up. I bet that much more than half the reviews are not even started until the Associate Editor sends an email reminder.

It takes a fair bit of time to review a 47 page 1.5-spaced mathematically dense manuscript, and to do it right you often need to allocate several contiguous chunks of time. These rare gems often seem better spent on writing grant proposals or doing your own research. The rewards for those activities are much more immediate and beneficial than the (secret) approval and (self-awarded) congratulations you will get for writing a really helpful review. The benefits for doing a good timely review are not on the same order as other activities competing for one’s time.

I guess the upshot is that trusting the research community to make itself efficient at providing timely and thorough reviews may not be enough. Finding an appropriate solution or intervention requires looking at some data. What is the distribution of review times? (Cue power-law brou-ha-ha). What fraction of contacted reviewers fail to respond? What fraction of reviewers accept? For each paper, how does length/quality of review correlate with delay? Knowing things like this might help get things back up to speed.