 |
|
|
|
|
|
|
|
|
|
|
|
|
 |
|
|||||||||||
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
|
 |
 |
|
||||||||||
 |
|
|||||||||||
 |
|
|||||||||||
 |
 |
|
||||||||||
| Seminar Schedule (Seminar Organizer: Prof. Ziv Bar-Joseph) | |
Machine Learning Lunchtime Chats
|
Spring 2007 Seminar
Date: February 22, 2007 Time: 3:00 PM - 00:00 AM Location: 5409 Wean Hall Speaker: Joel Tropp Assistant Professor Title: Sparse solutions to underdetermined linear systems Abstract: A fundamental problem in applied mathematics, statistics, and electrical engineering is to solve underdetermined systems of linear equations. Basic linear algebra seems to forbid this possibility. But a recent strand of research has established that certain underdetermined systems can be solved robustly with efficient algorithms, provided that the solution is sparse (i.e., has many zero components). This talk provides an overview of these sparse representation problems, and it describes the basic algorithmic approaches. Then it details situations where the algorithms are guaranteed to succeed. In particular, the talk introduces some new work on the case where the matrix is deterministic and the sparsity pattern is random. It also covers some results for the case where the matrix is random, which is the situation in Compressive Sampling applications.