I did catch Greg Wornell’s plenary at SPCOM, which was called **When Bits Absolutely, Positively, Have to be There as Soon as Possible**, a riff on this FedEx commercial, which is older than I am. The talk was on link-aware PHY-layer design– basically looking at how ARQ enables incremental redundancy, and how to do a sort of layered superposition + incremental redundancy scheme in the sequential setting as well as a “multi-path” setting where blocks can arrive out of order. This was really digging into the signal issues in a way that a lot of non-communication engineering information theorists may get squeamish about. The nice thing is that I think the engineering problem is approachable without knowing a lot of heavy-duty math, but still requires some careful analysis.

**Communication and Compression Via Sparse Linear Regression**

*Ramji Venkataramanan*

This was on building codewords and codebooks out of a lower-complexity code dictionary where each codeword is a superposition of columns, one each from groups of size . Thus encoding is where is a sparse vector. I saw a talk by Barron and Joseph from a previous ISIT about this, but the framework extends to rate distortion (achieving the rate distortion function), and channel coding. The main point is to lower the complexity of the code at the expense of the gap to optimal rate — encoding and decoding are polynomial time but the rate gap for rate-distortion goes to zero as . Ramji gave a really nice and clear talk on this — I hope he puts the slides up!

**An Optimal Varentropy Bound for Log-Concave Distributions**

*Mokshay Madiman; Liyao Wang*

Mokshay’s talk was also really clear and excellent. For a distribution on , we can define . The entropy is the expectation of this random variable, and the varentropy is the variance. Their main result is a upper bound on the varentropu of log concave distributions . To wit, . This bound doesn’t depend on the distribution and is sharp if is a product of exponentials. They then use this to prove a universal bound on the deviation of from its expectation, which gives a AEP that doesn’t really assume anything about the joint distribution of the variables except for log-concavity. There was more in the talk, but I eagerly await the paper.

**Event-triggered Sampling and Reconstruction of Sparse Real-valued Trigonometric Polynomials**

*Neeraj Sharma; Thippur V. Sreenivas*

This was on non-uniform sampling where the sampler tries to detect level crossings of the analog signal and samples at that point — the rate may not be uniform enough to use existing nonuniform sampling techniques. They come up with a method for reconstructing signals which are real-valued trigonometric polynomials with a few nonzero coefficients (e.g. sparse) and it seems to work pretty decently in experiments.

**Removing Sampling Bias in Networked Stochastic Approximation**

*Vivek Borkar; Raaz Dwivedi*

In networked stochastic approximation, the intermittent communication between nodes may mean that the system tracks a different ODE than the one we want. By modifying the method to account for “local clocks” on each edge, we can correct for this, but we end up with new conditions on the step size to make things work. I am pretty excited about this paper, but as usual, my notes were not quite up to getting the juicy bits. That’s what paper reading is for.

**On Asymmetric Insertion and Deletion Errors**

*Ankur A. Kulkarni*

The insertion/deletion channel model is notoriously hard. Ankur proposed a new model where ‘s are “indestructible” — they cannot be inserted or deleted. This asymmetric model leads to new asymptotic bounds on the capacity. I don’t really work on this channel model so I can’t get the finer points of the results, but once nice takeaway was that asymptotically, each indestructible in the codeword lets us correct around a deletion more.