A Generalized Neyman-Pearson Criterion for Optimal Domain Adaptation
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 from a target domain, which may differ from the source. Previous work on this problem has assumed that the performance measure of interest is the expected value of some loss function. We introduce a new Neyman-Pearson-like criterion and argue that, for this optimality criterion, stronger domain adaptation results are possible than what has previously been established. In particular, we study a class of domain adaptation problems that generalizes both the covariate shift assumption and a model for feature-dependent label noise, and establish optimal classification on the target domain despite not having access to labelled data from this domain.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationDomain AdaptationGeneral ClassificationSimilar Papers 제목 키워드 기반
Bounding Neyman-Pearson Region with $f$-Divergences
The Neyman-Pearson region of a simple binary hypothesis testing is the set of points whose coordinates represent the false positive rate and false negative rate of some test. The lower boundary of this region is given by…
LEMMADSP-Enhanced OTDR for Detection and Estimation of Events in PONs
To plan a rapid response and minimize operational costs, passive optical network operators require to automatically detect and identify faults that may occur in the optical distribution network. In this work, we present …
Generalised Likelihood Ratio Testing Adversaries through the Differential Privacy Lens
Differential Privacy (DP) provides tight upper bounds on the capabilities of optimal adversaries, but such adversaries are rarely encountered in practice. Under the hypothesis testing/membership inference interpretation …
Bayes-Optimal Classifiers under Group Fairness
Machine learning algorithms are becoming integrated into more and more high-stakes decision-making processes, such as in social welfare issues. Due to the need of mitigating the potentially disparate impacts from algorit…
BIG-bench Machine LearningDecision MakingFairnessLow-complexity Distributed Detection with One-bit Memory Under Neyman-Pearson Criterion
We consider a multi-stage distributed detection scenario, where $n$ sensors and a fusion center (FC) are deployed to accomplish a binary hypothesis test. At each time stage, local sensors generate binary messages, assume…
Decision Making