Formalizes SBFC problem and introduces T-a-S-CS algorithm that achieves instance-specific lower bound on sample complexity asymptotically for fair policy selection.
(2014), which provides conditions for the continuity of an infimum value function when the constraint set depends on the parameter
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.