Private retrieval, computing, and learning: Recent progress and future challenges

S Ulukus, S Avestimehr, M Gastpar… - IEEE Journal on …, 2022 - ieeexplore.ieee.org
Most of our lives are conducted in the cyberspace. The human notion of privacy translates
into a cyber notion of privacy on many functions that take place in the cyberspace. This …

Adaptive verifiable coded computing: Towards fast, secure and private distributed machine learning

T Tang, RE Ali, H Hashemi, T Gangwani… - 2022 IEEE …, 2022 - ieeexplore.ieee.org
Stragglers, Byzantine workers, and data privacy are the main bottlenecks in distributed cloud
computing. Some prior works proposed coded computing strategies to jointly address all …

Group-wise verifiable coded computing under byzantine attacks and stragglers

S Hong, H Yang, Y Yoon, J Lee - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Distributed computing has emerged as a promising solution for accelerating machine
learning training processes on large-scale datasets by leveraging the parallel processing …

Tessellated distributed computing

A Khalesi, P Elia - arxiv preprint arxiv:2404.14203, 2024 - arxiv.org
The work considers the $ N $-server distributed computing scenario with $ K $ users
requesting functions that are linearly-decomposable over an arbitrary basis of $ L $ real …

Multi-user linearly-separable distributed computing

A Khalesi, P Elia - IEEE Transactions on Information Theory, 2023 - ieeexplore.ieee.org
In this work, we explore the problem of multi-user linearly-separable distributed computation,
where servers help compute the desired functions (jobs) of users, and where each desired …

Secure private and adaptive matrix multiplication beyond the singleton bound

C Hofmeister, R Bitar, M Xhemrishi… - IEEE Journal on …, 2022 - ieeexplore.ieee.org
We consider the problem of designing secure and private codes for distributed matrix-matrix
multiplication. A master server owns two private matrices and hires worker nodes to help …

Hierarchical group testing for byzantine attack identification in distributed matrix multiplication

S Hong, H Yang, J Lee - IEEE Journal on Selected Areas in …, 2022 - ieeexplore.ieee.org
Coded computing has proved its efficiency in handling a straggler issue in distributed
computing framework. It uses error correcting codes to mitigate the effect of the stragglers …

ApproxIFER: A model-agnostic approach to resilient and robust prediction serving systems

M Soleymani, RE Ali, H Mahdavifar… - Proceedings of the AAAI …, 2022 - ojs.aaai.org
Due to the surge of cloud-assisted AI services, the problem of designing resilient prediction
serving systems that can effectively cope with stragglers and minimize response delays has …

Multi-user distributed computing via compressed sensing

A Khalesi, S Daei, M Kountouris… - 2023 IEEE Information …, 2023 - ieeexplore.ieee.org
The multi-user linearly-separable distributed computing problem is considered here, in
which N servers help to compute the real-valued functions requested by K users, where …

Coded computing via binary linear codes: Designs and performance limits

M Soleymani, MV Jamali… - IEEE Journal on Selected …, 2021 - ieeexplore.ieee.org
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 linear …