294 citations · 958 across the 32 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.ST2012
1-Bit Matrix Completion
Mark A. Davenport, Yaniv Plan, Ewout van den Berg +1
In this paper we develop a theory of matrix completion for the extreme case of noisy 1-bit observations. Instead of observing a subset of the real-valued entries of a matrix M, we…
cs.IT2012★ 1 cited
One-bit compressed sensing with non-Gaussian measurements
Albert Ai, Alex Lapanowski, Yaniv Plan +1
In one-bit compressed sensing, previous results state that sparse signals may be robustly recovered when the measurements are taken using Gaussian random vectors. In contrast to st…
cs.IT2012
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
Yaniv Plan, Roman Vershynin
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We show that a single convex program gives an accurate estimate of…