29 citations · 65 across the 14 of their papers we have counts for
Showing 2018 · stat.MLShow all
2 papers · 2 filters
stat.ML2018
Simple Regret Minimization for Contextual Bandits
Aniket Anand Deshmukh, Srinagesh Sharma, James W. Cutler +2
There are two variants of the classical multi-armed bandit (MAB) problem that have received considerable attention from machine learning researchers in recent years: contextual ban…
stat.ML2018
A Generalized Neyman-Pearson Criterion for Optimal Domain Adaptation
Clayton Scott
In the problem of domain adaptation for binary classification, the learner is presented with labeled examples from a source domain, and must correctly classify unlabeled examples f…