English
Related papers

Related papers: SPT: Fine-Tuning Transformer-based Language Models…

200 papers

The Transformer model is widely successful on many natural language processing tasks. However, the quadratic complexity of self-attention limit its application on long text. In this paper, adopting a fine-to-coarse attention mechanism on…

Computation and Language · Computer Science 2019-11-12 Zihao Ye , Qipeng Guo , Quan Gan , Xipeng Qiu , Zheng Zhang

With the dramatically increased number of parameters in language models, sparsity methods have received ever-increasing research focus to compress and accelerate the models. While most research focuses on how to accurately retain…

Artificial Intelligence · Computer Science 2022-05-24 Yuchao Li , Fuli Luo , Chuanqi Tan , Mengdi Wang , Songfang Huang , Shen Li , Junjie Bai

The quadratic complexity of attention imposes severe memory and computational bottlenecks on Large Language Model (LLM) inference. This challenge is particularly acute for emerging agentic applications that require processing multi-million…

Machine Learning · Computer Science 2026-05-19 Ceyu Xu , Jiangnan Yu , Yongji Wu , Yuan Xie

Large language models have demonstrated capabilities in text generation, while their increasing parameter scales present challenges in computational and memory efficiency. Post-training sparsity (PTS), which reduces model cost by removing…

Computation and Language · Computer Science 2026-02-26 Minhao Jiang , Zhikai Li , Xuewen Liu , Jing Zhang , Mengjuan Chen , Qingyi Gu

The quadratic computational cost of the self-attention mechanism is a primary challenge in scaling Transformer models. While attention sparsity is widely studied as a technique to improve computational efficiency, it is almost universally…

Computation and Language · Computer Science 2025-08-11 Sagar Gandhi , Vishal Gandhi

As the context window expands, self-attention increasingly dominates the transformer's inference time. Therefore, accelerating attention computation while minimizing performance degradation is essential for the efficient deployment of Large…

Computation and Language · Computer Science 2025-03-14 Eli Sason , Darya Frolova , Boris Nazarov , Felix Goldberd

Soft Prompt Tuning (SPT) is a parameter-efficient method for adapting pre-trained language models (PLMs) to specific tasks by inserting learnable embeddings, or soft prompts, at the input layer of the PLM, without modifying its parameters.…

Computation and Language · Computer Science 2024-02-07 Fred Philippy , Siwen Guo , Shohreh Haddadan , Cedric Lothritz , Jacques Klein , Tegawendé F. Bissyandé

Large language models (LLMs) have achieved remarkable success across various tasks but face deployment challenges due to their massive computational demands. While post-training pruning methods like SparseGPT and Wanda can effectively…

Artificial Intelligence · Computer Science 2026-04-21 Qiao Xiao , Alan Ansell , Boqian Wu , Lu Yin , Mykola Pechenizkiy , Shiwei Liu , Decebal Constantin Mocanu

Attention-based architectures have achieved superior performance in multivariate time series forecasting but are computationally expensive. Techniques such as patching and adaptive masking have been developed to reduce their sizes and…

Machine Learning · Computer Science 2025-05-14 Suhan Guo , Jiahong Deng , Mengjun Yi , Furao Shen , Jian Zhao

Foundational models based on the transformer architecture are currently the state-of-the-art in general language modeling, as well as in scientific areas such as material science and climate. However, training and deploying these models is…

Machine Learning · Computer Science 2025-10-16 Adarsha Balaji , Sandeep Madireddy , Prasanna Balaprakash

Parameter-efficient fine-tuning (PEFT) has emerged as a popular solution for adapting pre-trained Vision Transformer (ViT) models to downstream applications by updating only a small subset of parameters. While current PEFT methods have…

Computer Vision and Pattern Recognition · Computer Science 2025-12-19 Ting Liu , Xuyang Liu , Liangtao Shi , Zunnan Xu , Yue Hu , Siteng Huang , Yi Xin , Bineng Zhong , Donglin Wang

Pre-trained large language models can efficiently interpolate human-written prompts in a natural way. Multitask prompted learning can help generalization through a diverse set of tasks at once, thus enhancing the potential for more…

Computation and Language · Computer Science 2022-12-22 M Saiful Bari , Aston Zhang , Shuai Zheng , Xingjian Shi , Yi Zhu , Shafiq Joty , Mu Li

We consider the problem of accurate sparse fine-tuning of large language models (LLMs), that is, fine-tuning pretrained LLMs on specialized tasks, while inducing sparsity in their weights. On the accuracy side, we observe that standard…

Computation and Language · Computer Science 2023-10-16 Eldar Kurtic , Denis Kuznedelev , Elias Frantar , Michael Goin , Dan Alistarh

Self-attention has recently been adopted for a wide range of sequence modeling problems. Despite its effectiveness, self-attention suffers from quadratic compute and memory requirements with respect to sequence length. Successful approaches…

Machine Learning · Computer Science 2020-10-27 Aurko Roy , Mohammad Saffar , Ashish Vaswani , David Grangier

Fine-tuning is an important step in adapting foundation models such as large language models to downstream tasks. To make this step more accessible to users with limited computational budgets, it is crucial to develop fine-tuning methods…

Computation and Language · Computer Science 2025-07-28 Cen-Jhih Li , Aditya Bhaskara

Large language models (LLMs) have made significant strides in complex tasks, yet their widespread adoption is impeded by substantial computational demands. With hundreds of billion parameters, transformer-based LLMs necessitate months of…

Machine Learning · Computer Science 2024-08-22 Pihe Hu , Shaolong Li , Longbo Huang

Existing approaches to increasing the effective depth of Transformers predominantly rely on parameter reuse, extending computation through recursive execution. Under this paradigm, the network structure remains static along the training…

Computation and Language · Computer Science 2026-04-17 Yao Chen , Yilong Chen , Yinqi Yang , Junyuan Shang , Zhenyu Zhang , Zefeng Zhang , Shuaiyi Nie , Shuohuan Wang , Yu Sun , Hua Wu , HaiFeng Wang , Tingwen Liu

Current PEFT methods for LLMs can achieve either high quality, efficient training, or scalable serving, but not all three simultaneously. To address this limitation, we investigate sparse fine-tuning and observe a remarkable improvement in…

Machine Learning · Computer Science 2024-12-20 Xinyu Yang , Jixuan Leng , Geyang Guo , Jiawei Zhao , Ryumei Nakada , Linjun Zhang , Huaxiu Yao , Beidi Chen

The quadratic complexity of self-attention in Transformer models remains a significant bottleneck for processing long sequences and deploying large language models efficiently. For this approach, there has been significant research into…

Computation and Language · Computer Science 2026-05-26 Spandan Pratyush

Transformer has achieved great success in NLP. However, the quadratic complexity of the self-attention mechanism in Transformer makes it inefficient in handling long sequences. Many existing works explore to accelerate Transformers by…

Computation and Language · Computer Science 2021-09-03 Chuhan Wu , Fangzhao Wu , Tao Qi , Binxing Jiao , Daxin Jiang , Yongfeng Huang , Xing Xie
‹ Prev 1 2 3 10 Next ›