11 citations · 11 across the 9 of their papers we have counts for
10 papers
Matrix Completion over Finite Fields: Bounds and Belief Propagation Algorithms
Mahdi Soleymani, Qiang Liu, Hessam Mahdavifar +1
We consider the low rank matrix completion problem over finite fields. This problem has been extensively studied in the domain of real/complex numbers, however, to the best of auth…
Analog Multi-Party Computing: Locally Differential Private Protocols for Collaborative Computations
Hsuan-Po Liu, Mahdi Soleymani, Hessam Mahdavifar
We consider a fully-decentralized scenario in which no central trusted entity exists and all clients are honest-but-curious. The state-of-the-art approaches to this problem often r…
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…
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…
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…
Analog Lagrange Coded Computing
Mahdi Soleymani, Hessam Mahdavifar, A. Salman Avestimehr
A distributed computing scenario is considered, where the computational power of a set of worker nodes is used to perform a certain computation task over a dataset that is disperse…
Privacy-Preserving Distributed Learning in the Analog Domain
Mahdi Soleymani, Hessam Mahdavifar, A. Salman Avestimehr
We consider the critical problem of distributed learning over data while keeping it private from the computational servers. The state-of-the-art approaches to this problem rely on…
Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks
Mahdi Soleymani, Hessam Mahdavifar
We provide a novel framework to study subspace codes for non-coherent communications in wireless networks. To this end, an analog operator channel is defined with inputs and output…
Coded Distributed Computing: Performance Limits and Code Designs
Mohammad Vahid Jamali, Mahdi Soleymani, 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…
Distributed Multi-User Secret Sharing
Mahdi Soleymani, Hessam Mahdavifar
We consider a distributed secret sharing system that consists of a dealer, storage nodes, and users. Each user is given access to a certain subset of storage nodes, where i…