Sparse Model Recovery via Iterative Algorithms
- π€ Speaker: Prof. Devavrat Shah - MIT
- π Date & Time: Tuesday 30 March 2010, 11:00 - 12:00
- π Venue: Small public lecture room, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
Abstract
Abstract: In this talk, I shall discuss design of simple, iterative algorithms to recover an n-dimensional nonnegative-valued vector x from an m-dimensional nonnegative vector y = Ax, with A being an m x n matrix having 0/1 entries. Interest is in the scenario when m << n and the goal is to discuss conditions on A under which the algorithm will be able to recover x successfully. Specifically, I will discuss two sets of conditions : (a) known conditions regarding expansion of the matrix A, and (b) a new `witness` condition with application to learning rankings. The talk is based on joint works with (a) V. Chandar and G. Wornell,(b) S. Jagabathula—all at MIT .
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Small public lecture room, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Prof. Devavrat Shah - MIT
Tuesday 30 March 2010, 11:00-12:00