28 citations · 46 across the 6 of their papers we have counts for
5 papers · 1 filter
Multi-Armed Bandits with Local Differential Privacy
Wenbo Ren, Xingyu Zhou, Jia Liu +1
This paper investigates the problem of regret minimization for multi-armed bandit (MAB) problems with local differential privacy (LDP) guarantee. In stochastic bandit systems, the…
The Sample Complexity of Best- Items Selection from Pairwise Comparisons
Wenbo Ren, Jia Liu, Ness B. Shroff
This paper studies the sample complexity (aka number of comparisons) bounds for the active best- items selection from pairwise comparisons. From a given set of items, the learne…
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons
Wenbo Ren, Jia Liu, Ness B. Shroff
This paper studies the problem of finding the exact ranking from noisy comparisons. A comparison over a set of items produces a noisy outcome about the most preferred item, and…
Exploring out of Top Fraction of Arms in Stochastic Bandits
Wenbo Ren, Jia Liu, Ness Shroff
This paper studies the problem of identifying any distinct arms among the top fraction (e.g., top 5\%) of arms from a finite or infinite set with a probably approximately c…
PAC Ranking from Pairwise and Listwise Queries: Lower Bounds and Upper Bounds
Wenbo Ren, Jia Liu, Ness B. Shroff
This paper explores the adaptive (active) PAC (probably approximately correct) top- ranking (i.e., top- item selection) and total ranking problems from -wise () c…