Search Results for author:
Found 4 papers, 0 papers with code
A Provably Communication-Efficient Asynchronous Distributed Inference Method for Convex and Nonconvex Problems
This paper proposes and analyzes a communication-efficient distributed optimization framework for general nonconvex nonsmooth signal processing and machine learning problems under an asynchronous protocol.
A Dictionary-Based Generalization of Robust PCA Part II: Applications to Hyperspectral Demixing
We consider the task of localizing targets of interest in a hyperspectral (HS) image based on their spectral signature(s), by posing the problem as two distinct convex demixing task(s).
A Dictionary-Based Generalization of Robust PCA with Applications to Target Localization in Hyperspectral Imaging
We consider the decomposition of a data matrix assumed to be a superposition of a low-rank matrix and a component which is sparse in a known dictionary, using a convex demixing method.
Communication-efficient Algorithm for Distributed Sparse Learning via Two-way Truncation
We propose a communicationally and computationally efficient algorithm for high-dimensional distributed sparse learning.
