Formalizes SBFC problem and introduces T-a-S-CS algorithm that achieves instance-specific lower bound on sample complexity asymptotically for fair policy selection.
D.3 Proof of Corollary 13 The proof of this corollary follows the same structure as that of Theorem 10 in Appendix D.1
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Selection of the Best Policy under Fairness Constraints for Subpopulations
Formalizes SBFC problem and introduces T-a-S-CS algorithm that achieves instance-specific lower bound on sample complexity asymptotically for fair policy selection.