Presentations and Dates

11:00-11:20 - Sam Cole on "Efficient Learning Algorithms Yield Circuit Lower Bounds" (Fortnow and Klivans 2009)
11:25-11:45 - Adam Lelkes on "Constructing Hard Functions from Learning Algorithms" (Klivans et al. 2013)
11:50-12:10 - Wei Xing on "Asymptotic log-loss of prequential maximum likelihood codes." (Grunwald and de Rooij 2005) "Predicting a binary sequence almost as well as the optimal biased coin" (Freund 2003)

11:00-11:20 - Anqi Liu on "Performance Guarantees for Regularized Maximum Entropy Density Estimation" (Dudik et al. 2004)
11:25-11:45 - Kaiser Asif on "Boosting and Maximum Likelihood for Exponential Models" (Lebanon and Lafferty 2002)
11:50-12:10 - Rizal Fathony on "Learning Bounds for Importance Weighting" (Cortes et al. 2010)

11:00-11:25 - Ben Fish on "Preventing False Discovery in Interactive Data Analysis is Hard" (Hardt and Ullman 2014)
11:30-12:00 - Sam Ziegler on "A finite sample analysis of the Naive Bayes classifier" (Berend and Kontorovich 2008)