University of Cambridge > Talks.cam > Machine Learning @ CUED > Scaling Machine Learning for the Internet

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Scaling Machine Learning for the Internet

Download to your calendar using vCal

If you have a question about this talk, please contact Zoubin Ghahramani .

In this talk I will give an overview over an array of highly scalable techniques for both observed and latent variable models. This makes them well suited for problems such as classification, recommendation systems, topic modeling and user profiling. I will present algorithms for batch and online distributed convex optimization to deal with large amounts of data, and hashing to address the issue of parameter storage for personalization and collaborative filtering. Furthermore, to deal with latent variable models I will discuss distributed sampling algorithms capable of dealing with tens of billions of latent variables on a cluster of 1000 machines.

The algorithms described are used for personalization, spam filtering, recommendation, document analysis, and advertising.

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Hitachi Cambridge Seminar Series Average on weekdays: 9039.74311927 kWh History Faculty Room 11

Other talks

Morning Tea and Coffee Group Work Alicia Anderson discussing some exciting news about HARPS3 Teams Announced The “Art” and the “Easy”: Nicolò Pasquali’s Keyboard World Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity