16 citations · 58 across the 27 of their papers we have counts for
5 papers · 1 filter
Anchor-Changing Regularized Natural Policy Gradient for Multi-Objective Reinforcement Learning
Ruida Zhou, Tao Liu, Dileep Kalathil +2
We study policy optimization for Markov decision processes (MDPs) with multiple reward value functions, which are to be jointly optimized according to given criteria such as propor…
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…