Search Results for author: Subhashini Krishnasamy

Found 2 papers, 0 papers with code

Sample complexity of partition identification using multi-armed bandits

no code implementations14 Nov 2018 Sandeep Juneja, Subhashini Krishnasamy

We consider distributions belonging to the single parameter exponential family and primarily consider partitions where the vector of means of arms lie either in a given set or its complement.

Multi-Armed Bandits

Regret of Queueing Bandits

no code implementations NeurIPS 2016 Subhashini Krishnasamy, Rajat Sen, Ramesh Johari, Sanjay Shakkottai

A naive view of this problem would suggest that queue-regret should grow logarithmically: since queue-regret cannot be larger than classical regret, results for the standard MAB problem give algorithms that ensure queue-regret increases no more than logarithmically in time.

Cannot find the paper you are looking for? You can Submit a new open access paper.