Latent Imitator: Generating Natural Individual Discriminatory Instances for Black-Box Fairness Testing

• URL: http://arxiv.org/abs/2305.11602v1
• Date: Fri, 19 May 2023 11:29:13 GMT
• Title: Latent Imitator: Generating Natural Individual Discriminatory Instances for Black-Box Fairness Testing
• Authors: Yisong Xiao, Aishan Liu, Tianlin Li, and Xianglong Liu
• Abstract summary: This paper proposes a framework named Latent Imitator (LIMI) to generate more natural individual discriminatory instances. We first derive a surrogate linear boundary to approximate the decision boundary of the target model. We then manipulate random latent vectors to the surrogate boundary with a one-step movement, and further conduct vector calculation to probe two potential discriminatory candidates.
• Score: 45.183849487268496
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Machine learning (ML) systems have achieved remarkable performance across a wide area of applications. However, they frequently exhibit unfair behaviors in sensitive application domains, raising severe fairness concerns. To evaluate and test fairness, engineers often generate individual discriminatory instances to expose unfair behaviors before model deployment. However, existing baselines ignore the naturalness of generation and produce instances that deviate from the real data distribution, which may fail to reveal the actual model fairness since these unnatural discriminatory instances are unlikely to appear in practice. To address the problem, this paper proposes a framework named Latent Imitator (LIMI) to generate more natural individual discriminatory instances with the help of a generative adversarial network (GAN), where we imitate the decision boundary of the target model in the semantic latent space of GAN and further samples latent instances on it. Specifically, we first derive a surrogate linear boundary to coarsely approximate the decision boundary of the target model, which reflects the nature of the original data distribution. Subsequently, to obtain more natural instances, we manipulate random latent vectors to the surrogate boundary with a one-step movement, and further conduct vector calculation to probe two potential discriminatory candidates that may be more closely located in the real decision boundary. Extensive experiments on various datasets demonstrate that our LIMI outperforms other baselines largely in effectiveness ($\times$9.42 instances), efficiency ($\times$8.71 speeds), and naturalness (+19.65%) on average. In addition, we empirically demonstrate that retraining on test samples generated by our approach can lead to improvements in both individual fairness (45.67% on $IF_r$ and 32.81% on $IF_o$) and group fairness (9.86% on $SPD$ and 28.38% on $AOD$}).

Related papers

• Cost Efficient Fairness Audit Under Partial Feedback [14.57835291220813]
  We study the problem of auditing the fairness of a given classifier under partial feedback.<n>We introduce a novel cost model for acquiring additional labeled data.<n>We show that our algorithms consistently outperform natural baselines by around 50% in terms of audit cost.
  arXiv  Detail & Related papers  (2025-10-04T08:38:03Z)
• Fairness Without Harm: An Influence-Guided Active Sampling Approach [32.173195437797766]
  We aim to train models that mitigate group fairness disparity without causing harm to model accuracy. The current data acquisition methods, such as fair active learning approaches, typically require annotating sensitive attributes. We propose a tractable active data sampling algorithm that does not rely on training group annotations.
  arXiv  Detail & Related papers  (2024-02-20T07:57:38Z)
• Bi-discriminator Domain Adversarial Neural Networks with Class-Level Gradient Alignment [87.8301166955305]
  We propose a novel bi-discriminator domain adversarial neural network with class-level gradient alignment. BACG resorts to gradient signals and second-order probability estimation for better alignment of domain distributions. In addition, inspired by contrastive learning, we develop a memory bank-based variant, i.e. Fast-BACG, which can greatly shorten the training process.
  arXiv  Detail & Related papers  (2023-10-21T09:53:17Z)
• Causal Fair Machine Learning via Rank-Preserving Interventional Distributions [0.5062312533373299]
  We define individuals as being normatively equal if they are equal in a fictitious, normatively desired (FiND) world. We propose rank-preserving interventional distributions to define a specific FiND world in which this holds. We show that our warping approach effectively identifies the most discriminated individuals and mitigates unfairness.
  arXiv  Detail & Related papers  (2023-07-24T13:46:50Z)
• Delving into Identify-Emphasize Paradigm for Combating Unknown Bias [52.76758938921129]
  We propose an effective bias-conflicting scoring method (ECS) to boost the identification accuracy. We also propose gradient alignment (GA) to balance the contributions of the mined bias-aligned and bias-conflicting samples. Experiments are conducted on multiple datasets in various settings, demonstrating that the proposed solution can mitigate the impact of unknown biases.
  arXiv  Detail & Related papers  (2023-02-22T14:50:24Z)
• Domain-Specific Risk Minimization for Out-of-Distribution Generalization [104.17683265084757]
  We first establish a generalization bound that explicitly considers the adaptivity gap. We propose effective gap estimation methods for guiding the selection of a better hypothesis for the target. The other method is minimizing the gap directly by adapting model parameters using online target samples.
  arXiv  Detail & Related papers  (2022-08-18T06:42:49Z)
• Cross-model Fairness: Empirical Study of Fairness and Ethics Under Model Multiplicity [10.144058870887061]
  We argue that individuals can be harmed when one predictor is chosen ad hoc from a group of equally well performing models. Our findings suggest that such unfairness can be readily found in real life and it may be difficult to mitigate by technical means alone.
  arXiv  Detail & Related papers  (2022-03-14T14:33:39Z)
• xFAIR: Better Fairness via Model-based Rebalancing of Protected Attributes [15.525314212209564]
  Machine learning software can generate models that inappropriately discriminate against specific protected social groups. We propose xFAIR, a model-based extrapolation method, that is capable of both mitigating bias and explaining the cause.
  arXiv  Detail & Related papers  (2021-10-03T22:10:14Z)
• Automatic Fairness Testing of Neural Classifiers through Adversarial Sampling [8.2868128804393]
  We propose a scalable and effective approach for systematically searching for discriminative samples. Compared with state-of-the-art methods, our approach only employs lightweight procedures like gradient computation and clustering. The retrained models reduce discrimination by 57.2% and 60.2% respectively on average.
  arXiv  Detail & Related papers  (2021-07-17T03:47:08Z)
• Scalable Personalised Item Ranking through Parametric Density Estimation [53.44830012414444]
  Learning from implicit feedback is challenging because of the difficult nature of the one-class problem. Most conventional methods use a pairwise ranking approach and negative samplers to cope with the one-class problem. We propose a learning-to-rank approach, which achieves convergence speed comparable to the pointwise counterpart.
  arXiv  Detail & Related papers  (2021-05-11T03:38:16Z)
• ExGAN: Adversarial Generation of Extreme Samples [33.70161373245072]
  Mitigating the risk arising from extreme events is a fundamental goal with many applications. Existing approaches based on Generative Adversarial Networks (GANs) excel at generating realistic samples. We propose ExGAN, a GAN-based approach to generate realistic and extreme samples.
  arXiv  Detail & Related papers  (2020-09-17T17:59:36Z)
• Estimating Generalization under Distribution Shifts via Domain-Invariant Representations [75.74928159249225]
  We use a set of domain-invariant predictors as a proxy for the unknown, true target labels. The error of the resulting risk estimate depends on the target risk of the proxy model.
  arXiv  Detail & Related papers  (2020-07-06T17:21:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.