184 citations · 779 across the 55 of their papers we have counts for
7 papers · 1 filter
Communication-Efficient and Byzantine-Robust Distributed Learning with Error Feedback
Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe +2
We develop a communication-efficient distributed learning algorithm that is robust against Byzantine worker machines. We propose and analyze a distributed gradient-descent algorith…
vqSGD: Vector Quantized Stochastic Gradient Descent
Venkata Gandikota, Daniel Kane, Raj Kumar Maity +1
In this work, we present a family of vector quantization schemes \emph{vqSGD} (Vector-Quantized Stochastic Gradient Descent) that provide an asymptotic reduction in the communicati…
Sample Complexity of Learning Mixtures of Sparse Linear Regressions
Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor +1
In the problem of learning mixtures of linear regressions, the goal is to learn a collection of signal vectors from a sequence of (possibly noisy) linear measurements, where each m…
Same-Cluster Querying for Overlapping Clusters
Wasim Huleihel, Arya Mazumdar, Muriel Médard +1
Overlapping clusters are common in models of many practical data-segmentation applications. Suppose we are given elements to be clustered into possibly overlapping clusters…
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing
Larkin Flodin, Venkata Gandikota, Arya Mazumdar
One-bit compressed sensing (1bCS) is a method of signal acquisition under extreme measurement quantization that gives important insights on the limits of signal compression and ana…
Trace Reconstruction: Generalized and Parameterized
Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor +1
In the beautifully simple-to-state problem of trace reconstruction, the goal is to reconstruct an unknown binary string given random "traces" of where each trace is generat…