## Abstract

Binary measurements arise naturally in a variety of statistics and engineering applications. They may be inherent to the problem - for example, in determining the relationship between genetics and the presence or absence of a disease - or they may be a result of extreme quantization. A recent influx of literature has suggested that using prior signal information can greatly improve the ability to reconstruct a signal from binary measurements. This is exemplified by one-bit compressed sensing, which takes the compressed sensing model but assumes that only the sign of each measurement is retained. It has recently been shown that the number of one-bit measurements required for signal estimation mirrors that of unquantized compressed sensing. Indeed, s-sparse signals in R^{n} can be estimated (up to normalization) from Ω (s log (n/s)) one-bit measurements. Nevertheless, controlling the precise accuracy of the error estimate remains an open challenge. In this paper, we focus on optimizing the decay of the error as a function of the oversampling factor λ := m/(s log (n/s)), where m is the number of measurements. It is known that the error in reconstructing sparse signals from standard one-bit measurements is bounded below by Ω (λ^{-1}). Without adjusting the measurement procedure, reducing this polynomial error decay rate is impossible. However, we show that an adaptive choice of the thresholds used for quantization can lower the error rate to e^{-Ω(λ)}. This improves upon guarantees for other methods of adaptive thresholding, such as sigma-delta quantization. We develop a general recursive strategy to achieve this exponential decay and two specific polynomial-time algorithms, which fall into this framework, one based on convex programming and one on hard thresholding. Our work bridges the one-bit compressed sensing model, in which the engineer controls the measurement procedure, to sigma-delta and successive approximation quantization. Moreover, the principle is extendable to signal reconstruction problems in a variety of binary statistical models as well as statistical estimation problems like logistic regression.

Original language | English (US) |
---|---|

Article number | 7888437 |

Pages (from-to) | 3368-3385 |

Number of pages | 18 |

Journal | IEEE Transactions on Information Theory |

Volume | 63 |

Issue number | 6 |

DOIs | |

State | Published - Jun 2017 |

## Keywords

- Compressed sensing
- binary regression
- convex optimization
- iterative thresholding
- one-bit compressed sensing
- quantization

## ASJC Scopus subject areas

- Information Systems
- Computer Science Applications
- Library and Information Sciences