arXiv (All)
open access
Accuracy vs. Accuracy: Computational Tradeoffs Between Classification Rates and Utility
We revisit the foundations of fairness and its interplay with utility and efficiency in settings where the training data contain richer labels, such as individual types, rankings, or risk estimates, rather than just binary outcomes. In this context, we propose algorithms that achieve stronger notion
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
- Missing the missing values: The ugly duckling of fairness in machine learning#383471
- Fair Decisions from Calibrated Scores: Achieving Optimal Classification While Satisfying Sufficiency#1389191
- Perturbation Sensitivity of Maximum-Likelihood Pairwise Ranking in Computational Decision Systems#798856
- Perturbation Sensitivity of Maximum-Likelihood Pairwise Ranking in Computational Decision Systems#797442
- Fair Variable Selection#1144452
Record · ID 1467001
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