University of Cambridge > > Microsoft Research Cambridge, public talks > Sparse Model Recovery via Iterative Algorithms

Sparse Model Recovery via Iterative Algorithms

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity