Papers › AutoPEFT: Automatic Configuration Search for Parameter-Efficient Fine-Tuning

AutoPEFT: Automatic Configuration Search for Parameter-Efficient Fine-Tuning

28 Jan 2023arXiv:2301.12132archive 2025-07-28

Han Zhou, Xingchen Wan, Ivan Vulić, Anna Korhonen

Large pretrained language models are widely used in downstream NLP tasks via task-specific fine-tuning, but such procedures can be costly. Recently, Parameter-Efficient Fine-Tuning (PEFT) methods have achieved strong task performance while updating much fewer parameters than full model fine-tuning (FFT). However, it is non-trivial to make informed design choices on the PEFT configurations, such as their architecture, the number of tunable parameters, and even the layers in which the PEFT modules are inserted. Consequently, it is highly likely that the current, manually designed configurations are suboptimal in terms of their performance-efficiency trade-off. Inspired by advances in neural architecture search, we propose AutoPEFT for automatic PEFT configuration selection: we first design an expressive configuration search space with multiple representative PEFT modules as building blocks. Using multi-objective Bayesian optimisation in a low-cost setup, we then discover a Pareto-optimal set of configurations with strong performance-cost trade-offs across different numbers of parameters that are also highly transferable across different tasks. Empirically, on GLUE and SuperGLUE tasks, we show that AutoPEFT-discovered configurations significantly outperform existing PEFT methods and are on par or better than FFT without incurring substantial training efficiency costs.

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

Code

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

By repository: official repository: 12 samples from 1 repository, 2 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.

cambridgeltl/autopeft officialmentioned in papermentioned on GitHubjaxApache-2.0 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; 3 ran; 0 honoured the contract we drafted; 10 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
2ran
10unverified

Licence: 13 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 cambridgeltl/autopeft. 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.

acc_and_f1 cambridgeltl/autopeft/glue_metrics.py official repository ran Apache-2.0 recorded; this copy not marked cleared · pointer only · 454817035cd7e70d · report
pearson_and_spearman cambridgeltl/autopeft/glue_metrics.py official repository ran fingerprinted Apache-2.0 recorded; this copy not marked cleared · pointer only · e3e13638a674e4b1 · report
gelu_fast cambridgeltl/autopeft/adapter-transformers-adapters3.1.0/src/transformers/activations_tf.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · 37a5eed2dbd663ca · report
get_EI cambridgeltl/autopeft/adapterhub/bo/models.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · 280a696268513b28 · report
get_all_checkpoint cambridgeltl/autopeft/adapterhub/nas_search.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · 2f0f77422d5933be · report
get_kernel cambridgeltl/autopeft/adapterhub/bo/models.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · 8f025929c3e1325b · report
get_logger cambridgeltl/autopeft/logger.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · b6d6bcb982b768cc · report
mish cambridgeltl/autopeft/adapter-transformers-adapters3.1.0/src/transformers/activations_tf.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · cc8c8c3ebf0c343f · report
quick_gelu cambridgeltl/autopeft/adapter-transformers-adapters3.1.0/src/transformers/activations_tf.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · e2d56cb91f999bef · report
simple_accuracy cambridgeltl/autopeft/glue_metrics.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · 83eba990d34db6a2 · report
split_datasets cambridgeltl/autopeft/adapterhub/nas_search.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · f247d1c0140d8564 · report
split_datasets cambridgeltl/autopeft/adapterhub/run_glue.py official repository unverified Apache-2.0 recorded; this copy not marked cleared · pointer only · c2b46bdd4073aaa8 · report
kronecker_product identical code first harvested elsewhere ran · our draft was wrong fingerprinted licence of this copy not recorded · 54fa343f001c7cff · report

Tasks

Bayesian OptimisationNeural Architecture Searchparameter-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