Sparse Model Recovery via Iterative Algorithms

Add to your list(s) Download to your calendar using vCal

• Prof. Devavrat Shah - MIT
• Tuesday 30 March 2010, 11:00-12:00
• Small public lecture room, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

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 .

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Small public lecture room, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.