arXiv (All)
open access
Classification with Abstention Under Class-Conditional Error Constraints
We study binary classification with abstention under separate class-conditional error constraints, with the objective of minimizing abstention while keeping both errors below prescribed thresholds. We characterize the distribution-free minimax rate of excess abstention risk, up to logarithmic factor
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- gsdf/EasyNegative#786501
- Observational Multiplicity#1110107
- Partial AUC Maximization from Positive-unlabeled Data#1154907
- Contextual Distributionally Robust Chance-Constrained Programs: Exact Reformulations and Valid Inequalities#1049474
- Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors#1037298
Record · ID 1037315
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive