Efficient and Interpretable Transformer for Counterfactual Fairness
Panyi Dong, Zhiyu Quan

TL;DR
This paper introduces FCorrTransformer, an interpretable, attention-light transformer architecture with a novel regularization method to promote counterfactual fairness in tabular data applications.
Contribution
The paper proposes a new transformer architecture and a fairness regularization technique that enhance interpretability and fairness without sacrificing performance.
Findings
Achieves strong counterfactual fairness in classification and regression tasks.
Reduces model complexity compared to standard transformer baselines.
Maintains competitive predictive performance.
Abstract
The growing reliance of machine learning models in high-stakes, highly regulated domains such as finance and insurance has created a growing tension between predictive performance, interpretability, and regulatory fairness requirements. In these settings, models are expected not only to deliver reliable predictions but also to provide transparent decision rationales and comply with strict fairness requirements. Attention-based transformers offer powerful mechanisms for modeling complex data relationships as demonstrated in various language tasks, yet their attention mechanisms alone do not ensure counterfactually fair predictions, even when combined with fairness-aware techniques. To address these limitations, we propose the Feature Correlation Transformer (FCorrTransformer), an attention-light architecture tailored for tabular data. In this design, the attention matrix admits a direct…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
