Learning Fair Representations with Kolmogorov-Arnold Networks
Amisha Priyadarshini, Sergio Gago Masagué
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on7
- Fairness without Demographics through Adversarially Reweighted LearningPreethi Lahoti, Alex Beutel, Jilin Chen, Kang Lee et al.NeurIPS 2020 · 406 citations
- Fair regression with Wasserstein barycentersEvgenii Chzhen, Christophe Denis, Mohamed Hebiri, Luca Oneto et al.NeurIPS 2020 · 148 citations
- On the Loss Landscape of Adversarial Training: Identifying Challenges and How to Overcome ThemChen Liu, Mathieu Salzmann, Tao Lin, Ryota Tomioka et al.NeurIPS 2020 · 103 citations
- ADOPT: Modified Adam Can Converge with Any β2 with the Optimal RateShohei Taniguchi, Keno Harada, Gouki Minegishi, Yuta Oshima et al.NeurIPS 2024 · 32 citations
- Aligning Relational Learning with Lipschitz FairnessYaning Jia, Chunhui Zhang, Soroush VosoughiICLR 2024 · 11 citations
Related papers
- 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 et al.ICDE 2025 · 2 citations
- Catastrophic Forgetting in Kolmogorov-Arnold NetworksMohammad Marufur Rahman, Guanchu Wang, Kaixiong Zhou, Minghan Chen et al.AAAI 2026 · 1 citation
- Stable Fair Graph Representation Learning with Lipschitz ConstraintQiang Chen, Zhongze Wu, Xiu Su, Xi Lin et al.ICML 2025
- KAN: Kolmogorov-Arnold NetworksZiming Liu, Yixuan Wang, Sachin Vaidya, Fabian Ruehle et al.ICLR 2025
