EDBT 2026 Demo / reviewers in the wild / expert
Xuan Zhao 0025
dblp:24/3533-25
· DBLP profile ↗
4ranked-venue papers in the field
2as first author
4since 2021 · last 2024
0000-0001-6560-8947ORCID · conflict
Domains — venue-derived; a paper can count in several
Data Mining & Knowledge Discovery · 2Big Data, Cloud & Distributed Data Systems · 2 (2 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Adversarial Reweighting Guided by Wasserstein Distance to Achieve Demographic ParityabstractTo address bias issues, fair machine learning usually jointly optimizes two (or more) metrics aiming at predictive utility and fairness. However, the inherent under-representation of minorities in the data often makes the disparate impact of subpopulations less noticeable and difficult to deal with during learning. In this paper, we propose a novel adversarial reweighting method to address such disparate impact. To balance the data distribution between the majority and the minority groups, our approach prefers samples from the majority group that are closer to the minority group as evaluated by the Wasserstein distance. Theoretical analysis shows the effectiveness of our adversarial reweighting approach. Experiments demonstrate that our approach mitigates disparate impact without sacrificing classification accuracy, outperforming related state-of-the-art methods on image and tabular benchmark datasets. Code is available at https://github.com/zhaoxuan00707/wasserstein_reweight. Xuan Zhao 0025, Simone Fabbrizzi, Paula Reyero Lobo, S. Siamak Ghodsi, Klaus Broelemann, Steffen Staab, Gjergji Kasneci |
IEEE Big Data | 1 |
| 2024 | Studying bias in visual features through the lens of optimal transportabstractAbstract Computer vision systems are employed in a variety of high-impact applications. However, making them trustworthy requires methods for the detection of potential biases in their training data, before models learn to harm already disadvantaged groups in downstream applications. Image data are typically represented via extracted features, which can be hand-crafted or pre-trained neural network embeddings. In this work, we introduce a framework for bias discovery given such features that is based on optimal transport theory; it uses the (quadratic) Wasserstein distance to quantify disparity between the feature distributions of two demographic groups (e.g., women vs men). In this context, we show that the Kantorovich potentials of the images, which are a byproduct of computing the Wasserstein distance and act as “transportation prices", can serve as bias scores by indicating which images might exhibit distinct biased characteristics. We thus introduce a visual dataset exploration pipeline that helps auditors identify common characteristics across high- or low-scored images as potential sources of bias. We conduct a case study to identify prospective gender biases and demonstrate theoretically-derived properties with experiments on the CelebA and Biased MNIST datasets. Simone Fabbrizzi, Xuan Zhao 0025, Emmanouil Krasanakis, Symeon Papadopoulos, Eirini Ntoutsi |
Data Min. Knowl. Discov. | 2 |
| 2024 | Correction to: Studying bias in visual features through the lens of optimal transportabstractIn this article the statement after Equation 1 had an error in the published version. Please refer the correction as follows: “where ν = T#µ and T# is the push-forward of µ along the function T : X → Y” was incorrectly written as “where T# is the push-forward of µ along the function T : X → Y. Furthermore, Equation 1 itself was incorrectly formulated. Namely, the integral should have been over X and not over X × Y. The original article has been corrected. Simone Fabbrizzi, Xuan Zhao 0025, Emmanouil Krasanakis, Symeon Papadopoulos, Eirini Ntoutsi |
Data Min. Knowl. Discov. | 2 |
| 2023 | Causal Fairness-Guided Dataset Reweighting using Neural NetworksabstractThe importance of achieving fairness in machine learning models cannot be overstated. Recent research has pointed out that fairness should be examined from a causal perspective, and several fairness notions based on the on Pearl’s causal framework have been proposed. In this paper, we construct a reweighting scheme of datasets to address causal fairness. Our approach aims at mitigating bias by considering the causal relationships among variables and incorporating them into the reweighting process. The proposed method adopts two neural networks, whose structures are intentionally used to reflect the structures of a causal graph and of an interventional graph. The two neural networks can approximate the causal model of the data, and the causal model of interventions. Furthermore, reweighting guided by a discriminator is applied to achieve various fairness notions. Experiments on real-world datasets show that our method can achieve causal fairness on the data while remaining close to the original data for downstream tasks. Xuan Zhao 0025, Klaus Broelemann, Salvatore Ruggieri, Gjergji Kasneci |
IEEE Big Data | 1 |