Improving Fairness with Ensemble Combination: Margin-Dependent Bounds
cs.LG, cs.AI, cs.CY
Submitted: 2023-01-25
Updated: 2026-03-11
Comments: Accepted by ACM FAccT 2026. Code is available on https://github.com/eustomaqua/FairML
Code: https://github.com/eustomaqua/FairML
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Penalizing Unfairness in Binary Classification
- FAIR-Ensemble: When Fairness Naturally Emerges From Deep Ensembling
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks