pith. sign in

arxiv: 1906.02589 · v1 · pith:DIWBKNYVnew · submitted 2019-06-06 · 💻 cs.LG · cs.AI· stat.ML

Flexibly Fair Representation Learning by Disentanglement

classification 💻 cs.LG cs.AIstat.ML
keywords learningattributesfairrepresentationsensitivesubgroupachieveflexibly
0
0 comments X
read the original abstract

We consider the problem of learning representations that achieve group and subgroup fairness with respect to multiple sensitive attributes. Taking inspiration from the disentangled representation learning literature, we propose an algorithm for learning compact representations of datasets that are useful for reconstruction and prediction, but are also \emph{flexibly fair}, meaning they can be easily modified at test time to achieve subgroup demographic parity with respect to multiple sensitive attributes and their conjunctions. We show empirically that the resulting encoder---which does not require the sensitive attributes for inference---enables the adaptation of a single representation to a variety of fair classification tasks with new target labels and subgroup definitions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Cumulative Meta-Learning from Active Learning Queries for Robustness to Spurious Correlations

    cs.LG 2026-05 unverdicted novelty 7.0

    CAML meta-learns a progressively refined inductive bias from active-learning queries to improve robustness to spurious correlations, reporting accuracy gains on minority groups across several benchmarks.