1.1k citations · 3.9k across the 74 of their papers we have counts for
Showing 2012 · cs.ITShow all
2 papers · 2 filters
cs.IT2012★ 11 cited
Sharp recovery bounds for convex demixing, with applications
Michael B. McCoy, Joel A. Tropp
Demixing refers to the challenge of identifying two structured signals given only the sum of the two signals and prior information about their structures. Examples include the prob…
cs.IT2012★ 83 cited
Robust computation of linear models by convex relaxation
Gilad Lerman, Michael McCoy, Joel A. Tropp +1
Consider a dataset of vector-valued observations that consists of noisy inliers, which are explained well by a low-dimensional subspace, along with some number of outliers. This wo…