1 citations · 2 across the 7 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2024
Optimal cross-learning for contextual bandits with unknown context distributions
Jon Schneider, Julian Zimmert
We consider the problem of designing contextual bandit algorithms in the ``cross-learning'' setting of Balseiro et al., where the learner observes the loss for the action they play…
cs.LG2023★ 1 cited
Pseudonorm Approachability and Applications to Regret Minimization
Christoph Dann, Yishay Mansour, Mehryar Mohri +2
Blackwell's celebrated approachability theory provides a general framework for a variety of learning problems, including regret minimization. However, Blackwell's proof and implici…