Learn More
We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of orthogonal matching pursuit techniques when applied to very sparse signals, and reconstruction accuracy of the same(More)
The Grassmann manifold G<sub>n,p</sub> (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space L<sup>n</sup>, where L is either R or C. This paper considers the quantization problem in which a source in G<sub>n,p</sub> (L) is quantized through a code in G<sub>n,q</sub> (L), with p and q not necessarily the same.(More)
When building large-scale machine learning (ML) programs, such as massive topics models or deep networks with up to trillions of parameters and training examples, one usually assumes that such massive tasks can only be attempted with industrial-sized clusters with thousands of nodes, which are out of reach for most practitioners or academic researchers. We(More)
— We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of orthogonal matching pursuit techniques, and reconstruction accuracy of the same order as that of LP optimization(More)
How can one build a distributed framework that allows efficient deployment of a wide spectrum of modern advanced machine learning (ML) programs for industrial-scale problems using Big Models (100s of billions of parameters) on Big Data (terabytes or petabytes)- Contemporary parallelization strategies employ fine-grained operations and scheduling beyond the(More)
We study the average distortion introduced by scalar, vector, and entropy coded quantization of compressive sensing (CS) measurements. The asymptotic behavior of the underlying quantization schemes is either quantified exactly or characterized via bounds. We also modify two benchmark CS reconstruction algorithms to accommodate quantization effects, and(More)
A compromised spindle checkpoint is thought to play a key role in genetic instability that predisposes cells to malignant transformation. Loss of function mutations of BubR1, an important component of the spindle checkpoint, have been detected in human cancers. Here we show that BubR1(+/-) mouse embryonic fibroblasts are defective in spindle checkpoint(More)
We consider the data-driven dictionary learning problem. The goal is to seek an over-complete dictionary from which every training signal can be best approximated by a linear combination of only a few codewords. This task is often achieved by iteratively executing two operations: sparse coding and dictionary update. The focus of this paper is on the(More)