Greetings from Berkeley! We are gearing up for a busy wrap-up of the spring semester, with five back-to-back workshop weeks at the Simons Institute...
In this month’s newsletter, we’re highlighting a 2015 talk by Chris Umans on some of the then state-of-the-art approaches to bound the matrix...
Ten years ago, researchers proved that adding full memory can theoretically aid computation. They’re just now beginning to understand the implications...
We are entering the final weeks of a unique semester at the Simons Institute, as in institutions across the world. I’d like to extend a word of appreciation to our program organizers and staff, who have shown exceptional flexibility and innovative spirit, rolling out our research programs in a fully online environment for the first (and hopefully last) time in the Institute’s history.
The objective of the current Simons Institute program on Probability, Geometry, and Computation in High Dimensions is the precise study of high-dimensional phenomena and the ways in which they manifest themselves geometrically, probabilistically and algorithmically. The program brings together mathematicians, statisticians, computer scientists, and physicists to exchange ideas and methods developed in their respective fields and facilitate collaborations on this broad theme.
Greetings from Berkeley, where we are six weeks into two very lively research programs: Theory of Reinforcement Learning and Probability, Geometry, and Computation in High Dimensions. It has been good to see so many of you at our boot camps, workshops, and other events this fall. As you know, we are operating online for now, but we will move to limited on-site convenings as soon as the university permits.
The world of cryptography saw a fundamental breakthrough this August, the beginning of an end for a very exciting period in the area of cryptography, one that began with the construction of candidate indistinguishability obfuscation schemes by Garg et. al. in 2013.