I just got an email saying my page proofs are ready for my paper with Alex Dimakis on mobility in gossip algorithms. If I want to make the paper open access, I have to shell out $3000. I think this is in addition to the $110 per page “voluntary” page charges. Now, I’m on the record as being a fan of Open Access, but $3k is a pretty hefty chunk of change! Has anyone else had experience with this?
January 25, 2012
IEEE page charges for Open Access
Posted by Anand Sarwate under Uncategorized | Tags: gossip, information theory, publishing |[3] Comments
January 24, 2012
Some deals from Cambridge
Posted by Anand Sarwate under Uncategorized | Tags: books, communications, information theory |Leave a Comment
Network Information Theory by Abbas El Gamal and Young-Han Kim is out! I saw copies in Young-Han’s office earlier this month when I was visiting San Diego. Having been at UCSD while the book was being written, I can attest to the comprehensiveness, attention to detail, and clarity of the writing. A must-have!
In addition, Cambridge is having a sale — many books for $10 softcover and $20 hardcover. Most of them are not comm/SP/IT related, so you won’t have to spend all of your money… One warning is that the website is INCREDIBLY SLOW and there is no real search interface for the sale, so you have to get through pages of “MRS Symposium Proceedings.” Titles that may be of interest:
- Modern Coding Theory (Richardson and Urbanke),
- Amos Lapidoth’s digital communications book,
- Madhow’s digital comm book,
- a coding theory book by Blahut,
- a Tracey Ho and Desmond Lun’s Network Coding book,
- Owen’s Practical Signal Processing,
and others, including sensor nets titles and miscellaneous wireless comm titles. Just use ENGR11 as the discount code.
January 19, 2012
Linkage
Posted by Anand Sarwate under Uncategorized | Tags: Chicago, food, information theory, ITA2012, probability, puzzles, San Diego, statistics |Leave a Comment
It’s been a while since I’ve posted, and I am going to try to post more regularly now, but as usual, things start out slowly, so here are some links. I’ve been working on massaging the schedule for the 2012 ITA Workshop (registration is open!) as well as some submissions for KDD (a first for me) and ISIT (since I skipped last year), so things are a bit hectic.
Chicago Restaurant Week listings are out, for the small number of you readers who are in Chicago. Some history on the Chicago activities of CORE in the 40s.
Via Andrew Gelman, a new statistics blog.
A paper on something called Avoidance Coupling, which I want to read sometime when I have time again.
Our team, Too Big To Fail, finished second in the 2012 MIT Mystery Hunt. There were some great puzzles in there. In particular, Picture An Acorn was awesome (though I barely looked at it), and Slash Fiction was a lot of fun (and nostalgia-inducing. Ah, Paris!). Erin has a much more exhaustive rundown.
December 23, 2011
Spread spectrum… in spaaaaaaaace…
Posted by Anand Sarwate under Uncategorized | Tags: avcs, engineering, information theory, signal processing, spread-spectrum |Leave a Comment
I saw on the ArXiV earlier this month a paper on interstellar communication by Berkeley’s own David Messerschmitt. I only met him once, really, at my prelim exam oh so many years ago, but I figured I would give it a read. And here you thought spread spectrum was dead…
Prof. Messerschmitt proposes using spread-spectrum because of its combination of interference robustness and detectability. The fundamental assumption is that the receiver doesn’t know too much about the modulation strategy of the transmitter (this is a case of stochastic encoding but deterministic decoding). The choice of wide-band signaling is novel — SETI-related projects have looked for narrowband signals. The bulk of the paper is on what to do at the transmitter:
The focus of this paper is on the choice of a transmitted signal, which directly parallels the receiver’s challenge of anticipating what type of signal to expect. In this we take the perspective of a transmitter designer, because in the absence of explicit coordination it is the transmitter, and the transmitter alone, that chooses the signal. This is significant be- cause the transmitter designer possesses far less information about the receiver’s environment than the receiver designer, due to both distance (tens to hundreds of light-years) and speed-of-light delay (tens to hundreds of years). While the receiver design can and should take into account all relevant characteristics of its local environs and available resources and technology, in terms of the narrower issue of what type of signal to expect the receiver designer must rely exclusively on the perspective of the transmitter designer.
The rest of the paper centers on designing the coding scheme which is robust to any kind of radio-frequency interference (RFI), without assuming any knowledge at the decoder — specific knowledge of the RFI (say, a statistical description) can only enhance detection, but the goal is to be robust against the modeling issues. To get this robustness, he spends a fair bit of time is spent developing isotropic models for noise and coding (which should be familiar to information theorists of a Gaussian disposition) and then reduces the problem to looking for appropriate time and bandwidth parameters.
This is definitely more of a “communication theory” paper, but I think some of the argument could be made clearer by appeals to some things that are known in information theory. In particular, this communication problem is like coding over an AVC; the connection between spread-spectrum techniques and AVCs has been made before by Hughes and Thomas. However, translating Shannon-theoretic ideas from AVCs to concrete modulation schemes is a bit messy, and some kind of translation is needed. This paper doesn’t quite “translate” but it does bring up an interesting communication scenario : what happens when the decoder only has a vague sense of your coding scheme?
November 29, 2011
T-Rex learns information theory
Posted by Anand Sarwate under Uncategorized | Tags: humor, information theory |Leave a Comment
Namely, that continuous variables have infinite entropy and common randomness can be very useful : Unlimited data transmission with only TWO NUMBERS, baby!
November 2, 2011
HGR maximal correlation and the ratio of mutual informations
Posted by Anand Sarwate under Uncategorized | Tags: information theory, probability |[4] Comments
From one of the presentation of Zhao and Chia at Allerton this year, I was made aware of a paper by Elza Erkip and Tom Cover on “The efficiency of investment information” that uses one of my favorite quantities, the Hirschfeld–Gebelein–Rényi maximal correlation; I first discovered it in this gem of a paper by Witsenhausen.
The Hirschfeld–Gebelein–Rényi maximal correlation between two random variables
and
is
where is all real-valued functions such that
and
and
is all real valued functions such that
and
. It’s a cool measure of dependence that covers discrete and continuous variables, since they all get passed through these “normalizing”
and
functions.
The fact in the Erkip-Cover paper is this one:
.
That is, the square of the HGR maximal correlation is the best (or worst, depending on your perspective) ratio of the two sides in the Data Processing Inequality:
.
It’s a bit surprising to me that this fact is not as well known. Perhaps it’s because the “data processing” is happening at the front end here (by choosing ) and not the actual data processing
which is given to you.
October 30, 2011
Banff blog
Posted by Anand Sarwate under Uncategorized | Tags: Bayesians, conferences, information theory, probability, statistics |Leave a Comment
I figured I would blog about this week’s workshop at Banff in a more timely fashion. Due to the scheduling of flights out of Calgary, I will have to miss the last day of talks. The topics of people’s presentations varied rather widely, and many were not about the sort of Good-Turing estimator setup. Sometimes it was a bit hard to see how to see how the problems or approaches were related (not that they had to be directly), but given that the crowd had widely varying backgrounds, presenters had a hard time because the audience had to check in a new set of notation or approach for every talk. The advantage is that there were lots of questions — the disadvantage is that people insisted on “finishing” their presentations. By mid-week my brain was over-full, and a Wednesday afternoon hike up Sulphur Mountain was the perfect solution.
October 23, 2011
Banfffffffffffffff
Posted by Anand Sarwate under Uncategorized | Tags: conferences, information theory, probability, statistics |[8] Comments
I’ve just arrived in chilly but beautiful Banff for a workshop on Information theory and statistics for large alphabets. I’m looking forward to it, although I will have to miss the last day due to the timing of flights out of Calgary that get me to Chicago before midnight. My itineraries there and back seem especially perverse : ORD-SEA-YYC and YYC-SFO-ORD. However, thanks to the new gig I have a new laptop with a functional battery so I am doing a bit more busy-work and less New Yorker reading in the plane. I might try to write a bit more about the topics in the workshop — although the topic seems focused, there are a wide range of approaches and angles to take on the problem of estimating probabilities/prevalences in situations where you may not get to see each outcome once. Certainly I hope I can get the journal version of a paper from last year’s Allerton squared away.
October 14, 2011
Allerton 2011
Posted by Anand Sarwate under Uncategorized | Tags: Allerton 2011, consensus, information theory, learning, networking, probability |1 Comment
Despite Yury‘s attempts to get me to “stop blogging,” here is my much-delayed recap of Allerton. Because of moving to TTI-Chicago right after Allerton and then almost immediately shuttling back to UCSD for the iDASH Privacy Workshop, things have been a bit delayed. I could only attend for two days but I wanted to highlight a few interesting talks that I saw. More Allerton blogging was done by Michael Mitzenmacher (part 1, part 2) and a bit by Maxim Raginsky about his talk on causal calculus (since he blogged about it I don’t have to, ha!). The conference has gotten too big and the rooms are too small to hold the audience, so it probably is time to move the thing. We have similar issues at ITA and the 2012 ITA Workshop is moving off campus next year (you heard it here first, folks!)
But here are some interesting talks I saw:
July 30, 2011
Safe travels to ISIT 2011
Posted by Anand Sarwate under Uncategorized | Tags: information theory, travel |[2] Comments
Bon voyage and safe travels to all those headed to St. Petersburg for ISIT 2011. Perhaps Max will blog about it, since I am not going to attend. Or if any of you see Alex, maybe you can convince him to contribute a post or two here…
