The reviewed record of science sign in
Pith

arxiv: 2403.20284 · v1 · pith:W2Y3YRH6 · submitted 2024-03-29 · cs.CL · cs.LG

LayerNorm: A key component in parameter-efficient fine-tuning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:W2Y3YRH6record.jsonopen to challenge →

classification cs.CL cs.LG
keywords fine-tuninglayernormbertmodelmanyonlyparameter-efficienttasks
0
0 comments X
read the original abstract

Fine-tuning a pre-trained model, such as Bidirectional Encoder Representations from Transformers (BERT), has been proven to be an effective method for solving many natural language processing (NLP) tasks. However, due to the large number of parameters in many state-of-the-art NLP models, including BERT, the process of fine-tuning is computationally expensive. One attractive solution to this issue is parameter-efficient fine-tuning, which involves modifying only a minimal segment of the model while keeping the remainder unchanged. Yet, it remains unclear which segment of the BERT model is crucial for fine-tuning. In this paper, we first analyze different components in the BERT model to pinpoint which one undergoes the most significant changes after fine-tuning. We find that output LayerNorm changes more than any other components when fine-tuned for different General Language Understanding Evaluation (GLUE) tasks. Then we show that only fine-tuning the LayerNorm can reach comparable, or in some cases better, performance to full fine-tuning and other parameter-efficient fine-tuning methods. Moreover, we use Fisher information to determine the most critical subset of LayerNorm and demonstrate that many NLP tasks in the GLUE benchmark can be solved by fine-tuning only a small portion of LayerNorm with negligible performance degradation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Robust Promptable Video Object Segmentation

    cs.CV 2026-05 unverdicted novelty 7.0

    The paper creates a real-world corruption benchmark for promptable video object segmentation and proposes MoGA, which uses object-specific memory to improve robustness and temporal consistency under adverse conditions.

  2. Deepfake Detection that Generalizes Across Benchmarks

    cs.CV 2025-08 accept novelty 6.0

    GenD achieves state-of-the-art average cross-dataset AUROC in deepfake detection by parameter-efficient adaptation of a foundational vision encoder with hyperspherical manifold enforcement via L2 normalization and met...