6 citations · 8 across the 4 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2023
Oracle Efficient Algorithms for Groupwise Regret
Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan +2
We study the problem of online prediction, in which at each time step , an individual arrives, whose label we must predict. Each individual is associated with various grou…
cs.LG2018★ 6 cited
A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem
Sampath Kannan, Jamie Morgenstern, Aaron Roth +2
Bandit learning is characterized by the tension between long-term exploration and short-term exploitation. However, as has recently been noted, in settings in which the choices of…