On the Minimax Regret for Linear Bandits in a wide variety of Action Spaces

01/09/2023
by   Debangshu Banerjee, et al.
0

As noted in the works of <cit.>, it has been mentioned that it is an open problem to characterize the minimax regret of linear bandits in a wide variety of action spaces. In this article we present an optimal regret lower bound for a wide class of convex action spaces.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro