English
Related papers

Related papers: MemoryLLM: Plug-n-Play Interpretable Feed-Forward …

200 papers

Large language models (LLMs) have demonstrated exceptional performance across a variety of tasks. However, their substantial scale leads to significant computational resource consumption during inference, resulting in high costs.…

Machine Learning · Computer Science 2025-06-13 Zhaode Wang , Jingbang Yang , Xinyu Qian , Shiwen Xing , Xiaotang Jiang , Chengfei Lv , Shengyu Zhang

While Large Language Models (LLMs) demonstrate strong performance across domains, their long-context capabilities are limited by transient neural activations causing information decay and unstructured feed-forward network (FFN) weights…

Neurons and Cognition · Quantitative Biology 2026-04-13 Kangcong Li , Peng Ye , Chongjun Tu , Lin Zhang , Chunfeng Song , Jiamin Wu , Tao Yang , Qihao Zheng , Tao Chen

Distributional semantics based on neural approaches is a cornerstone of Natural Language Processing, with surprising connections to human meaning representation as well. Recent Transformer-based Language Models have proven capable of…

Computation and Language · Computer Science 2022-04-04 Daniel Loureiro , Alípio Mário Jorge , Jose Camacho-Collados

Empowering LLMs with the ability to precisely understand long contexts is crucial for many downstream applications. However, handling long contexts with conventional transformer architecture requires substantial training and inference…

Computation and Language · Computer Science 2024-12-24 Zhenyu Li , Yike Zhang , Tengyu Pan , Yutao Sun , Zhichao Duan , Junjie Fang , Rong Han , Zixuan Wang , Jianyong Wang

The Transformer architecture has two main non-embedding components: Attention and the Feed Forward Network (FFN). Attention captures interdependencies between words regardless of their position, while the FFN non-linearly transforms each…

Computation and Language · Computer Science 2023-10-24 Telmo Pessoa Pires , António V. Lopes , Yannick Assogba , Hendra Setiawan

This work introduces an efficient method to scale Transformer-based Large Language Models (LLMs) to infinitely long inputs with bounded memory and computation. A key component in our proposed approach is a new attention technique dubbed…

Computation and Language · Computer Science 2024-08-13 Tsendsuren Munkhdalai , Manaal Faruqui , Siddharth Gopal

While Large Language Models (LLMs) have achieved remarkable success in various fields, the efficiency of training and inference remains a major challenge. To address this issue, we propose SUBLLM, short for Subsampling-Upsampling-Bypass…

Computation and Language · Computer Science 2024-08-26 Quandong Wang , Yuxuan Yuan , Xiaoyu Yang , Ruike Zhang , Kang Zhao , Wei Liu , Jian Luan , Daniel Povey , Bin Wang

Deep learning models have achieved state-of-the-art performance in many classification tasks. However, most of them cannot provide an interpretation for their classification results. Machine learning models that are interpretable are…

Machine Learning · Computer Science 2021-11-04 Miles Q. Li , Benjamin C. M. Fung , Adel Abusitta

We explore Multi-Head FFN (MH-FFN) as a replacement of FFN in the Transformer architecture, motivated by the structural similarity between single-head attention and FFN. While multi-head mechanisms enhance expressivity in attention, naively…

Machine Learning · Computer Science 2025-12-09 Minshen Zhang , Xiang Hu , Jianguo Li , Wei Wu , Kewei Tu

Large Language Models (LLMs) face challenges for on-device inference due to high memory demands. Traditional methods to reduce memory usage often compromise performance and lack adaptability. We propose FlexInfer, an optimized offloading…

Operating Systems · Computer Science 2025-03-07 Hongchao Du , Shangyu Wu , Arina Kharlamova , Nan Guan , Chun Jason Xue

Recent years have witnessed increasing interests in prompt-based learning in which models can be trained on only a few annotated instances, making them suitable in low-resource settings. When using prompt-based learning for text…

Computation and Language · Computer Science 2023-05-11 Hongjing Li , Hanqi Yan , Yanran Li , Li Qian , Yulan He , Lin Gui

Transformer models have revolutionized natural language processing, achieving state-of-the-art performance and demonstrating remarkable scalability. However, their memory demands, particularly due to maintaining full context in memory, pose…

Computation and Language · Computer Science 2025-11-04 Juan Gabriel Kostelec , Qinghai Guo

Large Language Models (LLMs) have shown strong abilities in general language tasks, yet adapting them to specific domains remains a challenge. Current method like Domain Adaptive Pretraining (DAPT) requires costly full-parameter training…

Computation and Language · Computer Science 2025-10-24 Jiaqi Cao , Jiarui Wang , Rubin Wei , Qipeng Guo , Kai Chen , Bowen Zhou , Zhouhan Lin

Although large language models (LLMs) have demonstrated remarkable performance, the lack of transparency in their inference logic raises concerns about their trustworthiness. To gain a better understanding of LLMs, we conduct a detailed…

Computation and Language · Computer Science 2024-07-26 Jie Ren , Qipeng Guo , Hang Yan , Dongrui Liu , Quanshi Zhang , Xipeng Qiu , Dahua Lin

Large language models (LLMs) excel in generating coherent text, but they often struggle with context awareness, leading to inaccuracies in tasks requiring faithful adherence to provided information. We introduce FastMem, a novel method…

Computation and Language · Computer Science 2024-10-08 Junyi Zhu , Shuochen Liu , Yu Yu , Bo Tang , Yibo Yan , Zhiyu Li , Feiyu Xiong , Tong Xu , Matthew B. Blaschko

Large Language Models (LLMs) are constrained by their inability to process lengthy inputs, resulting in the loss of critical historical information. To address this limitation, in this paper, we propose the Self-Controlled Memory (SCM)…

Computation and Language · Computer Science 2025-03-19 Bing Wang , Xinnian Liang , Jian Yang , Hui Huang , Shuangzhi Wu , Peihao Wu , Lu Lu , Zejun Ma , Zhoujun Li

The quadratic complexity of the attention module makes it gradually become the bulk of compute in Transformer-based LLMs during generation. Moreover, the excessive key-value cache that arises when dealing with long inputs also brings severe…

Computation and Language · Computer Science 2023-10-17 Siyu Ren , Qi Jia , Kenny Q. Zhu

The prefill stage of large language model (LLM) inference is a key computational bottleneck for long-context workloads. At short-to-moderate context lengths (1K--16K tokens), Feed-Forward Networks (FFNs) dominate this cost, accounting for…

Machine Learning · Computer Science 2026-02-03 Aayush Gautam , Mukul Gagrani , Junyoung Park , Mingu Lee , Chiris Lott , Narasimha Reddy

The efficiency of Large Language Model~(LLM) inference is often constrained by substantial memory bandwidth and capacity demands. Existing techniques, such as pruning, quantization, and mixture of experts/depth, reduce memory capacity…

Hardware Architecture · Computer Science 2025-04-23 Rui Xie , Asad Ul Haq , Linsen Ma , Yunhua Fang , Zirak Burzin Engineer , Liu Liu , Tong Zhang

Large language models (LLMs) are in need of sufficient contexts to handle many critical applications, such as retrieval augmented generation and few-shot learning. However, due to the constrained window size, the LLMs can only access to the…

Computation and Language · Computer Science 2024-01-17 Ninglu Shao , Shitao Xiao , Zheng Liu , Peitian Zhang