Parking Information: There are many visitor parking spots here in front of Building 1950, but please consider carpooling. All entrances to Building 1950 are employee-only; we will have someone to assist visitors into the building here or here. The talks will take place in the "Bodega Bay" meeting room on the first floor of Building 1950.
0930-1000: Breakfast & Welcome
1000-1215: Talks
1000-1045: Avishay Tal (Stanford), Improved Pseudorandomness for Unordered Branching Programs
1045-1130: Edo Liberty (Amazon), Infinitely Scalable Machine Learning Algorithm with Amazon AI
1130-1215: Nike Sun (Berkeley), Phase transitions in random constraint satisfaction problems
1215-1315: Lunch (provided)
1315-1445: Talks
1315-1400: Kshipra Bhawalkar (Google), Targeting and Signaling in Ad Auctions
1400-1445: Manfred Warmuth (UC Santa Cruz), Volume Sampling for Linear Regression with a Small Number of Labels
1445-1515: Break
1515-1700: Short Talks (Students)
Weihao Kong (Stanford) Estimating Learnability in the Sublinear Data Regime
Vatsal Sharan (Stanford) Faster Anomaly Detection using Matrix Sketching
Andrew Stolman (UC Santa Cruz) Finding forbidden minors in sublinear time: an $O(n^{1/2 + o(1)})$-query one-sided tester for minor closed properties
Neha Gupta (Stanford) Exploiting numerical sparsity for efficient learning: Faster eigenvector computation and regression
Shweta Jain (UC Santa Cruz) Estimating the degree distribution using sublinear graph samples
Michael Kim (Stanford) Fairness Through Computationally-Bounded Awareness
Zayd Hammoudeh (UC Santa Cruz) Counting and sampling satisfying assignments in practice
Hongyang Zhang (Stanford) Labeling scheme lower bounds for personalized PageRank
Kiran Shiragur (Stanford) Efficient profile maximum likelihood for Universal estimator
Joshua Wang (Stanford) Simulating Circuits with Online Gradient Descent
Aaron Schild (Berkeley) Uniformly random spanning trees in almost-linear time