Yuval Peres: Trace reconstruction for the deletion channel Tuesday, May 2, 2017  4:00pm to 5:00pm Abstract: In the trace reconstruction problem, an unknown string $x$ of $n$ bits is observed through the deletion channel, which deletes each bit with some constant probability $q$, yielding a contracted string. How many independent outputs (traces) of the deletion channel are needed to reconst 

Cynthia Dwork: What's Fair? Tuesday, April 25, 2017  4:00pm to 5:00pm Abstract: Data, algorithms, and systems have biases embedded within them reflecting designers’ explicit and implicit choices, historical biases, and societal priorities. 

Andrea Montanari: The landscape of some statistical problems Wednesday, April 19, 2017  4:30pm to 5:30pm Abstract: Most highdimensional estimation and prediction methods propose to minimize a cost function 

Virginia Vassilevska Williams: Fast distance product of bounded difference matrices with applications to Language Edit Distance and RNAFolding Tuesday, April 11, 2017  4:00pm to 5:00pm Abstract: The distance product of two matrices A and B is the matrix C defined as C[i,j]=min_k A[i,k]+B[k,j]. 

Moni Naor: Whitebox vs. Blackbox Search Problems: A Cryptographic Perspective Tuesday, March 21, 2017  4:00pm to 5:00pm Abstract: Ramsey theory assures us that in any graph there is a clique or independent set of a certain size, roughly logarithmic in the graph size. But how diﬃcult is it to ﬁnd the clique or independent set? 

Irit Dinur: Grassmann agreement testing and the 2:1 conjecture Tuesday, March 14, 2017  4:00pm to 5:00pm Abstract: I will describe the notion of agreement testing, which allows to deduce global structure from local agreement checks. 

Vasilis Syrgkanis: Oracle efficient Learning and Auction Design Tuesday, February 28, 2017  4:00pm to 5:00pm Abstract. We consider the design of online noregret algorithms that are computationally efficient, given access to an offline optimization oracle. 

Nikhil Bansal: A fast polynomial space algorithm for Subset Sum Tuesday, March 7, 2017  4:00pm to 5:00pm Abstract: I will describe an algorithm for the subset sum problem that runs in 2^{0.86n} time and uses polynomial space. Previously, all algorithms with running time less than 2^n used exponential space, and obtaining such a guarantee was open. Our algorithm is based on Floyd's 

Aaron Roth: Quantifying Tradeoffs Between Fairness and Accuracy in Online Learning Wednesday, February 22, 2017  4:00pm to 5:00pm Abstract:


Vitaly Feldman: Lower bounds against convex relaxations via the statistical query complexity Tuesday, February 14, 2017  4:00pm to 5:00pm Abstract: 