Paper recorded by Signals 4 on 2026-10-08 in cs.CL. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-08 on arXiv · recorded by Signals 4 on 2026-10-09
Category: cs.CL · 自然语言处理 · first seen 2026-10-09
The memory-bound nature of the decoding stage of large language model (LLM) inference incurs significant latency. Layer-wise training-free network pruning approaches guided by the Hessian have been a prominent solution to this problem, as pruning reduces the number of nonzero parameters read from memory during decoding. Nevertheless, typical methods in this line compute the Hessian using pre-colle