Neyman-Pearson Classification under Both Null and Alternative Distributions Shift
Not on the map. Why?
Abstract (arXiv)
We consider the problem of transfer learning in Neyman-Pearson classification, where the objective is to minimize the error w.r.t. a distribution μ1, subject to the constraint that the error w.r.t. a distribution μ0 remains below a prescribed threshold. While transfer learning has been extensively studied in traditional classification, transfer learning in imbalanced classification such as Neyman-Pearson classification has received much less attention. This setting poses unique challenges, as both types of errors must be simultaneously controlled. Existing works address only the case of distribution shift in μ1, whereas in many practical scenarios shifts may occur in both μ0 and μ1. We derive an adaptive procedure that not only guarantees improved Type-I and Type-II errors when the source is informative, but also automatically adapt to situations where the source is uninformative, thereby avoiding negative transfer. In addition to such statistical guarantees, the procedures is efficient, as shown via complementary computational guarantees.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 11 of its 31 references that are in the map. First posted on arXiv 10 Nov 2025.
Builds on
11 of 31 references.
References · 11
- 2021Convex optimizationcited by 2,479
- 2017Size-Independent Sample Complexity of Neural Networkscited by 289
- 2020On the Theory of Transfer Learning: The Importance of Task Diversitycited by 186
- 2020Transfer Learning for High-dimensional Linear Regression: Prediction, Estimation, and Minimax Optimalitycited by 89
- 2018Marginal Singularity, and the Benefits of Labels in Covariate-Shiftcited by 65
- 2020On the Value of Target Data in Transfer Learningcited by 62
- 2020Minimax Lower Bounds for Transfer Learning with Linear and One-hidden Layer Neural Networkscited by 30
- 2019EDIMA: Early Detection of IoT Malware Network Activity Using Machine Learning Techniquescited by 8
- 2025Transfer Neyman-Pearson Algorithm for Outlier Detectioncited by 4
- 2023Tight Rates in Supervised Outlier Transfer Learningcited by 3
- 2024Distribution-Free Rates in Neyman-Pearson Classificationcited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.