 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
 |
|
|||||||||||||
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
|||
 |
 |
 |
 |
|
||||||||||
 |
|
|||||||||||||
 |
|
|||||||||||||
 |
 |
|
||||||||||||
| Seminar Schedule (Seminar Organizer: Prof. Ziv Bar-Joseph) | |
Machine Learning Lunch Seminar
|
Spring 2009 Seminar
Date: April 29, 2009 Time: 4:30 PM - 5:30 PM () Location: 3305 Newell-Simon Hall Speaker: Lawrence K. Saul Associate Professor, University of California, San Diego Title: Convex optimizations for machine learning Abstract: One particularly successful approach in machine learning has been to recast certain fundamental problems as convex optimizations. Well-known examples of this approach are large margin classification using support vector machines and feature selection using l1-norm regularization. In this talk, I will describe some recent applications of this approach to other problems in machine learning, including nonlinear dimensionality reduction, nearest neighbor classification, and audio scene analysis.
