Cross-Talk Reduction
Abstract
Recently, optimal transport-based approaches have gained attention for deriving counterfactuals, e.g., to quantify algorithmic discrimination. However, in the general multivariate setting, these methods are often opaque and difficult to interpret. To address this, alternative methodologies have been proposed, using causal graphs combined with iterative quantile regressions or sequential transport to examine fairness at the individual level, often referred to as "counterfactual fairness." Despite these advancements, transporting categorical variables remains a significant challenge in practical applications with real datasets. In this paper, we propose a novel approach to address this issue. Our method involves (1) converting categorical variables into compositional data and (2) transporting these compositions within the probabilistic simplex of the Euclidean space. We demonstrate the applicability and effectiveness of this approach through an illustration on real-world data, and discuss limitations.
Cite
Text
Wang et al. "Cross-Talk Reduction." International Joint Conference on Artificial Intelligence, 2024. doi:10.24963/ijcai.2024/572Markdown
[Wang et al. "Cross-Talk Reduction." International Joint Conference on Artificial Intelligence, 2024.](https://mlanthology.org/ijcai/2024/wang2024ijcai-cross/) doi:10.24963/ijcai.2024/572BibTeX
@inproceedings{wang2024ijcai-cross,
title = {{Cross-Talk Reduction}},
author = {Wang, Zhong-Qiu and Kumar, Anurag and Watanabe, Shinji},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2024},
pages = {5171-5180},
doi = {10.24963/ijcai.2024/572},
url = {https://mlanthology.org/ijcai/2024/wang2024ijcai-cross/}
}