Fair Dataset Distillation via Cross-Group Barycenter Alignment

• URL: http://arxiv.org/abs/2605.00185v1
• Date: Thu, 30 Apr 2026 20:03:21 GMT
• Title: Fair Dataset Distillation via Cross-Group Barycenter Alignment
• Abstract summary: We show that as different demographic groups exhibit distinct predictive patterns, the distillation process struggles to preserve informative signals for all subgroups.<n>We identify a group-imbalance-agnostic barycenter of the predictive information that induces similar representations across all subgroups.<n>Our approach is compatible with existing distillation methods, and empirical results show that it substantially reduces bias introduced by dataset distillation.
• Score: 8.167132418487173
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dataset Distillation aims to compress a large dataset into a small synthetic one while maintaining predictive performance. We show that as different demographic groups exhibit distinct predictive patterns, the distillation process struggles to simultaneously preserve informative signals for all subgroups, regardless of whether group sizes are mildly or severely imbalanced. Consequently, models trained on distilled data can experience substantial performance drops for certain subgroups, leading to fairness gaps. Crucially, these gaps do not disappear by merely correcting group imbalance, since they stem from fundamental mismatches in subgroup predictive patterns rather than from sample-size disparities alone. We therefore formally analyze the interaction between these two sources of bias and cast the solution as identifying a group-imbalance-agnostic barycenter of the predictive information that induces similar representations across all subgroups. By distilling toward this shared aggregate representation, we show that group fairness concerns can be reduced. Our approach is compatible with existing distillation methods, and empirical results show that it substantially reduces bias introduced by dataset distillation.

Related papers

• Fairness-Aware Mixture-of-Experts via Subgroup Reweighting and Gate Regularization [2.6245086561385276]
  We propose an end-to-end Mixture-of-Experts (MoE) framework that corrects subgroup imbalance.<n>We apply subgroup reweighting to correct data imbalance, and introduce gate entropy regularization to prevent routing from collapsing onto subgroup attributes.<n> Experimental results demonstrate that the proposed approach improves fairness while maintaining competitive predictive performance.
  arXiv  Detail & Related papers  (2026-08-24T05:34:25Z)
• Representation Invariance and Allocation: When Subgroup Balance Matters [2.910375306412165]
  In some cases, imbalanced data distributions actually improve subgroup performance, while in others, subgroup performance remains unaffected by the absence of an entire subgroup during training.<n>We propose the latent separation hypothesis, which states that a partially fine-tuned model's dependence on subgroup representation is determined by the degree of separation between subgroups in the latent space of the pre-trained model.
  arXiv  Detail & Related papers  (2025-12-10T10:19:48Z)
• Mitigating Clever Hans Strategies in Image Classifiers through Generating Counterexamples [15.618934546058277]
  Group distributional robustness methods rely on explicit group labels to upweight underrepresented groups.<n>We propose Counterfactual Knowledge Distillation (CFKD), a framework that generates diverse counterfactuals.<n>We demonstrate CFKD's efficacy across five datasets, spanning synthetic tasks to an industrial application.
  arXiv  Detail & Related papers  (2025-10-20T13:22:57Z)
• Project-Probe-Aggregate: Efficient Fine-Tuning for Group Robustness [61.45587642780908]
  We propose a three-step approach for parameter-efficient fine-tuning of image-text foundation models.<n>Our method improves its two key components: minority samples identification and the robust training algorithm.<n>Our theoretical analysis shows that our PPA enhances minority group identification and is Bayes optimal for minimizing the balanced group error.
  arXiv  Detail & Related papers  (2025-03-12T15:46:12Z)
• Fairness of Deep Ensembles: On the interplay between per-group task difficulty and under-representation [9.11104048176204]
  Ensembling is commonly regarded as an effective way to improve the general performance of models in machine learning.<n>We show how a simple and straightforward method is able to mitigate disparities, particularly benefiting under-performing subgroups.<n>We analyzed the interplay between two factors which may result in biases: sub-group under-representation and the inherent difficulty of the task for each group.
  arXiv  Detail & Related papers  (2025-01-24T14:54:01Z)
• Simplicity Bias Leads to Amplified Performance Disparities [8.60453031364566]
  We show that SGD-trained models have a bias towards simplicity, leading them to prioritize learning a majority class. A model may prioritize any class or group of the dataset that it finds simple-at the expense of what it finds complex.
  arXiv  Detail & Related papers  (2022-12-13T15:24:41Z)
• Outlier-Robust Group Inference via Gradient Space Clustering [50.87474101594732]
  Existing methods can improve the worst-group performance, but they require group annotations, which are often expensive and sometimes infeasible to obtain. We address the problem of learning group annotations in the presence of outliers by clustering the data in the space of gradients of the model parameters. We show that data in the gradient space has a simpler structure while preserving information about minority groups and outliers, making it suitable for standard clustering methods like DBSCAN.
  arXiv  Detail & Related papers  (2022-10-13T06:04:43Z)
• Fair Group-Shared Representations with Normalizing Flows [68.29997072804537]
  We develop a fair representation learning algorithm which is able to map individuals belonging to different groups in a single group. We show experimentally that our methodology is competitive with other fair representation learning algorithms.
  arXiv  Detail & Related papers  (2022-01-17T10:49:49Z)
• Towards Group Robustness in the presence of Partial Group Labels [61.33713547766866]
  spurious correlations between input samples and the target labels wrongly direct the neural network predictions. We propose an algorithm that optimize for the worst-off group assignments from a constraint set. We show improvements in the minority group's performance while preserving overall aggregate accuracy across groups.
  arXiv  Detail & Related papers  (2022-01-10T22:04:48Z)
• Examining and Combating Spurious Features under Distribution Shift [94.31956965507085]
  We define and analyze robust and spurious representations using the information-theoretic concept of minimal sufficient statistics. We prove that even when there is only bias of the input distribution, models can still pick up spurious features from their training data. Inspired by our analysis, we demonstrate that group DRO can fail when groups do not directly account for various spurious correlations.
  arXiv  Detail & Related papers  (2021-06-14T05:39:09Z)
• Contrastive Examples for Addressing the Tyranny of the Majority [83.93825214500131]
  We propose to create a balanced training dataset, consisting of the original dataset plus new data points in which the group memberships are intervened. We show that current generative adversarial networks are a powerful tool for learning these data points, called contrastive examples.
  arXiv  Detail & Related papers  (2020-04-14T14:06:44Z)

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.