6 citations · 10 across the 6 of their papers we have counts for
11 papers
Improved Weakly Private Information Retrieval Codes
Chengyuan Qian, Ruida Zhou, Chao Tian +1
We study the problem of weakly private information retrieval (W-PIR), where a user wishes to retrieve a desired message from non-colluding servers in a way that the privacy lea…
On Top- Selection from -wise Partial Rankings via Borda Counting
Wenjing Chen, Ruida Zhou, Chao Tian +1
We analyze the performance of the Borda counting algorithm in a non-parametric model. The algorithm needs to utilize probabilistic rankings of the items within -sized subsets to…
Approximate Top- Arm Identification with Heterogeneous Reward Variances
Ruida Zhou, Chao Tian
We study the effect of reward variance heterogeneity in the approximate top- arm identification setting. In this setting, the reward for the -th arm follows a -sub-Gau…
Stochastic Chaining and Strengthened Information-Theoretic Generalization Bounds
Ruida Zhou, Chao Tian, Tie Liu
We propose a new approach to apply the chaining technique in conjunction with information-theoretic measures to bound the generalization error of machine learning algorithms. Diffe…
Individually Conditional Individual Mutual Information Bound on Generalization Error
Ruida Zhou, Chao Tian, Tie Liu
We propose a new information-theoretic bound on generalization error based on a combination of the error decomposition technique of Bu et al. and the conditional mutual information…
New Results on the Storage-Retrieval Tradeoff in Private Information Retrieval Systems
Tao Guo, Ruida Zhou, Chao Tian
In a private information retrieval (PIR) system, the user needs to retrieve one of the possible messages from a set of storage servers, but wishes to keep the identity of requested…