CS Yahoo! Machine Learning Seminar: Anshumali Shrivastava (Rice University) - Probabilistic Hashing for Scalable, Sustainable and Secure Machine Learning
Fri, Mar 17, 2017 @ 10:30 AM - 11:30 AM
Conferences, Lectures, & Seminars
Speaker: Anshumali Shrivastava, Rice University
Talk Title: Probabilistic Hashing for Scalable, Sustainable and Secure Machine Learning
Series: Yahoo! Labs Machine Learning Seminar Series
Abstract: Large scale machine learning and data mining applications are constantly dealing with datasets at TB scale and the anticipation is that soon it will reach PB level. At this scale, simple data mining operations such as search, learning, and clustering become challenging.
In this talk, we will start with a basic introduction to probabilistic hashing (or fingerprinting) and the classical LSH algorithm. Then I will present some of my recent adventures with probabilistic hashing in making large-scale machine learning practical. I will show how the
idea of probabilistic hashing can be used to significantly reduce the computations in classical machine learning algorithms such Deep Learning (using our recent success with asymmetric hashing for inner products). I will highlight the computational bottleneck, i.e. the hashing time, and will show an efficient variant of minwise hashing. In the end, if time permits, I will demonstrate the use of probabilistic hashing for obtaining practical privacy-preserving
Biography: Anshumali Shrivastava is an assistant professor in the computer science department at Rice University. His broad research interests include large scale machine learning, randomized algorithms for big data systems and graph mining. He is a recipient of 2017 NSF CAREER Award. His research on hashing inner products has won Best Paper Award at NIPS 2014 while his work on representing graphs got the Best Paper Award at IEEE/ACM ASONAM 2014. He obtained his PhD in computer science from Cornell University in 2015.
Host: Yan Liu
Audiences: Everyone Is Invited
Contact: Assistant to CS chair