Past Program Activities

Optimality and large-scale learning under local privacy
Speaker: John Duchi (Stanford)
Apr. 17, 2019
Program: Data Privacy: Foundations and Applications
Colouring locally sparse graphs via the hard-core model
Speaker: Ewan Davies, Simons Institute
Apr. 17, 2019
Program: Geometry of Polynomials
Ground states and Hyperuniformity properties for models of interacting gas. 
Speaker: Shirshendu Ganguly, UC Berkeley
Apr. 17, 2019
Program: Geometry of Polynomials
Privacy and Statistical Inference for Social Science Data (Data Privacy Reading Group)
Apr. 16, 2019
Program: Data Privacy: Foundations and Applications
Google Talks Field Trip
Apr. 5, 2019
Program: Data Privacy: Foundations and Applications
Next mini course: McMullen’s polytope algebra
Speaker: Raman Sanyal
Apr. 4, 2019
Program: Geometry of Polynomials
Differentially Private Learning of Geometric Concepts
Speaker: Uri Stemmer (Ben Gurion University)
Apr. 3, 2019
Program: Data Privacy: Foundations and Applications
Modified log-Sobolev inequalities for strongly log-concave distributions *starts at 10:30 a.m. sharp*
Speaker: Heng Guo
Apr. 3, 2019
Program: Geometry of Polynomials
Privacy and Statistical Inference for Social Science Data (Data Privacy Reading Group)
Apr. 2, 2019
Program: Data Privacy: Foundations and Applications
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs *starts at 10:30 a.m. sharp*
Speaker: Charles Anthony Carlson (University of Colorado, Boulder)
Mar. 27, 2019
Program: Geometry of Polynomials

Pages