Follow
Wenbo Ren
Title
Cited by
Cited by
Year
Multi-armed bandits with local differential privacy
W Ren, X Zhou, J Liu, NB Shroff
arXiv preprint arXiv:2007.03121, 2020
212020
PAC ranking from pairwise and listwise queries: Lower bounds and upper bounds
W Ren, J Liu, NB Shroff
arXiv preprint arXiv:1806.02970, 2018
182018
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
112019
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
102019
The Sample Complexity of Best- Items Selection from Pairwise Comparisons
W Ren, J Liu, N Shroff
International Conference on Machine Learning, 8051-8072, 2020
72020
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
12021
A Blueprint for Effective Pandemic Mitigation
R Singh, W Ren, F Liu, D Xuan, Z Lin, NB Shroff
ITU journal, 2020
12020
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
2021
Active Learning for Ranking from Noisy Observations
W Ren
The Ohio State University, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–9