Multi-armed bandits with local differential privacy W Ren, X Zhou, J Liu, NB Shroff
arXiv preprint arXiv:2007.03121, 2020
46 2020 PAC ranking from pairwise and listwise queries: Lower bounds and upper bounds W Ren, J Liu, NB Shroff
arXiv preprint arXiv:1806.02970, 2018
29 2018 On sample complexity upper and lower bounds for exact ranking from noisy comparisons W Ren, J Liu, NB Shroff
Advances in Neural Information Processing Systems 32, 2019
20 2019 Exploring out of Top Fraction of Arms in Stochastic Bandits W Ren, J Liu, NB Shroff
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
16 2019 The Sample Complexity of Best- Items Selection from Pairwise Comparisons W Ren, J Liu, N Shroff
International Conference on Machine Learning, 8051-8072, 2020
12 2020 Sample complexity bounds for active ranking from multi-wise comparisons W Ren, J Liu, N Shroff
Advances in Neural Information Processing Systems 34, 4290-4300, 2021
4 2021 On logarithmic regret for bandits with knapsacks W Ren, J Liu, NB Shroff
2021 55th Annual Conference on Information Sciences and Systems (CISS), 1-6, 2021
3 2021 A Blueprint for Effective Pandemic Mitigation R Singh, W Ren, F Liu, D Xuan, Z Lin, NB Shroff
ITU journal, 2020
3 * 2020 Active Learning for Ranking from Noisy Observations W Ren
The Ohio State University, 2021
2021