no code implementations • 6 Jul 2017 • Deanna Needell, Rayan Saab, Tina Woolf
Binary, or one-bit, representations of data arise naturally in many applications, and are appealing in both hardware implementations and algorithm design.
no code implementations • 12 Jan 2017 • Deanna Needell, Tina Woolf
Asynchronous algorithms are often studied to solve optimization problems where the cost function takes the form $\sum_{i=1}^M f_i(x)$, with a common assumption that each $f_i$ is sparse; that is, each $f_i$ acts only on a small number of components of $x\in\mathbb{R}^n$.
1 code implementation • 19 Jun 2015 • Mark A. Davenport, Andrew K. Massimino, Deanna Needell, Tina Woolf
Suppose that we wish to estimate a vector $\mathbf{x} \in \mathbb{C}^n$ from a small number of noisy linear measurements of the form $\mathbf{y} = \mathbf{A x} + \mathbf{z}$, where $\mathbf{z}$ represents measurement noise.
Information Theory Information Theory