Program
Sunday and Moday, December 29th, 2019-January 3d, 2020
Check Point Building - Senate Building (Jaglom) - Steinhardt Museum
Sunday and Moday, December 29th, 2019-January 3d, 2020
Check Point Building - Senate Building (Jaglom) - Steinhardt Museum
Sunday, December 29th,
Location: Check Point Building Room 00109:00 - 09:30 Gathering and Coffee Break
09:30 - 9:45 opening
9:45-10:45 Leslie Valiant (Harvard ): What Needs to be Added to Machine Learning?
10:45 - 11:45 Vijay Vazirani (University of California, Irvine): Matching is as Easy as the Decision Problem, in the NC Model
11:45-12:15 Coffee Break
12:15 - 13:15 Ran Raz (Princeton): Learning Fast Requires Good Memory: Time-Space Tradeoff Lower Bounds for Learning
13:15 - 14:30 Lunch
14:30 - 15:30 Oded Regev (NYU): Continuous LWE and robust machine learning
15:30 - 15: 50 Coffee Break
15:50-16:50 Elchanan Mossel (MIT): Simplicity and Complexity of Belief Propagation
Monday, December 30th,
Location: Auditorium Jaglom, Senate Building09:00 - 09:30 Gathering and Coffee Break
09:30 - 10:30 Christos Papadimitriou (Columbia): Language, Brain, and Computation
10:30 - 11:30 Shafi Goldwasser (UC Berkeley): Algorithms and the Law
11:30-12:00 Coffee Break
12:00 - 13:00 Omer Reingold (Stanford University): Computer Science Foundations of Algorithmic Fairness
13:00 - 14:30 Lunch
14:30 - 15:30 Subhash Khot (NYU): Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem
15:30 - 15:50 Coffee Break
15:50-16:50 James R. Lee (University of Washington): Online learning, competitive analysis, and the shadows of gradient descent
16:50-17:00 Concluding Remarks
Tuesday, December 31st
Location: Steinhardt Museum of Natural History08:30 Registration & Coffee
09:15 Vinod Vaikuntanathan (MIT): Extracting Randomness from Extractor-Dependent Sources
10:00 Shai Halevi (Algorand Foundation): Instances of Practical (F)HE: NFA Encryption, Compressible HE, and PIR
coffee break - 25min
11:05 Jens Groth (Dfinity): Why should I believe that?
11:50 Yael Kalai, (MSR New England): No-Signaling Proofs, Their Applications, and Their Power
lunch - 1.5hrs
14:00 Hugo Krawczyk (Algorand Foundation): Passwords are Cool
14:45 Tal Malkin (Columbia University): Limits to Non-Malleability
coffee break - 25min
15:50 Moni Naor (Weizmann Inst.): Distributed Verifiers: Interactive Proofs and Zero-knowledge
16:35 Yuval Ishai (Technion): Homomorphic Secret Sharing
Tuesday, December 31st
Location: Beith Hatfutsot10:00-10:45 Peter Bartlett (Berkeley): Benign Overfitting
11:00-11:30 Daniel Soudry (Technion): A Function Space View of Bounded Norm Infinite Width ReLU Nets
12:00-12:30 Shai Shalev Shwartz (HUJI): Deep Learning: Success, Failures, and the Borderline
11:30-12:00 Tomer Koren (TAU): Fast and Private Stochastic Convex Optimization
Lunch (on your own)
2:00-2:30 Naftali Tishby (HUJI): The Dual Information Bottleneck
2:30-3:00 Sivan Sabato (BGU): Interactive learning with rich feedback
3:00-3:30 Meir Feder (TAU): On Universal Learning
3:30-3:45 Break
3:45-4:30 Nina Balcan (CMU): Learning Algorithms for Combinatorial Problems
Wednesday, January the 1st
Location: Steinhardt Museum of Natural History9-9:15 Opening remarks
9:15-9:50 Tzahi Pilpel : On optimal mutation rates
9:55-10:30 Lilach Hadany: Plasticity in variation and its evolutionary implications
Coffee break 20 min
10:50-11:35 Christos Papadimitriou: On evolution and machine learning
11:40-12:15 Arnon Lotem : Co-evolution of learning and data acquisition mechanisms: a model for cognitive evolution
Lunch 12:30-2:00
2:00-2:35 Yoav Ram: Necessity is the mother of invention
2:40-3:25 Lee Altenberg: Interpretability and Incomprehensibility in the Products of Evolution
Coffee break 20 min
3:45-4:20 Adi Livnat: The role of sex in evolution
4:25-5:10 Leslie Valiant: Evolution as Learning
Thursday, January the 2nd
Location: Steinhardt Museum of Natural History9-9:20 Opening remarks
9:20-10:10 Plenary 1 : Karl Bringmann
10:30-11:20 Plenary 2 : Seth Pettie
11:40-12:30 Plenary 3 : Barna Saha
12:30-2 Lunch (on your own - there are several quick options on campus)
2-2:50 Shorts talks I (Session Chair : Elazar Goldenberg): Debarati Das, Andre Nusser, Pawel Gawrychowski
2:50-3:50 : Break - poster session
5-6: Break - poster session
6-7 Short talks III (Session Chair : Uri Zwick): Yannic Maus, Ohad Trabelsi, Karthik
Friday, January the 3d
Location: Check Point Building, Room 4209:00 - 9:40 Noam Lifshitz (HUJI), The junta method in extremal combinatorics
10 minute break
9:50 - 10:30 Esty Kelman (TAU), Boolean Functions and Their Effective Degree
20 minute break
10:50 - 11:30 Ohad Klein (Bar-Ilan), Locality-Preserving Hashing for Shifts, Noise Sensitivity, and Cryptography
10 minute break
11:40-12:20 Naomi Kirshner (Weizmann), On the l_4 : l_2 ratio of functions with restricted Fourier support
20 minute break
12:40-13:30 Renan Gross (Weizmann), Stochastic processes for Boolean profit + Boolean Zoo