Search Results for author:
Found 1 papers, 0 papers with code
Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits
To the best of our knowledge, this is the first work that shows how to achieve logarithmic regret in constrained contextual bandits.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
