CFL: Causally Fair Language Models Through Token-level Attribute Controlled Generation

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

We propose a method to control the attributes of Language Models (LMs) for the text generation task using Causal Average Treatment Effect (ATE) scores and counterfactual augmentation. We explore this method, in the context of LM detoxification, and propose the Causally Fair Language (CFL) architecture for detoxifying pre-trained LMs in a plug-and-play manner. Our architecture is based on a Structural Causal Model (SCM) that is mathematically transparent and computationally efficient as compared with many existing detoxification techniques. We also propose several new metrics that aim to better understand the behaviour of LMs in the context of toxic text generation. Further, we achieve state of the art performance for toxic degeneration, which are computed using REALTOXICITYPROMPTS (RTP) benchmark. Our experiments show that CFL achieves such a detoxification without much impact on the model perplexity. We also show that CFL mitigates the unintended bias problem through experiments on the BOLD dataset.

Cite

CITATION STYLE

APA

Madhavan, R., Garg, R., Wadhawan, K., & Mehta, S. (2023). CFL: Causally Fair Language Models Through Token-level Attribute Controlled Generation. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (pp. 11344–11358). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.findings-acl.720

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free