374 citations · 818 across the 73 of their papers we have counts for
8 papers · 1 filter
Federated Learning with Heterogeneous Differential Privacy
Nasser Aldaghri, Hessam Mahdavifar, Ahmad Beirami
Federated learning (FL) takes a first step towards privacy-preserving machine learning by training models while keeping client data local. Models trained using FL may still leak pr…
ApproxIFER: A Model-Agnostic Approach to Resilient and Robust Prediction Serving Systems
Mahdi Soleymani, Ramy E. Ali, Hessam Mahdavifar +1
Due to the surge of cloud-assisted AI services, the problem of designing resilient prediction serving systems that can effectively cope with stragglers/failures and minimize respon…
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…
KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning
Ashok Vardhan Makkuva, Xiyang Liu, Mohammad Vahid Jamali +3
Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes: each is a linear code and represents a mathematical…
Hybrid Non-Binary Repeated Polar Codes
Fariba Abbasi, Hessam Mahdavifar, Emanuele Viterbo
Concatenating the state-of-the-art codes at moderate rates with repetition codes has emerged as a practical solution deployed in various standards for ultra-low-power devices such…
Coded Computing via Binary Linear Codes: Designs and Performance Limits
Mahdi Soleymani, Mohammad Vahid Jamali, Hessam Mahdavifar
We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into smaller tasks, encoded using an…
Reed-Muller Subcodes: Machine Learning-Aided Design of Efficient Soft Recursive Decoding
Mohammad Vahid Jamali, Xiyang Liu, Ashok Vardhan Makkuva +3
Reed-Muller (RM) codes are conjectured to achieve the capacity of any binary-input memoryless symmetric (BMS) channel, and are observed to have a comparable performance to that of…
List-Decodable Coded Computing: Breaking the Adversarial Toleration Barrier
Mahdi Soleymani, Ramy E. Ali, Hessam Mahdavifar +1
We consider the problem of coded computing, where a computational task is performed in a distributed fashion in the presence of adversarial workers. We propose techniques to break…