University of Cambridge > Talks.cam > Machine Learning @ CUED > Accelerating computation of SVM and DNN by binary approximation

  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

Accelerating computation of SVM and DNN by binary approximation

Download to your calendar using vCal

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

Object detection involves classification of a huge number of detection windows obtained by raster scanning of an input image. In this talk, we introduce binary approximation to accelerate the computation of linear SVM for multi-class classification task. Since the proposed method can replace real-valued inner-product with binary inner-product computations, it’s about 200 times faster than the conventional SVM classifiers. We also show that the proposed approach can be extended to enable fast computation of existing deep neural network models and decrease model size without the need for retraining.

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

Castlereagh room - St John's College Zoom (online) Senior Parlour, Gonville & Caius College

Other talks

Fairy Tales TBC Group Work Whether and when: Split-population cure models of women's work and parity progression in Derbyshire, 1881-1911 Title TBC Title to be confirmed
 

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