A reminder that the February 15th deadline is approaching (see https://theorydish.blog/2018/12/18/2019-godel-prize/). It is safe to assume that the paper you are excited [...]
Guest post by Amit Daniely and Roy Frostig. For years now—especially since the landmark work of Krishevsky et. al.—learning deep neural networks has been a method of [...]
If I write a post and the blog aggregator is down, does it still make a sound? The call for nomination for the 2019 Gödel Prize is out and the deadline is February [...]
Our first TOCA-SV meeting of the academic year is coming up this Friday. Details are here, please come by if you are around. This time we will feature Shafi Goldwasser for [...]
Over the summer, the Simons Institute ran a short program (a “cluster”) on Algorithmic Fairness, which I briefly discuss: here. This was only one instance of a [...]
Another round of technology leaders testifying in Congress last week brought about another round of complaints about the excessive power that “technologists” wield over [...]
Manolis Zampetakis and I are organizing a workshop at FOCS on the complexity of total search problems. Looking for a needle that you know is in the haystack Search [...]
A reflection piece from Scarlett Sozzani, a member of the community. We will be happy to publish additional posts (anonymously or otherwise) on the subject. By Scarlett [...]
Costis Daskalakis received the Nevanlinna Prize last week for his groundbreaking results on computational complexity of Nash equilibrium and mechanism design for multi-unit [...]
I was excited to see “Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time” by Chakraborty, Das, Goldenberg, Koucky, and Saks in this [...]