Open AccessNear-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions
Author(s) -
Kei Takemura,
Shinji Ito,
Daisuke Hatano,
Hanna Sumita,
Takuro Fukunaga,
Naonori Kakimura,
Kenichi Kawarabayashi
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v35i11.17177
Subject(s) - regret , upper and lower bounds , logarithm , matroid , stochastic game , mathematics , mathematical optimization , dimension (graph theory) , linear programming , computer science , combinatorics , discrete mathematics , mathematical economics , mathematical analysis , statistics
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom