Google
Feb 15, 2021We study the top-k extreme contextual bandits problem, where the total number of arms can be enormous, and the learner is allowed to select k arms.
We implement our eXtreme contextual bandit algo- rithm with a hierarchical linear function class and test the performance of different exploration strate- gies�...
The relevant prior work can be broadly classified under the following three categories: General Contextual Bandits: The general contextual bandit problem�...
Search code, repositories, users, issues, pull requests... � Provide feedback � Saved searches � rajatsen91/XtremeContextualBandits � eXtreme Contextual Bandits.
Feb 15, 2021We implement our eXtreme contextual bandit algorithm with a hierarchical linear function class and test the performance of different exploration�...
People also ask
Top-k extreme contextual bandits with arm hierarchy. R Sen, A Rakhlin, L Ying, R Kidambi, D Foster, DN Hill, IS Dhillon. International Conference on Machine�...
Jul 19, 2021Top-k eXtreme Contextual Bandits with Arm Hierarchy. Jul 19, 2021. Speakers. RS � Rajat Sen. Speaker � 0 followers. Follow. AR � Alexander�...
Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits ... In batched multi-armed bandit problems, the learner can adaptively pull arms and adjust�...
Top-k eXtreme Contextual. Bandits with Arm Hierarchy. ICML. (2021). Yadav N, Sen R, Hill DN, Mazumdar A, Dhillon IS. Session-Aware Query Auto-completion using.
Top-k eXtreme contextual bandits with arm hierarchy � Rajat Sen, Alexander Rakhlin, Lexing Ying, Rahul Kidambi, Dean Foster, Daniel N. Hill, Inderjit S�...