Challenge: Pre-trained language models are overly parameterized and have significant redundancy . recent studies show that PLMs are highly over-parameterized and robust to pruning .
Approach: They propose to re-parameter and fine-tune pre-trained language models from a new perspective: Discovery of intrinsic task-specific subspace.
Outcome: The proposed model can be fine-tuned in the subspace with a small number of free parameters.

Similar Papers

Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning (2021.acl-long)

Copied to clipboard

Challenge: Pre-trained language models can be fine-tuned to produce state-of-the-art results for a wide range of language understanding tasks.
Approach: They propose to analyze fine-tuning through the lens of intrinsic dimension . they show that pre-trained models have a low intrinsic dimension reparameterization .
Outcome: The proposed model can achieve 90% of the full parameter performance levels on MRPC with low data regime.
Exploring Intrinsic Language-specific Subspaces in Fine-tuning Multilingual Neural Machine Translation (2024.emnlp-main)

Copied to clipboard

Challenge: Multilingual neural machine translation models support fine-tuning hundreds of languages simultaneously.
Approach: They propose to fine-tune a language in its intrinsic subspace with a tiny fraction of entire parameters.
Outcome: The proposed methods outperform full-parameter fine-tuning up to 2.25 spBLEU scores and reduce trainable parameters to 0.4% for high and medium-resource languages and 1.6% for low-resourced ones.
Parameter-Efficient Fine-Tuning: Is There An Optimal Subset of Parameters to Tune? (2024.findings-eacl)

Copied to clipboard

Challenge: Recent research has illuminated the possibility of selective parameter-efficient fine-tuning, which retains the inference speed of the original model and comes at no additional computational cost.
Approach: They propose to selectively update only a small subset of parameters during the fine-tuning process, keeping the remaining parameters frozen during training.
Outcome: The proposed methods retain the inference speed of the original model and come at no additional computational cost.
Parameter-Efficient Fine-Tuning of Large Language Models via Deconvolution in Subspace (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for parameter-efficient fine-tuning have been proposed to reduce time and resource costs.
Approach: They propose a parameter-efficient fine-tuning method that combines the knowledge completion capability of deconvolution with the subspace learning ability, reducing the number of parameters required for fine-uning by 8 times.
Outcome: The proposed method reduces the number of parameters required for fine-tuning by 8 times and achieves comparable or superior performance compared to existing models.
How Does Fine-tuning Affect the Geometry of Embedding Space: A Case Study on Isotropy (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for fine-tuning pre-trained language models are ineffective, despite their potential, pre-training models suffer from important weaknesses.
Approach: They analyze the extent to which the isotropy of the embedding space changes after fine-tuning.
Outcome: The proposed model improves the isotropy of embedding space after fine-tuning . the model can encode linguistic properties, but lacks the social bias needed to improve it .
Layer by Layer: Uncovering Where Multi-Task Learning Happens in Instruction-Tuned Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Pre-trained large language models retain task-specific knowledge, but where and to what extent they retain it remains unexplored.
Approach: They investigate the task-specific information encoded in pre-trained LLMs and the effects of instruction tuning on their representations across over 60 NLP tasks.
Outcome: The results show that pre-trained models retain task-specific knowledge . some tasks are already encoded in pre-train models, but others benefit from instruction tuning.
Different Tunes Played with Equal Skill: Exploring a Unified Optimization Subspace for Parameter-Efficient Tuning (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing delta tuning algorithms freeze most of the parameters and only optimize minimal adaptive parameters.
Approach: They propose to decompose DETs into a unified optimization subspace and conduct optimization within the subspace.
Outcome: The proposed DETs achieve comparable performance to the original DET and can be transferred to another DET with non-trivial performance.
Making Parameter-efficient Tuning More Efficient: A Unified Framework for Classification Tasks (2022.coling-1)

Copied to clipboard

Challenge: Large pre-trained language models (PLMs) have demonstrated superior performance in industrial applications.
Approach: They propose a framework that re-uses existing parameter-efficient methods with a unified classifier.
Outcome: The proposed framework improves the efficiency of existing parameter-efficient methods with a unified classifier.
Small Pre-trained Language Models Can be Fine-tuned as Large Models via Over-Parameterization (2023.acl-long)

Copied to clipboard

Challenge: Large pre-trained language models (PLMs) have shown remarkable performance in various natural language processing tasks, outperforming small PLMs by a large margin.
Approach: They propose to scale up parameters of pre-trained language models only during fine-tuning to benefit from over-parameterization.
Outcome: The proposed approach can significantly boost the fine-tuning performance of small PLMs and even help small PDMs outperform 3 parameterized larger ones.
A Study of Parameter Efficient Fine-tuning by Learning to Efficiently Fine-Tune (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for parameter-efficient fine-tuning (PEFT) are limited due to the need for increased computational resources.
Approach: They propose a method to learn PEFT parameters from data by projecting high dimensional parameters onto low dimensional parameter manifolds or identifying PEFT parametrically.
Outcome: The proposed method can be used to identify PEFT parameters on GLUE tasks.

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