Distribution-Free Rates in Neyman-Pearson Classification

원문 초록

We consider the problem of Neyman-Pearson classification which models unbalanced classification settings where error w.r.t. a distribution $\mu_1$ is to be minimized subject to low error w.r.t. a different distribution $\mu_0$. Given a fixed VC class $\mathcal{H}$ of classifiers to be minimized over, we provide a full characterization of possible distribution-free rates, i.e., minimax rates over the space of all pairs $(\mu_0, \mu_1)$. The rates involve a dichotomy between hard and easy classes $\mathcal{H}$ as characterized by a simple geometric condition, a three-points-separation condition, loosely related to VC dimension.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

arXiv:2507.12292공통 태그 Classification공식 코드 · Papers with Code 등록 2025-07-16

Efficient Calisthenics Skills Classification through Foreground Instance Selection and Depth Estimation

arXiv:2507.09759공통 태그 Classification공식 코드 · Papers with Code 등록 2025-07-13

AI-Enhanced Pediatric Pneumonia Detection: A CNN-Based Approach Using Data Augmentation and Generative Adversarial Networks (GANs)

arXiv:2507.03421공통 태그 Classification공식 코드 · Papers with Code 등록 2025-07-04

토론

이 논문과 연결된 포럼 글이 아직 없습니다.

포럼에서 토론 찾기

Distribution-Free Rates in Neyman-Pearson Classification

원문 초록

함께 살펴볼 논문

Efficient Calisthenics Skills Classification through Foreground Instance Selection and Depth Estimation

AI-Enhanced Pediatric Pneumonia Detection: A CNN-Based Approach Using Data Augmentation and Generative Adversarial Networks (GANs)

Hybrid-View Attention for csPCa Classification in TRUS

One Prototype Is Enough: Single-Prototype Activation for Interpretable Image Classification

Brain-inspired interpretable reservoir computing with resonant recurrent neural networks

Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy

토론