paperbot · PL 论文追踪

全部论文 待读 收藏

P2 oFFN: Outlier and Neuron-aware Structured FFN for Fast yet Accurate LLM Inference

oFFN:面向离群值与神经元感知的结构化 FFN,实现快速且准确的 LLM 推理
ASPLOS Proceedings of the 31st ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 22026匹配度 2/10 · 该论文聚焦 LLM 推理加速与 FFN 稀疏化/结构化重排,属于模型系统优化,未涉及静态分析、Agentic 程序、浮点程序分析、贝叶斯程序分析或 LLM 辅助程序分析。与画像核心方向交叉很少,仅同属 ML/LLM 系统优化外围。引用 0 inbox
Geunsoo Song, Hoeseok Yang, Youngmin Yi
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:提出 oFFN,通过行列重排 FFN 权重同时利用激活离群值与冷热神经元,实现快速准确的稀疏 LLM 推理。

大模型推理可借助 ReLU 化 LLM 的输出激活稀疏性跳过整块内存访问与计算,但前提是快速且准确地预测输出稀疏性。现有工作或单独处理激活离群值,或单独处理热/冷神经元,未将二者结构化整合。本文指出这两种现象密切相关,并提出 oFFN:在行、列两个维度重排 FFN 权重,在考虑离群值的同时高效准确地预测输出稀疏性,并分离热、冷神经元分别以各自最优的算子计算;即使 batch size 动态变化,也能为每个神经元选择最优计算路径。实验显示,相比稠密推理端到端最高提速 2.01×,ReLU 化 LLM 自回归解码下 FFN 层最高提速 5.46×,精度损失可忽略,且快于已有稀疏预测方法。

问题
在 ReLU 化 LLM 推理中,如何快速且准确地预测输出激活稀疏性,并同时应对激活离群值与热/冷神经元这两种现象,从而跳过不必要的内存访问与计算。
方法
揭示激活离群值与热/冷神经元之间的关联,提出 oFFN 架构:在行与列维度重排 FFN 权重,结构化地支持考虑离群值的稀疏预测与冷热神经元分离,并为每个神经元动态选择最优计算路径。
评估
在 ReLU 化 LLM 上与稠密推理及已有稀疏预测技术对比,测量端到端与 FFN 层的推理加速比以及精度损失。
原文摘要(Abstract)

With the advent of large-scale language models (LLMs), various optimization techniques have been proposed to enable efficient inference. Among these, methods that aggressively exploit output activation sparsity have attracted significant attention, which leverage ReLU-fied LLMs and skip the entire memory accesses as well as the computation for the output element if it was predicted as sparse. Achieving fast and accurate prediction of output activation sparsity is crucial to enhancing inference efficiency. However, in practice, phenomena such as activation outliers and hot and cold neurons, which significantly affect the exploitation of sparsity during LLM inference, have either been addressed individually or not structurally integrated in existing work. In this paper, we reveal that these two phenomena are closely related and propose a novel FFN architecture called oFFN (Outlier-aware Structured FFN) that effectively exploits them simultaneously. The proposed method rearranges the FFN weights in both row and column dimensions to enable efficient and accurate prediction of output sparsity, considering outliers, and to enable separation of hot and cold neurons, computing them with respective optimal operations. The proposed method allows for the optimal computation path for each neuron, even when the batch size dynamically changes. Compared to existing sparsity prediction techniques, our method achieves the fastest speed with negligible accuracy loss. Experimental results show that it delivers up to 2.01× faster end-to-end inference speed compared to dense inference, and up to 5.46× acceleration in FFN layers under autoregressive decoding in ReLU-fied LLMs.

链接与引用

DOI 原文 · PDF(开放获取) · DBLP

BibTeX
@inproceedings{SongYY26,
  title = {oFFN: Outlier and Neuron-aware Structured FFN for Fast yet Accurate LLM Inference},
  author = {Geunsoo Song and Hoeseok Yang and Youngmin Yi},
  booktitle = {ASPLOS},
  year = {2026},
  doi = {10.1145/3779212.3790194}
}