Folks, Two items:
1) The most recent issue of CACM (Aug 2019) has an interesting article on turnstile heavy-hitters for L_p tail-heavy-hitters. It is introduced by a one-page article by Graham Cormode. Apparently, a preliminary version of the article appeared in IEEE FOCS 2016. The article discusses both the CountSketch and CountMin sketch, both of which Jelani mentioned to us, when he visited, that our learning to leverage these data structures might be useful for solving a range of problems similar to what this article talks about: turnstile and tail-heavy hitters. I will have to study the article more closely, but I would need help from you theory guys to figure out a) if this is practical to implement and b) how we could approach it. 2) Since Justin and Edo (I think) are back in town I suggest we all try to make this next Tuesday's Sketches Research meeting. We can certainly discuss this paper among other topics. Cheers, Lee
