TightFirst-andSecond-OrderRegretBounds forAdversarialLinearBandits

In addition, we need only assumptions weaker than those of existing algorithms; our algorithms work on discrete action sets as well as continuous ones without apriori knowledge about losses, and theyrun efficiently ifalinear optimization oracle for the action set is available.