activity
20152026
most citedPolynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication

382 citations · 1.3k across the 17 of their papers we have counts for

collaborators

17 papers

cs.LG2026

TextBFGS: A Case-Based Reasoning Approach to Code Optimization via Error-Operator Retrieval

Zizheng Zhang, Yuyang Liao, Chen Chen +8

Iterative code generation with Large Language Models (LLMs) can be viewed as an optimization process guided by textual feedback. However, existing LLM self-correction methods predo…

cs.LG2023

Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms

Qian Yu, Yining Wang, Baihe Huang +2

In stochastic zeroth-order optimization, a problem of practical relevance is understanding how to fully exploit the local geometry of the underlying objective function. We consider…

cs.LG2021★ 59 cited

LightSecAgg: a Lightweight and Versatile Design for Secure Aggregation in Federated Learning

Jinhyun So, Chaoyang He, Chien-Sheng Yang +5

Secure model aggregation is a key component of federated learning (FL) that aims at protecting the privacy of each user's individual model while allowing for their global aggregati…

cs.IT2020★ 25 cited

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.…

cs.LG2019★ 8 cited

Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition

Lin Chen, Qian Yu, Hannah Lawrence +1

We study the problem of switching-constrained online convex optimization (OCO), where the player has a limited number of opportunities to change her action. While the discrete anal…

cs.IT2019★ 1 cited

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…

cs.IT2018★ 206 cited

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…

cs.IT2018★ 46 cited

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…

cs.IT2018★ 208 cited

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…

cs.DC2017★ 8 cited

Coded Fourier Transform

Qian Yu, Mohammad Ali Maddah-Ali, A. Salman Avestimehr

We consider the problem of computing the Fourier transform of high-dimensional vectors, distributedly over a cluster of machines consisting of a master node and multiple worker nod…

cs.IT2017★ 382 cited

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…

cs.IT2017★ 9 cited

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…

cs.IT2017★ 9 cited

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…

cs.IT2016★ 278 cited

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…

cs.IT2016★ 3 cited

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…

cs.IT2016★ 29 cited

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…

cs.IT2015★ 1 cited

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…