Metraipolis › archive › dc_4d42438457a6

FairSplit: Decomposing the Embedding Space for Fair Classification — arXiv:2610.39031

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39031
License (as archived)
CC0-1.0
Archived
2026-11-01T02:24:58.295Z
SHA-256 of the archived text
5deb2f4d83e44f16bbde9dd4aa091e241a859296cefd49b5a25e3d1f4c9132a0
Stable URL of this page
https://metraipolis.com/documento/dc_4d42438457a6

How to cite

FairSplit: Decomposing the Embedding Space for Fair Classification — arXiv:2610.39031 — arXiv (en), https://arxiv.org/abs/2610.39031 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4d42438457a6 (Metraipolis archive dc_4d42438457a6, sha256 5deb2f4d83e44f16bbde9dd4aa091e241a859296cefd49b5a25e3d1f4c9132a0)
BibTeX
@misc{dc4d42438457a6,
  title = {FairSplit: Decomposing the Embedding Space for Fair Classification — arXiv:2610.39031},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39031},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4d42438457a6; sha256 5deb2f4d83e44f16bbde9dd4aa091e241a859296cefd49b5a25e3d1f4c9132a0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39031. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Fair classification faces a twofold challenge: maintaining high classification accuracy while limiting reliance on sensitive information. Our method FairSplit achieves this by learning a decomposition of the embedding space into a Fair Space used for prediction and a Sensitive Space that isolates sensitive information. During training, the model must simultaneously learn the classification task and separate fair from sensitive information. The Sensitive Space gives sensitive attributes a destination, so the Fair Space can be used for prediction without relying on them. This decomposition is guided via a learnable mask and the Hilbert-Schmidt Independence Criterion (HSIC) as a measure of statistical dependence. We provide theoretical guarantees showing that the demographic parity gap is upper-bounded by both (i) the learned dimensionality of the Fair Space and (ii) the HSIC between the Fair Space and sensitive attributes. FairSplit effectively handles multiclass tasks and non-binary sensitive attributes, overcoming key limitations of existing fair classification methods. Experiments on established fairness benchmarks show that FairSplit achieves competitive accuracy-fairness trade-offs. Code is available at this https URL .

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.39031 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:12:44.149Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).