Papers › DSEE: Dually Sparsity-embedded Efficient Tuning of Pre-trained Language Models

DSEE: Dually Sparsity-embedded Efficient Tuning of Pre-trained Language Models

30 Oct 2021arXiv:2111.00160archive 2025-07-28

Xuxi Chen, Tianlong Chen, Weizhu Chen, Ahmed Hassan Awadallah, Zhangyang Wang, Yu Cheng

Gigantic pre-trained models have become central to natural language processing (NLP), serving as the starting point for fine-tuning towards a range of downstream tasks. However, two pain points persist for this paradigm: (a) as the pre-trained models grow bigger (e.g., 175B parameters for GPT-3), even the fine-tuning process can be time-consuming and computationally expensive; (b) the fine-tuned model has the same size as its starting point by default, which is neither sensible due to its more specialized functionality, nor practical since many fine-tuned models will be deployed in resource-constrained environments. To address these pain points, we propose a framework for resource- and parameter-efficient fine-tuning by leveraging the sparsity prior in both weight updates and the final model weights. Our proposed framework, dubbed Dually Sparsity-Embedded Efficient Tuning (DSEE), aims to achieve two key objectives: (i) parameter efficient fine-tuning - by enforcing sparsity-aware low-rank updates on top of the pre-trained weights; and (ii) resource-efficient inference - by encouraging a sparse weight structure towards the final fine-tuned model. We leverage sparsity in these two directions by exploiting both unstructured and structured sparse patterns in pre-trained language models via a unified approach. Extensive experiments and in-depth investigations, with diverse network backbones (i.e., BERT, RoBERTa, and GPT-2) on dozens of datasets, consistently demonstrate impressive parameter-/inference-efficiency, while maintaining competitive downstream performance. For instance, DSEE saves about 25% inference FLOPs while achieving comparable performance, with 0.5% trainable parameters on BERT. Codes are available in https://github.com/VITA-Group/DSEE.

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="2111.00160")

Code

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

By repository: official repository: 12 samples from 1 repository, 6 ran; 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

vita-group/dsee officialmentioned in papermentioned on GitHubjaxMIT 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; 7 ran; 0 honoured the contract we drafted; 6 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 · our draft was wrong
1ran · fixture could not drive it
5ran
6unverified

Licence: 1 of the 13 samples is 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 vita-group/dsee. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “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.

check_number_comma vita-group/dsee/non-GPT-2/src/transformers/convert_slow_tokenizer.py official repository ran MIT (permissive) · a727df5fd2f5599a · report
ensure_valid_input vita-group/dsee/non-GPT-2/src/transformers/convert_graph_to_onnx.py official repository ran MIT (permissive) · d770e1dd1d799a47 · report
gelu_fast vita-group/dsee/non-GPT-2/src/transformers/activations.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · a4475703ff58ecf9 · report
gelu_new vita-group/dsee/non-GPT-2/src/transformers/activations.py official repository ran fingerprinted MIT (permissive) · 45bb87451230d5e8 · report
generate_identified_filename vita-group/dsee/non-GPT-2/src/transformers/convert_graph_to_onnx.py official repository ran MIT (permissive) · 7efe3db5c9e2f94d · report
quick_gelu vita-group/dsee/non-GPT-2/src/transformers/activations.py official repository ran fingerprinted MIT (permissive) · e21f72f1a9834aef · report
convert_slow_tokenizer vita-group/dsee/non-GPT-2/src/transformers/convert_slow_tokenizer.py official repository unverified MIT (permissive) · 5513be821f28f6c5 · report
detect_overflow vita-group/dsee/non-GPT-2/src/transformers/debug_utils.py official repository unverified MIT (permissive) · 58e4e5b4f1f2951e · report
gelu_fast vita-group/dsee/non-GPT-2/src/transformers/activations_tf.py official repository unverified MIT (permissive) · 37a5eed2dbd663ca · report
get_abs_min_max vita-group/dsee/non-GPT-2/src/transformers/debug_utils.py official repository unverified MIT (permissive) · b5db92a796ef38f1 · report
infer_shapes vita-group/dsee/non-GPT-2/src/transformers/convert_graph_to_onnx.py official repository unverified MIT (permissive) · 3449d7d975edfb89 · report
mish vita-group/dsee/non-GPT-2/src/transformers/activations_tf.py official repository unverified MIT (permissive) · cc8c8c3ebf0c343f · report
generate_batch_splits identical code first harvested elsewhere ran · fixture could not drive it fingerprinted licence of this copy not recorded · 7639bb277f652362 · report

Tasks

parameter-efficient fine-tuning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdamAttentionAttention DropoutBERTBPECosine AnnealingDense ConnectionsDiscriminative Fine-TuningDropoutGPT-2Layer NormalizationLinear LayerLinear Warmup With Cosine AnnealingLinear Warmup With Linear DecayMulti-Head AttentionResidual ConnectionRoBERTaSoftmaxWeight 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