Papers › ADEPT: A DEbiasing PrompT Framework

ADEPT: A DEbiasing PrompT Framework

10 Nov 2022arXiv:2211.05414archive 2025-07-28

Ke Yang, Charles Yu, Yi Fung, Manling Li, Heng Ji

Several works have proven that finetuning is an applicable approach for debiasing contextualized word embeddings. Similarly, discrete prompts with semantic meanings have shown to be effective in debiasing tasks. With unfixed mathematical representation at the token level, continuous prompts usually surpass discrete ones at providing a pre-trained language model (PLM) with additional task-specific information. Despite this, relatively few efforts have been made to debias PLMs by prompt tuning with continuous prompts compared to its discrete counterpart. Furthermore, for most debiasing methods that alter a PLM's original parameters, a major problem is the need to not only decrease the bias in the PLM but also to ensure that the PLM does not lose its representation ability. Finetuning methods typically have a hard time maintaining this balance, as they tend to violently remove meanings of attribute words. In this paper, we propose ADEPT, a method to debias PLMs using prompt tuning while maintaining the delicate balance between removing biases and ensuring representation ability. To achieve this, we propose a new training criterion inspired by manifold learning and equip it with an explicit debiasing term to optimize prompt tuning. In addition, we conduct several experiments with regard to the reliability, quality, and quantity of a previously proposed attribute training corpus in order to obtain a clearer prototype of a certain attribute, which indicates the attribute's position and relative distances to other words on the manifold. We evaluate ADEPT on several widely acknowledged debiasing benchmarks and downstream tasks, and find that it achieves competitive results while maintaining (and in some cases even improving) the PLM's representation ability. We further visualize words' correlation before and after debiasing a PLM, and give some possible explanations for the visible effects.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2211.05414")

Code

Syntology Ran 8 of 13 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 1 ran · honoured contract; 2 ran · our draft was wrong; 1 ran · fixture could not drive it; 4 ran with no contract checked.

By repository: official repository: 13 samples from 1 repository, 8 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

EmpathYang/ADEPT officialmentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested; 8 ran; 1 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
2ran · our draft was wrong
1ran · fixture could not drive it
4ran
5unverified

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from EmpathYang/ADEPT. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

build_relative_position EmpathYang/ADEPT/model/deberta.py official repository ran · honoured contract MIT (permissive) · 00b3090f89b698e1 · report
c2p_dynamic_expand EmpathYang/ADEPT/model/deberta.py official repository ran · fixture could not drive it MIT (permissive) · ea37553c09194184 · report
calculate_group_to_group_relative_distance_asymmetric EmpathYang/ADEPT/distance.py official repository ran fingerprinted MIT (permissive) · 31501071e57d43c4 · report
calculate_group_to_group_relative_distance_asymmetric_test EmpathYang/ADEPT/distance.py official repository ran fingerprinted MIT (permissive) · d6b5586516edd277 · report
calculate_group_to_one_relative_distance_asymmetric_test EmpathYang/ADEPT/distance.py official repository ran fingerprinted MIT (permissive) · d73ab432982f8191 · report
create_dataset EmpathYang/ADEPT/debias.py official repository ran · our draft was wrong MIT (permissive) · 5f516b6aaad9acb6 · report
load_and_cache_examples EmpathYang/ADEPT/debias.py official repository ran MIT (permissive) · f46fa5e6d0948125 · report
split_data EmpathYang/ADEPT/debias.py official repository ran · our draft was wrong MIT (permissive) · d0dd7e697cd0cfba · report
build_relative_position EmpathYang/ADEPT/model/debertaV2.py official repository unverified MIT (permissive) · 0df39601dd0d5745 · report
get_mask EmpathYang/ADEPT/model/deberta.py official repository unverified MIT (permissive) · 05732f1a5126672d · report
get_model_deprecated EmpathYang/ADEPT/model/utils.py official repository unverified MIT (permissive) · 06439dc4fc5e69b0 · report
make_log_bucket_position EmpathYang/ADEPT/model/debertaV2.py official repository unverified MIT (permissive) · 29371b9c270911e1 · report
prepare_tokenizer EmpathYang/ADEPT/collect_sentences.py official repository unverified MIT (permissive) · 8caa8979bca6e6cd · report

Tasks

AttributeLanguage ModellingWord Embeddings

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections