Research map / Learning theory and algorithms / Fairness
Fair Classification with Efficient and Post-hoc Controllable Fairness-Accuracy Trade-off
Maaya Sakata, Kazuto Fukuchi
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use GFB representation learning instead of FairBayes post-processing alone | post-hoc fair classifier · CelebA | hypervolume: 0.7257 -> 0.8198 | Improved |
| use GFB instead of FairBayes | post-hoc fair classifier · Adult | hypervolume: 0.7850 -> 0.8007 | Improved |
| use GFB instead of YOTO | post-hoc controllable classifier · CelebA | hypervolume: 0.6068 -> 0.8198 | Improved |
| use GFB instead of FairBayes | post-hoc fair classifier · UTKFace | inverted hypervolume: 0.1556 -> 0.1010 | Improved |
| use GFB instead of EPO | in-processing multi-objective method · COMPAS | hypervolume: 0.8191 -> 0.8164 | Hurt |
| use GFB instead of EPO | in-processing multi-objective method · CelebA | hypervolume: 0.7733 -> 0.8198 | Improved |
| use GFB instead of EPO | in-processing multi-objective method · UTKFace | inverted hypervolume: 0.4443 -> 0.1010 | Improved |
| use GFB instead of FairBiNN | bi-level in-processing method · CelebA | hypervolume: 0.6919 -> 0.8198 | Improved |
| use GFB instead of FairBiNN | bi-level in-processing method · UTKFace | hypervolume: 0.8876 -> 0.8581 | Hurt |
| use GFB instead of FairBiNN | bi-level in-processing method · COMPAS | hypervolume: 0.8409 -> 0.8164 | Hurt |
| use GFB instead of FairBiNN | bi-level in-processing method · COMPAS | inverted hypervolume: 0.2155 -> 0.1398 | Improved |
| use GFB instead of YOTO | post-hoc controllable classifier · COMPAS | inverted hypervolume: 0.3661 -> 0.1398 | Improved |
Closest papers by meaning
- Fair and Optimal Classification via Post-Processing (ICML 2023 · similarity 0.90)
- Efficient Fairness-Performance Pareto Front Computation (NeurIPS 2025 · similarity 0.87)
- Post-hoc bias scoring is optimal for fair classification (ICLR 2024 · similarity 0.86)
- Fair Bilevel Neural Network (FairBiNN): On Balancing fairness and accuracy via Stackelberg Equilibrium (NeurIPS 2024 · similarity 0.86)
- Differentially Private Post-Processing for Fair Regression (ICML 2024 · similarity 0.86)
- FairNet: Dynamic Fairness Correction without Performance Loss via Contrastive Conditional LoRA (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
