Papers › PYRA: Parallel Yielding Re-Activation for Training-Inference Efficient Task Adaptation

PYRA: Parallel Yielding Re-Activation for Training-Inference Efficient Task Adaptation

14 Mar 2024arXiv:2403.09192archive 2025-07-28

Yizhe Xiong, Hui Chen, Tianxiang Hao, Zijia Lin, Jungong Han, Yuesong Zhang, Guoxin Wang, Yongjun Bao, Guiguang Ding

Recently, the scale of transformers has grown rapidly, which introduces considerable challenges in terms of training overhead and inference efficiency in the scope of task adaptation. Existing works, namely Parameter-Efficient Fine-Tuning (PEFT) and model compression, have separately investigated the challenges. However, PEFT cannot guarantee the inference efficiency of the original backbone, especially for large-scale models. Model compression requires significant training costs for structure searching and re-training. Consequently, a simple combination of them cannot guarantee accomplishing both training efficiency and inference efficiency with minimal costs. In this paper, we propose a novel Parallel Yielding Re-Activation (PYRA) method for such a challenge of training-inference efficient task adaptation. PYRA first utilizes parallel yielding adaptive weights to comprehensively perceive the data distribution in downstream tasks. A re-activation strategy for token modulation is then applied for tokens to be merged, leading to calibrated token features. Extensive experiments demonstrate that PYRA outperforms all competing methods under both low compression rate and high compression rate, demonstrating its effectiveness and superiority in maintaining both training efficiency and inference efficiency for large-scale foundation models. Our code is available at https://github.com/THU-MIG/PYRA.

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

Code

Syntology Ran 15 of 16 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 2 ran · honoured contract; 3 ran · fixture could not drive it; 10 ran with no contract checked.

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

thu-mig/pyra officialmentioned in papermentioned on GitHubtfMIT 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

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

2ran · honoured contract
3ran · fixture could not drive it
10ran
1unverified

Licence: 0 of the 16 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 thu-mig/pyra. “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.

bipartite_soft_matching thu-mig/pyra/model/adaptive_merge.py official repository ran MIT (permissive) · b6129d06b30c292b · report
build_dataset thu-mig/pyra/lib/datasets.py official repository ran MIT (permissive) · 4d972cb75e0ce17d · report
build_transform thu-mig/pyra/lib/datasets.py official repository ran MIT (permissive) · 4352f21759f08de9 · report
do_nothing thu-mig/pyra/model/adaptive_merge.py official repository ran · honoured contract fingerprinted MIT (permissive) · 969e8250d805a154 · report
drop_path thu-mig/pyra/model/utils.py official repository ran · fixture could not drive it MIT (permissive) · 39eace7e2822504f · report
even thu-mig/pyra/model/utils.py official repository ran fingerprinted MIT (permissive) · c2766d58552b5f37 · report
get_merging_schedule thu-mig/pyra/model/tome.py official repository ran MIT (permissive) · 8b5a189b881cc7e5 · report
init_pyra_scale THU-MIG/PYRA/model/adaptive_merge.py official repository ran · honoured contract MIT (permissive) · c41aa8b3b7005800 · report
make_tome_class thu-mig/pyra/model/tome.py official repository ran MIT (permissive) · 6ee649c2dcd0e4a1 · report
optimizer_kwargs thu-mig/pyra/model/optim_factory.py official repository ran MIT (permissive) · 04ae1a80bf45d2eb · report
parse_r thu-mig/pyra/model/tome.py official repository ran fingerprinted MIT (permissive) · 94e8f254ce489a4b · report
pre_process thu-mig/pyra/model/optim_factory.py official repository ran MIT (permissive) · c481267a68f1cd79 · report
resize_pos_embed thu-mig/pyra/model/vision_transformer_timm.py official repository ran · fixture could not drive it MIT (permissive) · 191b2735955d18f4 · report
test_model_latency thu-mig/pyra/engine.py official repository ran MIT (permissive) · 55b52c9838727c38 · report
trunc_normal_ thu-mig/pyra/model/utils.py official repository ran · fixture could not drive it MIT (permissive) · 02566da69866c48c · report
checkpoint_filter_fn thu-mig/pyra/model/vision_transformer_timm.py official repository unverified MIT (permissive) · 6d8a1f8a0697180f · report

Tasks

Model Compressionparameter-efficient fine-tuning

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