Learning Fair Representations with Kolmogorov-Arnold Networks
Amisha Priyadarshini, Sergio Gago Masagué
摘要
Despite recent advances in fairness-aware machine learning, predictive models often exhibit discriminatory behavior towards marginalized groups. Such unfairness might arise from biased training data, model design, or representational disparities across groups, posing significant challenges in high-stakes decision-making domains such as college admissions. While existing fair learning models aim to mitigate bias, achieving an optimal trade-off between fairness and accuracy remains a challenge. Moreover, the reliance on black-box models hinders interpretability, limiting their applicability in socially sensitive domains. To circumvent these issues, we propose integrating Kolmogorov-Arnold Networks (KANs) within a fair adversarial learning framework. Leveraging the adversarial robustness and interpretability of KANs, our approach facilitates stable adversarial learning. We derive theoretical insights into the spline-based KAN architecture that ensure stability during adversarial optimization. Additionally, an adaptive fairness penalty update mechanism is proposed to strike a balance between fairness and accuracy. We back these findings with empirical evidence on two real-world admissions datasets, demonstrating the proposed framework's efficiency in achieving fairness across sensitive attributes while preserving predictive performance.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper7
- Fairness without Demographics through Adversarially Reweighted LearningPreethi Lahoti, Alex Beutel, Jilin Chen, Kang Lee 等NeurIPS 2020 · 被引用 406 次
- Fair regression with Wasserstein barycentersEvgenii Chzhen, Christophe Denis, Mohamed Hebiri, Luca Oneto 等NeurIPS 2020 · 被引用 148 次
- On the Loss Landscape of Adversarial Training: Identifying Challenges and How to Overcome ThemChen Liu, Mathieu Salzmann, Tao Lin, Ryota Tomioka 等NeurIPS 2020 · 被引用 103 次
- ADOPT: Modified Adam Can Converge with Any β2 with the Optimal RateShohei Taniguchi, Keno Harada, Gouki Minegishi, Yuta Oshima 等NeurIPS 2024 · 被引用 32 次
- Aligning Relational Learning with Lipschitz FairnessYaning Jia, Chunhui Zhang, Soroush VosoughiICLR 2024 · 被引用 11 次
相关 Paper
- Deep Fair Multi-View Clustering with Attention KANHaiming Xu, Qianqian Wang, Boyue Wang, Quanxue GaoCVPR 2025
- KARMAD: KAN-Based Adversarial Robust Model for Anomaly DetectionFangke Chen, Xiaotian Qiu, Yihan Ye, Ruyue Jing 等ICDE 2025 · 被引用 2 次
- Catastrophic Forgetting in Kolmogorov-Arnold NetworksMohammad Marufur Rahman, Guanchu Wang, Kaixiong Zhou, Minghan Chen 等AAAI 2026 · 被引用 1 次
- Stable Fair Graph Representation Learning with Lipschitz ConstraintQiang Chen, Zhongze Wu, Xiu Su, Xi Lin 等ICML 2025
- KAN: Kolmogorov-Arnold NetworksZiming Liu, Yixuan Wang, Sachin Vaidya, Fabian Ruehle 等ICLR 2025
