7 citations · 19 across the 11 of their papers we have counts for
Showing 2018 · cs.LGShow all
2 papers · 2 filters
cs.LG2018
Unifying the stochastic and the adversarial Bandits with Knapsack
Anshuka Rangi, Massimo Franceschetti, Long Tran-Thanh
This paper investigates the adversarial Bandits with Knapsack (BwK) online learning problem, where a player repeatedly chooses to perform an action, pays the corresponding cost, an…
cs.LG2018
Online learning with feedback graphs and switching costs
Anshuka Rangi, Massimo Franceschetti
We study online learning when partial feedback information is provided following every action of the learning process, and the learner incurs switching costs for changing his actio…