Scalable Machine Learning 1. Systems Alex Smola Yahoo! Research and ANU http://alex.smola.org/teaching/berkeley2012 Stat 260 SP 12 Basics Important Stuff • Time • Class - Tuesday 4-7pm • Q&A - Tuesday 1-3pm (Evans Hall 418) • Tutor - Dapo Omidiran You can get 103% • Grading policy • Assignments (20), project (45), midterm (15), final exam (20), scribe (3) • Exams will be without technology. You can bring a paper notebook (8”x10”) Important Stuff • Homework • 5 sets of assignments Can you look at yourself in the mirror? • Do it yourself. I will not check plagiarism. • Discussing with others is encouraged but you hurt yourself if you don’t solve the problems. • Drop off your homework in class. No late drops accepted. No exceptions. • Only the best 4 assignments count. Important Stuff • Project • Do it well (you get 45% of the score) • Start early (you stress puppies, too) • Each team member gets the same score • Ask me if you’re looking for ideas GSI • Dapo Omidiran + one more • Piazza discussion board http://tinyurl.com/cs281b-discussion • Office hours poll http://tinyurl.com/cs281b-poll • Signup list for scribing on Piazza TBD Scalable Machine Learning • Systems • Basic Statistics • Data streams and sketches • Optimization • Generalized Linear Models • Kernels and Regularization • Recommender Systems • Graphical Models • Large Scale Inference • Applications • Active Learning / Bandits and Exploration Scalable Machine Learning • Systems • Basic Statistics for the internet • Data streams and sketches • Optimization • Generalized Linear Models • Kernels and Regularization • Recommender Systems • Graphical Models • Large Scale Inference • Applications • Active Learning / Bandits and Exploration Scalable Machine Learning • Systems • Basic Statistics for the internet • Data streams and sketches • Optimization • Generalized Linear Models • Kernels and Regularization all you need • Recommender Systems for a startup • Graphical Models • Large Scale Inference • Applications • Active Learning / Bandits and Exploration 1. Systems Algorithms run on MANY REAL and FAULTY boxes not Turing machines. So we need to deal with it.