Long Exposure: Accelerating Parameter-Efficient Fine-Tuning for LLMs under Shadowy Sparsity
Not on the map. Why?
Abstract (arXiv)
The adaptation of pre-trained large language models (LLMs) to diverse downstream tasks via fine-tuning is critical for numerous applications. However, the inefficiency of parameter-efficient fine-tuning (PEFT) techniques presents significant challenges in terms of time investments and operational costs. In this paper, we first introduce a nuanced form of sparsity, termed Shadowy Sparsity, which is distinctive in fine-tuning and has not been adequately addressed for acceleration. Under Shadowy Sparsity, we propose Long Exposure, an efficient system to accelerate PEFT for LLMs. Long Exposure comprises three key components: Shadowy-sparsity Exposer employs a prolonged sensing range to capture more sparsity details under shadowy sparsity; Sequence-oriented Predictor provides efficient yet accurate predictions to handle large sequence inputs and constantly-evolving parameters; and Dynamic-aware Operator facilitates more structured computational patterns and coalesced memory accesses, addressing dynamic sparse operations. Extensive evaluations show that Long Exposure outperforms state-of-the-arts with up to a 2.49× speedup in end-to-end fine-tuning, offering promising advancements in accelerating PEFT for LLMs.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 52 of its 66 references that are in the map. First posted on arXiv 12 Oct 2025.
Builds on
52 of 66 references.
References · 52
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2020Longformer: The Long-Document Transformercited by 3,362
38 more
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,141
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2020Reformer: The Efficient Transformercited by 1,658
- 2016Progressive Neural Networkscited by 1,332
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
- 2017Mixed Precision Trainingcited by 1,135
- 2020Long Range Arena: A Benchmark for Efficient Transformerscited by 696
- 2021Dynamic Neural Networks: A Surveycited by 405
- 2021A Survey of Transformerscited by 399
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 259
- 2017The E2E Dataset: New Challenges For End-to-End Generationcited by 252
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
- 2020SpAtten: Efficient Sparse Attention Architecture with Cascade Token and Head Pruningcited by 228
- 2022LST: Ladder Side-Tuning for Parameter and Memory Efficient Transfer Learningcited by 228
- 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 210
- 2022MegaBlocks: Efficient Sparse Training with Mixture-of-Expertscited by 204
- 2019WinoGrande: An Adversarial Winograd Schema Challenge at Scalecited by 194
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2023LLM in a flash: Efficient Large Language Model Inference with Limited Memorycited by 170
- 2015Conditional Computation in Neural Networks for faster modelscited by 166
- 2021FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learningcited by 140
- 2020Exploring Versatile Generative Language Model Via Parameter-Efficient Transfer Learningcited by 139
- 2020Sparse GPU Kernels for Deep Learningcited by 138
- 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 132
- 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 91
- 2015Fast ConvNets Using Group-wise Brain Damagecited by 81
- 2013Low-Rank Approximations for Conditional Feedforward Computation in Deep Neural Networkscited by 44
- 2021Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigmcited by 40
- 2022Parameter-Efficient Sparsity for Large Language Models Fine-Tuningcited by 27
- 2021Energon: Towards Efficient Acceleration of Transformers Using Dynamic Sparse Attentioncited by 26
- 2023PIT: Optimization of Dynamic Sparse Deep Learning Models via Permutation Invariant Transformationcited by 25
- 2023Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsitycited by 14
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.