4 papers
Approximate Distributed Coded Computing: Polynomial Codes and Randomized Sketching
Neophytos Charalambides, Arya Mazumdar
Coded computing is a distributed paradigm that uses coding theory to introduce \textit{redundancy} and overcome bottlenecks in large-scale systems. In the same vein, randomized num…
Distributed Hybrid Sketching for -Embeddings
Neophytos Charalambides, Arya Mazumdar
Linear algebraic operations are ubiquitous in engineering applications, and arise often in a variety of fields including statistical signal processing and machine learning. With co…
Generalized Fractional Repetition Codes for Binary Coded Computations
Neophytos Charalambides, Hessam Mahdavifar, Alfred O. Hero
This paper addresses the gradient coding and coded matrix multiplication problems in distributed optimization and coded computing. We present a numerically stable binary coding met…
Gradient Coding with Iterative Block Leverage Score Sampling
Neophytos Charalambides, Mert Pilanci, Alfred Hero
We generalize the leverage score sampling sketch for -subspace embeddings, to accommodate sampling subsets of the transformed data, so that the sketching approach is approp…