all AI news
Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget. (arXiv:2202.04487v2 [cs.LG] UPDATED)
Oct. 17, 2022, 1:14 a.m. | Jasmin Brandt, Viktor Bengs, Björn Haddenhorst, Eyke Hüllermeier
stat.ML updates on arXiv.org arxiv.org
We consider the combinatorial bandits problem with semi-bandit feedback under
finite sampling budget constraints, in which the learner can carry out its
action only for a limited number of times specified by an overall budget. The
action is to choose a set of arms, whereupon feedback for each arm in the
chosen set is received. Unlike existing works, we study this problem in a
non-stochastic setting with subset-dependent feedback, i.e., the semi-bandit
feedback received could be generated by an oblivious …
More from arxiv.org / stat.ML updates on arXiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Technology Consultant Master Data Management (w/m/d)
@ SAP | Walldorf, DE, 69190
Research Engineer, Computer Vision, Google Research
@ Google | Nairobi, Kenya