Search Results for author:
Found 7 papers, 1 papers with code
Improved Capacity Outer Bound for Private Quadratic Monomial Computation
Focusing on private \emph{quadratic monomial} computation, we propose three methods for ordering candidate functions: a graph edge-coloring method, a graph-distance method, and an entropy-based greedy method.
Information Theory Information Theory
Straggler-Resilient Differentially-Private Decentralized Learning
We consider the straggler problem in decentralized learning over a logical ring while preserving user data privacy.
CodedPaddedFL and CodedSecAgg: Straggler Mitigation and Secure Aggregation in Federated Learning
For a scenario with 120 devices, CodedPaddedFL achieves a speed-up factor of 18 for an accuracy of 95% on the MNIST dataset compared to conventional FL.
Coding for Straggler Mitigation in Federated Learning
The proposed scheme combines one-time padding to preserve privacy and gradient codes to yield resiliency against stragglers and consists of two phases.
Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval
We propose to extend the concept of private information retrieval by allowing for distortion in the retrieval process and relaxing the perfect privacy requirement at the same time.
A Droplet Approach Based on Raptor Codes for Distributed Computing With Straggling Servers
We propose a coded distributed computing scheme based on Raptor codes to address the straggler problem.
Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers
We propose two coded schemes for the distributed computing problem of multiplying a matrix by a set of vectors.
