Using more data to speed-up training time. Invitaed Talk, given at the COST Workshop, NIPS, 2011.

Learnability beyond uniform convergence. Invitaed Talk, given at the Learning theory workshop, FOCM, Budapest, July 2011, and at Dagstuhl seminar, Mathematical and Computational Foundations of Learning Theory.

What else can we do with more data?. ITA workshop, UCSD, 2011.

Machine Learning in the Data Revolution Era. Invitaed Talk, Google \& University of Waterloo, Canada, July, 2009.

Efficient learning with partial information on each individual example. Weizmann seminar, January, 2009.

On the tradeoff between computational complexity and sample complexity in learning. CS seminar, The Hebrew university, December, 2009.

Overview of Compressed Sensing. Basic Notions Seminar, The Einstein Institute of Mathematics, The Hebrew university, December, 2009.

Trading regret rate for computational efficiency in online learning with limited feedback. On-line Learning with Limited Feedback, Joint ICML/COLT/UAI Workshop, 2009.

Littlestone's Dimension and Online Learnability. UCSD workshop, 2009.

The Duality of Strong Convexity and Strong Smoothness: Applications to Machine Learning. AFOSR workshop, 2009.

Trading Accuracy for Sparsity. UIC, 2008.

Large-Scale SVM Optimization: Taking a Machine Learning Perspective.NEC labs, Princeton, 2008.

Tutorial on Online Learning (ICML 2008).

Online Prediction, Low Regret, and Convex Duality. GIF Workshop, Tubingen, May 15-16, 2008.

Online Prediction: The Role of Convexity and Randomization. Learning Club, The Hebrew University, 2008.

Low \ell_1 Norm and Guarantees on Sparsifiability. Sparse Optimization and Variable Selection, Workshop, ICML/COLT/UAI, July, 2008.