[Colloquium] Talk by Sathiya Keerthi on Thursday, April 6th, 2006

[Margery Ishmael]

DEPARTMENT OF COMPUTER SCIENCE - TALK

Date: Thursday, April 6th, 2006
Time: 3:00 p.m.
Place: Ryerson 255

-------------------------------------------

Speaker:  SATHIYA KEERTHI, Senior Research Scientist

From:  Yahoo! Research, Burbank

Url:  http://research.yahoo.com/~keerthis/

Title:  Greedy primal algorithms for building sparse SVMs

Abstract:

Sparsity (using a small number of basis functions) is important in
applications requiring great classification speed. This talk will review
existing methods for building sparse SVMs, point out their drawbacks,
and discuss an effective new primal greedy method which is along the
lines of matching pursuit algorithms in least squares. The method is
also very efficient: it greedily chooses a set of d kernel basis  
functions
to approximate the SVM primal cost function well in O(n d^2) time, where
n is the number of training examples.

***The talk will be followed by refreshments in Ryerson 255***

-------------------------------------------------------

Hosts:  Partha Niyogi & Vikas Sindhwani

People in need of assistance should call 773-834-8977 in advance.

For information on future CS talks: http://www.cs.uchicago.edu/events