Qian Yu

Orcid: 0000-0002-2034-5941

Affiliations:
  • University of Southern California, Los Angeles, USA


According to our database1, Qian Yu authored at least 25 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations.
IEEE Trans. Inf. Theory, 2024

2022
LightSecAgg: a Lightweight and Versatile Design for Secure Aggregation in Federated Learning.
Proceedings of the Fifth Conference on Machine Learning and Systems, 2022

2021
Coded Computing for Resilient, Secure, and Privacy-Preserving Distributed Matrix Multiplication.
IEEE Trans. Commun., 2021

LightSecAgg: Rethinking Secure Aggregation in Federated Learning.
CoRR, 2021

2020
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Download and Access Trade-offs in Lagrange Coded Computing.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Lagrange Coded Computing: Optimal Design for Resiliency, Security, and Privacy.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing.
IEEE Trans. Inf. Theory, 2018

Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy.
CoRR, 2018

Polynomially Coded Regression: Optimal Straggler Mitigation via Data Encoding.
CoRR, 2018

Coding for Private and Secure Multiparty Computing.
Proceedings of the IEEE Information Theory Workshop, 2018

Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
A Scalable Framework for Wireless Distributed Computing.
IEEE/ACM Trans. Netw., 2017

Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Communication-optimal coding designs for caching networks.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

The exact rate-memory tradeoff for caching with uncoded prefetching.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Characterizing the rate-memory tradeoff in cache networks within a factor of 2.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

How to optimally allocate resources for coded distributed computing?
Proceedings of the IEEE International Conference on Communications, 2017

Coded fourier transform.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Edge-Facilitated Wireless Distributed Computing.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

Poster Abstract: A Scalable Coded Computing Framework for Edge-Facilitated Wireless Distributed Computing.
Proceedings of the IEEE/ACM Symposium on Edge Computing, 2016

Coded distributed computing: Fundamental limits and practical challenges.
Proceedings of the 50th Asilomar Conference on Signals, Systems and Computers, 2016

2015
The Asymptotic Solutions of the Capacity Maximal Quantization Problem.
Proceedings of the IEEE 82nd Vehicular Technology Conference, 2015


  Loading...