With election on my mind, and constantly looking at polls and predictions, I thought I would look a little more into how election models are made. (Disclaimer: I am not an expert statistician / pollster and this is based on me trying to read their methodological description as well as looking into results of simulations … Continue reading Digging into election models
Category: Uncategorized
I’m with her (but 4 years too late)
In May 2016, after Donald Trump was elected as the republican nominee for president, I wrote the following blog post. I ended up not publishing it - this has always been a technical blog (and also more of a group blog, at the time). While the damage of a Donald Trump presidency was hypothetical at … Continue reading I’m with her (but 4 years too late)
Full-replica-symmetry-breaking based algorithms for dummies
One of the fascinating lines of research in recent years has been a convergence between the statistical physics and theoretical computer science points of view on optimization problems.`This blog post is mainly a note to myself (i.e., I'm the "dummy" 😃), trying to work out some basic facts in some of this line of work. … Continue reading Full-replica-symmetry-breaking based algorithms for dummies
Understanding generalization requires rethinking deep learning?
Yamini Bansal, Gal Kaplun, and Boaz Barak (See also paper on arxiv, code on gitlab, upcoming talk by Yamini&Boaz, video of past talk) A central puzzle of deep learning is the question of generalization. In other words, what can we deduce from the training performance of a neural network about its test performance on fresh … Continue reading Understanding generalization requires rethinking deep learning?
ITC 2021 (guest post by Benny Applebaum)
Following last year’s successful launch, we are happy to announce the second edition of the conference on Information-Theoretic Cryptography (ITC). The call for papers for ITC 2021 is out, and, to cheer you up during lockdowns, we prepared a short theme song https://youtu.be/kZT1icVoTp8 Feel free to add your own verse 😉 The submission deadline is … Continue reading ITC 2021 (guest post by Benny Applebaum)
SIGACT research highlights – call for nominations
TL;DR: Know of a great recent paper that should be highlighted to the theory community and beyond? Email a nomination to sigact.highlights.nominations@outlook.com by October 19th. The goal of the SIGACT Research Highlights Committee is to help promotetop computer science theory research via identifying results that are ofhigh quality and broad appeal to the general computer … Continue reading SIGACT research highlights – call for nominations
Highlights of Algorithms (HALG) -free – Aug 31- Sep 2
[Guest post by Yossi Azar] The 5th Highlights of Algorithms conference (HALG 2020) will take place Aug 31- Sep 2, 2020. http://highlightsofalgorithms.org/ The Highlights of Algorithms conference is a forum for presenting the highlights of recent developments in algorithms and for discussing potential further advances in this area. The conference will provide a broad picture … Continue reading Highlights of Algorithms (HALG) -free – Aug 31- Sep 2
Ryan O’Donnell’s “TCS Toolkit” and other resources
When I was in grad school a common advice for beginning grad students was to leaf through the (paper) STOC or FOCS proceedings to see papers that you are interested in. This is still a decent advice (and requires less physical strength these days 🙂 ) but papers are not always the best source for … Continue reading Ryan O’Donnell’s “TCS Toolkit” and other resources
CFP: Symposium on Simplicity in Algorithms (SOSA)
[Guest post by Valerie King. TL;DR SOSA 21 will take place jointly with SODA 21. To submit register by August 12, paper deadline August 19.] Call for Papers: Registration deadline August 12, 2020 3rd SIAM Symposium on Simplicity in Algorithms (SOSA)January 11-12, 2021Alexandria, Virginia, U.S.(Held jointly with SODA 2021)Symposium on Simplicity in Algorithms (SOSA) is … Continue reading CFP: Symposium on Simplicity in Algorithms (SOSA)
Simons institute lectures on analysis of Boolean functions
(Does it still make sense to blog such announcements or is these days Twitter the only way to go about this? Asking for a friend 🙂 ) Prasad Raghavendra and Avishay Tal have organized a sequence of 6 lectures on some of the exciting recent advances in analysis of Boolean functions. Lecture Series: Advances in … Continue reading Simons institute lectures on analysis of Boolean functions
