16 citations · 25 across the 8 of their papers we have counts for
10 papers
Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load
Maximilian Egger, Serge Kas Hanna, Rawad Bitar
In distributed machine learning, a central node outsources computationally expensive calculations to external worker nodes. The properties of optimization procedures like stochasti…
Codes Correcting Burst and Arbitrary Erasures for Reliable and Low-Latency Communication
Serge Kas Hanna, Zhiyuan Tan, Wen Xu +1
Motivated by modern network communication applications which require low latency, we study codes that correct erasures with low decoding delay. We provide a simple explicit constru…
Adaptive Stochastic Gradient Descent for Fast and Communication-Efficient Distributed Learning
Serge Kas Hanna, Rawad Bitar, Parimal Parag +2
We consider the setting where a master wants to run a distributed stochastic gradient descent (SGD) algorithm on workers, each having a subset of the data. Distributed SGD may…
Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion Probabilities
Serge Kas Hanna
Motivated by DNA-based storage applications, we study the problem of reconstructing a coded sequence from multiple traces. We consider the model where the traces are outputs of ind…
Optimal Codes Correcting Localized Deletions
Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii +1
We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that w…
Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy
Serge Kas Hanna, Rawad Bitar
We study codes that can detect the exact number of deletions and insertions in concatenated binary strings. We construct optimal codes for the case of detecting up to $\del$ deleti…
Adaptive Distributed Stochastic Gradient Descent for Minimizing Delay in the Presence of Stragglers
Serge Kas Hanna, Rawad Bitar, Parimal Parag +2
We consider the setting where a master wants to run a distributed stochastic gradient descent (SGD) algorithm on workers each having a subset of the data. Distributed SGD may s…
List Decoding of Deletions Using Guess & Check Codes
Serge Kas Hanna, Salim El Rouayheb
Guess & Check (GC) codes are systematic binary codes that can correct multiple deletions, with high probability. GC codes have logarithmic redundancy in the length of the message $…
Codes for Correcting Localized Deletions
Serge Kas Hanna, Salim El Rouayheb
We consider the problem of constructing binary codes for correcting deletions that are localized within certain parts of the codeword that are unknown a priori. The model that we s…
Guess & Check Codes for Deletions and Synchronization
Serge Kas Hanna, Salim El Rouayheb
We consider the problem of constructing codes that can correct deletions occurring in an arbitrary binary string of length bits. Varshamov-Tenengolts (VT) codes can correct…