A Joint-Distribution Route to Fair Representations with Continuous Sensitive Attributes
Not on the map. Why?
Abstract (arXiv)
Fair representation learning with a continuous sensitive attribute S requires a representation Z that is statistically independent of S. Existing criteria, including generalized demographic parity, the expectation of integral probability metrics (EIPM), and mutual information, enforce this independence by averaging a per-value discrepancy between the conditional law PZ mid S=s and the marginal PZ over the law of S. This approach requires a nonparametric surrogate for the conditional law at each sensitive value. We propose evaluating independence through a single joint discrepancy dleft(PZ, S, PZ otimes PSright) between the joint law and the product of its marginals. We establish a disintegration identity; on decomposable witness classes it equals the conditional-integral functional that EIPM and generalized demographic parity instantiate. By reaching the same target without the conditional law, this discrepancy can be estimated directly from samples via a dependence statistic rather than conditional smoothing. We take the Hilbert-Schmidt independence criterion (HSIC) as an instance of the joint discrepancy d to investigate the statistical efficiency of replacing the conditional formulation. The HSIC estimator is a closed-form Oleft(n2right) statistic that converges at the Oleft(n-1 / 2right) rate, in contrast to the nonparametric Oleft(n-2 / 5right) rate of the conditional-route estimators. We prove this instance is equivalent to the conditional maximum mean discrepancy (MMD) integral up to an explicit spectral tail. The corresponding algorithmic implementation, i.e., FRHSIC, attains fairness-accuracy tradeoffs comparable to conditional-route basel es while reducing per-epoch training time.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 39 references that are in the map. First posted on arXiv 11 Aug 2026.
Builds on
14 of 39 references.
References · 14
- 2017Counterfactual Fairnesscited by 804
- 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 449
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
- 2015The Variational Fair Autoencodercited by 223
- 2019Flexibly Fair Representation Learning by Disentanglementcited by 196
- 2019The HSIC Bottleneck: Deep Learning without Back-Propagationcited by 77
- 2020Achieving Equalized Odds by Resampling Sensitive Attributescited by 42
- 2017Characteristic and Universal Tensor Product Kernelscited by 41
- 2017Fair Kernel Learningcited by 39
- 2021Fairness without the sensitive attribute via Causal Variational Autoencodercited by 21
- 2019Kernel Dependence Regularizers and Gaussian Processes with Applications to Algorithmic Fairnesscited by 16
- 2022MMD-B-Fair: Learning Fair Representations with Statistical Testingcited by 13
Built on by
Not cited yet.