3 papers
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 -replicabl…
cs.LG2025
Sample-Optimal Agnostic Boosting with Unlabeled Data
Udaya Ghai, Karan Singh
Boosting provides a practical and provably effective framework for constructing accurate learning algorithms from inaccurate rules of thumb. It extends the promise of sample-effici…
cs.LG2024
Sample-Efficient Agnostic Boosting
Udaya Ghai, Karan Singh
The theory of boosting provides a computational framework for aggregating approximate weak learning algorithms, which perform marginally better than a random predictor, into an acc…