Robust Pure Exploration in Linear Bandits with Limited Budget
Ayya Alieva 1 Ashok Cutkosky 2 Abhimanyu Das 3
Abstract the exploration phase should be somehow efficient - we
wish to make the best use of our limited budget in order to
We consider the pure exploration problem in the
maximize the chance that our final decision is the best one.
fixed-budget linear bandit setting. ...


雷达卡




京公网安备 11010802022788号







