Efficient Transformer Parameter Reuse via Zero-Token Mechanism (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to scaling up parameter counts are impractical for users with limited computational resources.
Approach: They propose a decoupled parameter cycling strategy that employs a head-tail decoupling strategy to decouple the first (head) and last (tail) layers from the parameter cycling process.
Outcome: The proposed approach achieves superior performance under strict parameter constraints and significantly reduces computational overhead via early exits.

Similar Papers

Parameter-Efficient Tuning with Special Token Adaptation (2023.eacl-main)

Copied to clipboard

Challenge: a recent study shows that parameter-efficient tuning is a challenge for multitask deployments.
Approach: They propose a parameter-efficient tuning technique that only updates a small subset of parameters when adapting a pretrained model to downstream tasks.
Outcome: The proposed method achieves comparable performance to fine-tuning in natural language understanding tasks including text classification and NER with only 0.029% of parameters trained.
AdapterBias: Parameter-efficient Token-dependent Representation Shift for Adapters in NLP Tasks (2022.findings-naacl)

Copied to clipboard

Challenge: Existing approaches to train transformers with millions of parameters require large storage.
Approach: They propose a transformer-based adapter architecture that adds a token-dependent shift to the hidden output of transformer layers to adapt to downstream tasks with only a vector and a linear layer.
Outcome: The proposed model significantly reduces trainable parameters with minimal performance loss compared to fine-tuned models.
KV-Embedding: Training-free Text Embedding via Internal KV Re-routing in Decoder-only LLMs (2026.acl-long)

Copied to clipboard

Challenge: Recent work shows that decoder-only LLMs can serve as strong embedding backbones when fine-tuned with contrastive objectives.
Approach: They propose a framework that activates the latent representation power of frozen LLMs by rerouting the final token's KV states as a prepended prefix.
Outcome: The proposed framework outperforms existing training-free baselines by 10% on MTEB and maintains robust performance on sequences up to 4,096 tokens.
Subformer: Exploring Weight Sharing for Parameter Efficiency in Generative Transformers (2021.findings-emnlp)

Copied to clipboard

Challenge: Recent improvements in NLP tasks can be attributed to the Transformer model.
Approach: They propose to use parameter-sharing methods to reduce parameter budgets in generative models by using sandwich-style parameter sharing and self-attentive embedding factorization.
Outcome: The proposed model outperforms the current RNN model even with significantly fewer parameters.
A Frustratingly Easy Post-Training Quantization Scheme for LLMs (2023.emnlp-main)

Copied to clipboard

Challenge: Efficient inference is crucial for hyper-scale AI models, including large language models, as their parameter count continues to increase for enhanced performance.
Approach: They propose a quantization scheme that fully utilizes the Transformer structure used in large language models to minimize the frequency of DRAM access while exploiting the parallelism of operations.
Outcome: The proposed method minimizes the frequency of DRAM access while exploiting the parallelism of operations through a dense matrix format.
Predicting Rewards Alongside Tokens: Non-disruptive Parameter Insertion for Efficient Inference Intervention in Large Language Model (2024.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to fine tune LLMs produce unsafe responses and unreliable reasoning, but this solution introduces substantial time and space overhead due to the separate models required.
Approach: They propose to insert extra parameters into transformer architecture to predict calibration signals along with original LLM output.
Outcome: The proposed model reduces time and space costs while enabling seamless online deployment.
From Bottom to Top: Extending the Potential of Parameter Efficient Fine-Tuning (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods to fine-tune large language models primarily focus on the interaction between different layers, ignoring the fact that different layers store different information.
Approach: They propose a Parameter Efficient Fine-Tuning method which freeze pre-trained parameters and fine-tunes only a few task-specific parameters.
Outcome: The proposed methods reduce parameter count to nearly half by omitting fine-tuning in the middle layers.
AdaKron: An Adapter-based Parameter Efficient Model Tuning with Kronecker Product (2024.lrec-main)

Copied to clipboard

Challenge: Large Pretrained Language Models (PLMs) have billions of parameters, causing computational challenges to fine-tuning models.
Approach: They propose an Adapter-based fine-tuning with the Kronecker product that combine the outputs of two small networks to form a final vector whose dimension is the product of the dimensions of the individual outputs.
Outcome: The proposed method achieves the same performance levels as state-of-the-art methods on the GLUE benchmark .
PARA: Parameter-Efficient Fine-tuning with Prompt-Aware Representation Adjustment (2024.emnlp-industry)

Copied to clipboard

Challenge: Existing methods for parameter-efficient fine-tuning excel in the context of single-backbone multi-tenant applications.
Approach: They propose to integrate a lightweight vector generator within each Transformer layer to improve prompt-aware representation adjustment.
Outcome: The proposed method surpasses current benchmarks in terms of performance despite having a similar number of adjustable parameters.
AlphaTuning: Quantization-Aware Parameter-Efficient Adaptation of Large-Scale Pre-Trained Language Models (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to improve inference efficiency by accelerating model fine-tuning have not been thoroughly explored.
Approach: They propose to combine parameter-efficient adaptation and model compression to accelerate model . they propose to freeze binary parameters and scale scaling factors for target tasks .
Outcome: The proposed algorithm achieves >10x compression ratio under 4-bit quantization and >1,000x reduction in trainable parameters.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations