WATANABE Ryo, KOMIYAMA Junpei, NAKAMURA Atsuyoshi, KUDO Mineichi
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E100.A
(11),
2470-2486,
2017
...In fact, our regret upper bound is at least four times better than that of BTS, the best known upper bound for the budgeted bandit problem....
DOI
HANDLE
Web Site
被引用文献1件
参考文献13件