222 citations · 446 across the 26 of their papers we have counts for
27 papers
Lightweight Adaptive ReduNet via Hyperspherical Manifold Learning
Zhenglin Huang, Qifa Yan, Bin Dai +1
In recent years, a white-box neural network called ReduNet has been proposed, which employs the maximal coding rate reduction (MCR) principle to transform raw data into low-dim…
A Simple but Accurate Approximation for Multivariate Gaussian Rate-Distortion Function and Its Application in Maximal Coding Rate Reduction
Zhenglin Huang, Qifa Yan, Bin Dai +1
The multivariate Gaussian rate-distortion (RD) function is crucial in various applications, such as digital communications, data storage, or neural networks. However, the complex f…
A Fundamental Tradeoff Among Storage, Computation, and Communication for Distributed Computing over Star Network
Qifa Yan, Xiaohu Tang, Meixia Tao +1
Coded distributed computing can alleviate the communication load by leveraging the redundant storage and computation resources with coding techniques in distributed computing. In t…
Robust, Secure and Private Cache-aided Scalar Linear Function Retrieval from Distributed System with Blind and Adversarial Servers
Qifa Yan, Xiaohu Tang, Zhengchun Zhou
In this work, a distributed server system composed of multiple servers that holds some coded files and multiple users that are interested in retrieving the linear functions of the…
Multi-User Blind Symmetric Private Information Retrieval from Coded Servers
Jinbao Zhu, Qifa Yan, Xiaohu Tang
The problem of Multi-user Blind -secure -colluding Symmetric Private Information Retrieval from Maximum Distance Separable (MDS) coded storage system with Byzantine and $…
Coded Alternating Least Squares for Straggler Mitigation in Distributed Recommendations
Siyuan Wang, Qifa Yan, Jingjing Zhang +2
Matrix factorization is an important representation learning algorithm, e.g., recommender systems, where a large matrix can be factorized into the product of two low dimensional ma…
Improved Constructions for Secure Multi-Party Batch Matrix Multiplication
Jinbao Zhu, Qifa Yan, Xiaohu Tang
This paper investigates the problem of Secure Multi-party Batch Matrix Multiplication (SMBMM), where a user aims to compute the pairwise products $\mathbf{A}\divideontimes\mathbf{B…
Capacity-Achieving Private Information Retrieval Schemes from Uncoded Storage Constrained Servers with Low Sub-packetization
Jinbao Zhu, Qifa Yan, Xiaohu Tang +1
This paper investigates reducing sub-packetization of capacity-achieving schemes for uncoded Storage Constrained Private Information Retrieval (SC-PIR) systems. In the SC-PIR syste…
Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers
Qifa Yan, Daniela Tuninetti
This work investigates a system where each user aims to retrieve a scalar linear function of the files of a library, which are Maximum Distance Separable coded and stored at multip…
Symmetric Private Polynomial Computation From Lagrange Encoding
Jinbao Zhu, Qifa Yan, Xiaohu Tang +1
The problem of -secure -colluding symmetric Private Polynomial Computation (PPC) from coded storage system with Byzantine and unresponsive servers is studied in this…
Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval
Qifa Yan, Daniela Tuninetti
This work investigates the problem of cache-aided content Secure and demand Private Linear Function Retrieval (SP-LFR), where three constraints are imposed on the system:(a) each u…
Fundamental Limits of Caching for Demand Privacy against Colluding Users
Qifa Yan, Daniela Tuninetti
This work investigates the problem of demand privacy against colluding users for shared-link coded caching systems, where no subset of users can learn any information about the dem…
Adaptive Gradient Coding
Hankun Cao, Qifa Yan, Xiaohu Tang +1
This paper focuses on mitigating the impact of stragglers in distributed learning system. Unlike the existing results designed for a fixed number of stragglers, we developed a new…
A new Capacity-Achieving Private Information Retrieval Scheme with (Almost) Optimal File Length for Coded Servers
Jinbao Zhu, Qifa Yan, Chao Qi +1
In a distributed storage system, private information retrieval (PIR) guarantees that a user retrieves one file from the system without revealing any information about the identity…
A Fundamental Storage-Communication Tradeoff for Distributed Computing with Straggling Nodes
Qifa Yan, Michèle Wigger, Sheng Yang +1
Placement delivery arrays for distributed computing (Comp-PDAs) have recently been proposed as a framework to construct universal computing schemes for MapReduce-like systems. In t…
Storage, Computation, and Communication: A Fundamental Tradeoff in Distributed Computing
Qifa Yan, Sheng Yang, Michèle Wigger
We consider a MapReduce-like distributed computing system. We derive a lower bound on the communication cost for any given storage and computation costs. This lower bound matches t…
A Storage-Computation-Communication Tradeoff for Distributed Computing
Qifa Yan, Sheng Yang, Michèle Wigger
This paper investigates distributed computing systems where computations are split into "Map" and "Reduce" functions. A new coded scheme, called distributed computing and coded com…
Placement Delivery Array Design for Combination Networks with Edge Caching
Qifa Yan, Michèle Wigger, Sheng Yang
A major practical limitation of the Maddah-Ali-Niesen coded caching techniques is their high subpacketization level. For the simple network with a single server and multiple users,…
On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks
Jinyu Wang, Minquan Cheng, Qifa Yan +1
The coded caching scheme is an efficient technique as a solution to reduce the wireless network burden during the peak times in a Device-to-Device (D2D in short) communications. In…
On the Placement and Delivery Schemes for Decentralized Coded Caching System
Qifa Yan, Xiaohu Tang, Qingchun Chen
Network based on distributed caching of content is a new architecture to alleviate the ongoing explosive demands for rate of multi-media traffic. In caching networks, coded caching…
Constructions of Coded Caching Schemes with Flexible Memory Size
Minquan Cheng, Jing Jiang, Qifa Yan +1
Coded caching scheme recently has become quite popular in the wireless network due to its effectively reducing the transmission amount (denote such an amount by ) during peak tr…
Coded Caching Schemes with Low Rate and Subpacketizations
Minquan Cheng, Qifa Yan, Xiaohu Tang +1
Coded caching scheme, which is an effective technique to increase the transmission efficiency during peak traffic times, has recently become quite popular among the coding communit…
On the Coded Caching Delivery Design over Wireless Networks
Lei Zheng, Qifa Yan, Qingchun Chen +1
Coded caching scheme is a promising technique to migrate the network burden in peak hours, which attains more prominent gains than the uncoded caching. The coded caching scheme can…
The Optimal Placement Delivery Arrays
Minquan Cheng, Jing Jiang, Qifa Yan +2
In wireless networks, coded caching is an effective technique to reduce network congestion during peak traffic times. Recently, a new concept called placement delivery array (PDA)…