English
Related papers

Related papers: FTP: A Fine-grained Token-wise Pruner for Large La…

200 papers

Large language models (LLMs) achieve state-of-the-art accuracy on complex reasoning tasks by generating multiple chain-of-thought (CoT) traces, but using a fixed token budget per query leads to over-computation on easy inputs and…

Artificial Intelligence · Computer Science 2026-02-03 Katrina Brown , Aneesh Muppidi , Rana Shahout

Many efforts have been made to facilitate natural language processing tasks with pre-trained language models (LMs), and brought significant improvements to various applications. To fully leverage the nearly unlimited corpora and capture…

Computation and Language · Computer Science 2018-09-11 Liyuan Liu , Xiang Ren , Jingbo Shang , Jian Peng , Jiawei Han

Large Reasoning Models (LRMs) significantly improve the reasoning ability of Large Language Models (LLMs) by learning to reason, exhibiting promising performance in solving complex tasks. However, their deliberative reasoning process leads…

Computation and Language · Computer Science 2025-08-14 Yue Liu , Jiaying Wu , Yufei He , Ruihan Gong , Jun Xia , Liang Li , Hongcheng Gao , Hongyu Chen , Baolong Bi , Jiaheng Zhang , Zhiqi Huang , Bryan Hooi , Stan Z. Li , Keqin Li

Large Language Models (LLMs) have achieved remarkable success with their billion-level parameters, yet they incur high inference overheads. The emergence of activation sparsity in LLMs provides a natural approach to reduce this cost by…

Computation and Language · Computer Science 2024-12-13 Haizhong Zheng , Xiaoyan Bai , Xueshen Liu , Z. Morley Mao , Beidi Chen , Fan Lai , Atul Prakash

Pruning is a widely used technique to compress large language models (LLMs) by removing unimportant weights, but it often suffers from significant performance degradation - especially under semi-structured sparsity constraints. Existing…

Machine Learning · Computer Science 2025-12-18 Tianteng Gu , Bei Liu , Bo Xiao , Ke Zeng , Jiacheng Liu , Yanmin Qian

The rapid advancements in Large Language Models (LLMs) have revolutionized natural language processing (NLP) and related fields. However, fine-tuning these models for specific tasks remains computationally expensive and risks degrading…

Computation and Language · Computer Science 2024-12-17 Md Kowsher , Nusrat Jahan Prottasha , Prakash Bhat

The prohibitive training costs of Large Language Models (LLMs) have emerged as a significant bottleneck in the development of next-generation LLMs. In this paper, we show that it is possible to significantly reduce the training costs of…

Computation and Language · Computer Science 2025-05-16 Chenze Shao , Fandong Meng , Jie Zhou

Pruning is a critical strategy for compressing trained large language models (LLMs), aiming at substantial memory conservation and computational acceleration without compromising performance. However, existing pruning methods often…

Machine Learning · Computer Science 2024-08-08 Pengxiang Zhao , Hanyu Hu , Ping Li , Yi Zheng , Zhefeng Wang , Xiaoming Yuan

Despite achieving remarkable performance on various vision-language tasks, Transformer-based Vision-Language Models (VLMs) suffer from redundancy in inputs and parameters, significantly hampering their efficiency in real-world applications.…

Computation and Language · Computer Science 2024-02-27 Zekun Wang , Jingchang Chen , Wangchunshu Zhou , Haichao Zhu , Jiafeng Liang , Liping Shan , Ming Liu , Dongliang Xu , Qing Yang , Bing Qin

Neural Networks can be effectively compressed through pruning, significantly reducing storage and compute demands while maintaining predictive performance. Simple yet effective methods like magnitude pruning remove less important parameters…

Machine Learning · Computer Science 2025-12-03 Max Zimmer , Megi Andoni , Christoph Spiegel , Sebastian Pokutta

Multimodal large language models (MLLMs) incur substantial inference cost due to the processing of hundreds of visual tokens per image. Although token pruning has proven effective for accelerating inference, determining when and where to…

Computer Vision and Pattern Recognition · Computer Science 2026-02-20 Yahong Wang , Juncheng Wu , Zhangkai Ni , Chengmei Yang , Yihang Liu , Longzhen Yang , Yuyin Zhou , Ying Wen , Lianghua He

The high computational demands of Large Language Models (LLMs) motivate methods that reduce parameter count and accelerate inference. In response, model pruning emerges as an effective strategy, yet current methods typically focus on a…

Large Language Models (LLMs) are widely deployed in real-world applications, yet their internal mechanisms remain difficult to interpret and control, limiting our ability to diagnose and correct undesirable behaviors. Mechanistic…

Large Language Models (LLMs) have grown increasingly expensive to deploy, driving the need for effective model compression techniques. While block pruning offers a straightforward approach to reducing model size, existing methods often…

Computation and Language · Computer Science 2025-03-11 Haryo Akbarianto Wibowo , Haiyue Song , Hideki Tanaka , Masao Utiyama , Alham Fikri Aji , Raj Dabre

Large language models (LLMs) are increasingly adapted into domain-specific variants for applications in law, healthcare, and finance. Their scale, however, limits deployment in resource-constrained settings, and existing compression…

Machine Learning · Computer Science 2026-01-23 Songlin Zhao , Michael Pitts , Zhuwei Qin

Large Vision-Language Models (LVLMs) rely on dense visual tokens to capture fine-grained visual information, but processing all these tokens incurs substantial computational and memory overhead during inference. To address this issue, we…

Machine Learning · Computer Science 2026-03-24 Xu Li , Yi Zheng , Yuxuan Liang , Zhe Liu , Xiaolei Chen , Haotian Chen , Rui Zhu , Xiangyang Xue

Scaling autoregressive large language models (LLMs) has driven unprecedented progress but comes with vast computational costs. In this work, we tackle these costs by leveraging unstructured sparsity within an LLM's feedforward layers, the…

Machine Learning · Computer Science 2026-05-11 Edoardo Cetin , Stefano Peluchetti , Emilio Castillo , Akira Naruse , Mana Murakami , Llion Jones

Video Large Language Models (VLLMs) incur substantial prefilling cost due to the large number of visual tokens. While attention-based token pruning offers a promising acceleration strategy, applying it at shallow decoder layers often causes…

Computer Vision and Pattern Recognition · Computer Science 2026-03-17 Yingjie Xia , Tao Liu , Jinglei Shi , Qingsong Xie , Heng Guo , Jian Yang , Xi Wang

Vision language models (VLMs) demonstrate strong capabilities in jointly processing visual and textual data. However, they often incur substantial computational overhead due to redundant visual information, particularly in long-form video…

Machine Learning · Computer Science 2025-04-25 Yudong Liu , Jingwei Sun , Yueqian Lin , Jingyang Zhang , Ming Yin , Qinsi Wang , Jianyi Zhang , Hai Li , Yiran Chen

Although large vision-language models (LVLMs) have demonstrated impressive capabilities in multi-modal understanding and reasoning, their practical applications are still limited by massive model parameters and high computational costs.…

Computer Vision and Pattern Recognition · Computer Science 2025-08-01 Ji Ma , Wei Suo , Peng Wang , Yanning Zhang
‹ Prev 1 8 9 10 Next ›