382 citations · 1.3k across the 17 of their papers we have counts for
12 papers · 1 filter
Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier
Qian Yu, A. Salman Avestimehr
In distributed matrix multiplication, a common scenario is to assign each worker a fraction of the multiplication task, by partitioning the input matrices into smaller submatrices.…
Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation
Qian Yu, A. Salman Avestimehr
We consider the problem of distributedly computing a general class of functions, referred to as gradient-type computation, while maintaining the privacy of the input dataset. Gradi…
Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy
Qian Yu, Songze Li, Netanel Raviv +3
We consider a scenario involving computations over a massive dataset stored distributedly across multiple workers, which is at the core of distributed learning algorithms. We propo…
Polynomially Coded Regression: Optimal Straggler Mitigation via Data Encoding
Songze Li, Seyed Mohammadreza Mousavi Kalan, Qian Yu +2
We consider the problem of training a least-squares regression model on a large dataset using gradient descent. The computation is carried out on a distributed system consisting of…
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding
Qian Yu, Mohammad Ali Maddah-Ali, A. Salman Avestimehr
We consider the problem of massive matrix multiplication, which underlies many data analytic applications, in a large-scale distributed system comprising a group of worker nodes. W…
Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication
Qian Yu, Mohammad Ali Maddah-Ali, A. Salman Avestimehr
We consider a large-scale matrix multiplication problem where the computation is carried out using a distributed system with a master node and multiple worker nodes, where each wor…
How to Optimally Allocate Resources for Coded Distributed Computing?
Qian Yu, Songze Li, Mohammad Ali Maddah-Ali +1
Today's data centers have an abundance of computing resources, hosting server clusters consisting of as many as tens or hundreds of thousands of machines. To execute a complex comp…
Characterizing the Rate-Memory Tradeoff in Cache Networks within a Factor of 2
Qian Yu, Mohammad Ali Maddah-Ali, A. Salman Avestimehr
We consider a basic caching system, where a single server with a database of files (e.g. movies) is connected to a set of users through a shared bottleneck link. Each user…
The Exact Rate-Memory Tradeoff for Caching with Uncoded Prefetching
Qian Yu, Mohammad Ali Maddah-Ali, A. Salman Avestimehr
We consider a basic cache network, in which a single server is connected to multiple users via a shared bottleneck link. The server has a database of files (content). Each user has…
A Scalable Framework for Wireless Distributed Computing
Songze Li, Qian Yu, Mohammad Ali Maddah-Ali +1
We consider a wireless distributed computing system, in which multiple mobile users, connected wirelessly through an access point, collaborate to perform a computation task. In par…
A Fundamental Tradeoff between Computation and Communication in Distributed Computing
Songze Li, Mohammad Ali Maddah-Ali, Qian Yu +1
How can we optimally trade extra computing power to reduce the communication load in distributed computing? We answer this question by characterizing a fundamental tradeoff between…
Finding the Optimal Demodulator Under Implementation Constraints
Qian Yu
The common approach of designing a communication device is to maximize a well-defined objective function, e.g., the channel capacity and the cut-off rate. We propose easy-to-implem…