10 citations · 31 across the 13 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LG2026
Replicable Dueling Bandits
Rohan Deb, Aadirupa Saha, Udaya Ghai +2
Dueling bandits choose each comparison based on earlier noisy outcomes, so two runs on the same preferences can compare different pairs. We study replicable dueling bandits, where…
cs.LG2026
Replicable Bandits with UCB based Exploration
Rohan Deb, Udaya Ghai, Karan Singh +1
We study replicable algorithms for stochastic multi-armed bandits (MAB) and linear bandits with UCB (Upper Confidence Bound) based exploration. A bandit algorithm is -replicable…