Sep 11, 2017 · We view this problem through the lens of combinatorial pure exploration (CPE) in the multi-armed bandit setting, where a central learning ...
In this section, we propose a new multi-armed bandit algorithm, strong-weak arm-pulls (SWAP), that is parameterized by s and j. SWAP uses a combination of ...
In this section, we propose a new multi-armed bandit algorithm, strong-weak arm-pulls (SWAP), that is parameterized by s and j. SWAP uses a combination of ...
Sep 15, 2017 · We view this problem through the lens of combinatorial pure exploration (CPE) in the multi-armed bandit setting, where a central learning agent ...
How should a firm allocate its limited interviewing resources to select the optimal cohort of new employees from a large set of job applicants?
We model this as a Multi-Arm Bandit (MAB) problem and propose DPSS-UCB to learn the qualities over multiple rounds. We show that after a certain number of ...
We view this problem through the lens of combinatorialpure exploration (CPE) in the multi-armed bandit setting, where a centrallearning agent ...
Abstract:How should a firm allocate its limited interviewing resources to select the optimal cohort of new employees from a large set of job applicants?
Missing: Varied | Show results with:Varied
... {{The Diverse Cohort Selection Problem: Multi-Armed Bandits with Varied Pulls}}, institution = {CoRR}, year = {2017}, number = {arXiv:1503.07792}, month ...
Connected Papers is a visual tool to help researchers and applied scientists find academic papers relevant to their field of work.