Papers › Incorporating BERT into Parallel Sequence Decoding with Adapters

Incorporating BERT into Parallel Sequence Decoding with Adapters

13 Oct 2020NeurIPS 2020 12arXiv:2010.06138archive 2025-07-28

Junliang Guo, Zhirui Zhang, Linli Xu, Hao-Ran Wei, Boxing Chen, Enhong Chen

While large scale pre-trained language models such as BERT have achieved great success on various natural language understanding tasks, how to efficiently and effectively incorporate them into sequence-to-sequence models and the corresponding text generation tasks remains a non-trivial problem. In this paper, we propose to address this problem by taking two different BERT models as the encoder and decoder respectively, and fine-tuning them by introducing simple and lightweight adapter modules, which are inserted between BERT layers and tuned on the task-specific dataset. In this way, we obtain a flexible and efficient model which is able to jointly leverage the information contained in the source-side and target-side BERT models, while bypassing the catastrophic forgetting problem. Each component in the framework can be considered as a plug-in unit, making the framework flexible and task agnostic. Our framework is based on a parallel sequence decoding algorithm named Mask-Predict considering the bi-directional and conditional independent nature of BERT, and can be adapted to traditional autoregressive decoding easily. We conduct extensive experiments on neural machine translation tasks where the proposed method consistently outperforms autoregressive baselines while reducing the inference latency by half, and achieves $36.49$/$33.57$ BLEU scores on IWSLT14 German-English/WMT14 German-English translation. When adapted to autoregressive decoding, the proposed method achieves $30.60$/$43.56$ BLEU scores on WMT14 English-German/English-French translation, on par with the state-of-the-art baseline models.

PaperPDFConference PDFCodeCode 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="2010.06138")

Code

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

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

lemmonation/abnet officialmentioned in papermentioned 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; 5 ran; 1 honoured the contract we drafted; 8 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
3ran · our draft was wrong
1ran
8unverified

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 lemmonation/abnet. “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.

swish lemmonation/abnet/bert/modeling.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 0f786c407fb1ee4c · report
whitespace_tokenize lemmonation/abnet/bert/tokenization.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · cf9ffa02a42184af · report
gelu lemmonation/abnet/bert/modeling.py official repository ran · honoured contract fingerprinted MIT (permissive) · fdc64f4c72036ae4 · report
safe_readline lemmonation/abnet/fairseq/binarizer.py official repository ran MIT (permissive) · 82bdf940665aeeb4 · report
url_to_filename lemmonation/abnet/bert/file_utils.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 5eff22fa0a651276 · report
cached_path lemmonation/abnet/bert/file_utils.py official repository unverified MIT (permissive) · cf9c448c96f48428 · report
dataset_dest_prefix lemmonation/abnet/preprocess.py official repository unverified MIT (permissive) · 9eda7f80331d658c · report
filename_to_url lemmonation/abnet/bert/file_utils.py official repository unverified MIT (permissive) · a6aab787fcf8b10d · report
load_checkpoint lemmonation/abnet/fairseq/checkpoint_utils.py official repository unverified MIT (permissive) · 336077aca45a1da4 · report
load_checkpoint_to_cpu lemmonation/abnet/fairseq/checkpoint_utils.py official repository unverified MIT (permissive) · c6a6a0734f184953 · report
load_model_ensemble lemmonation/abnet/fairseq/checkpoint_utils.py official repository unverified MIT (permissive) · b2d82a49dbc70999 · report
load_tf_weights_in_bert lemmonation/abnet/bert/modeling.py official repository unverified MIT (permissive) · b1a7180868dd8d6a · report
load_vocab lemmonation/abnet/bert/tokenization.py official repository unverified MIT (permissive) · a4e183f24a5ad1a7 · report

Tasks

Machine TranslationNatural Language UnderstandingText GenerationTranslation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdamAttentionAttention DropoutBERTDense ConnectionsDropoutLayer NormalizationLinear LayerLinear Warmup With Linear DecayMulti-Head AttentionResidual ConnectionSoftmaxWeight DecayWordPiece

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