REVIEW 2 cited by
Scalable MatMul-free Language Modeling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large Language Models (LLMs) have fundamentally altered how we approach scaling in machine learning. However, these models pose substantial computational and memory challenges, primarily due to the reliance on matrix multiplication (MatMul) within their attention and feed-forward (FFN) layers. We demonstrate that MatMul operations can be eliminated from LLMs while maintaining strong performance, even at billion-parameter scales. Our MatMul-free models, tested on models up to 2.7B parameters, are comparable to state-of-the-art pre-trained Transformers, and the performance gap narrows as model size increases. Our approach yields significant memory savings: a GPU-efficient implementation reduces memory consumption by up to 61% during training and over 10x during inference. When adapted for a multi-chip neuromorphic system, the model leverages asynchronous processing to achieve 4x higher throughput with 10x less energy than edge GPUs.
Forward citations
Cited by 2 Pith papers
-
Neuromorphic Principles for Efficient Large Language Models on Intel Loihi 2
A 370M MatMul-free LLM is mapped onto Intel Loihi 2 and reported to achieve up to 3x higher generation throughput with about 2x less energy than transformer LLMs on an edge GPU, based on preliminary measurements that ...
-
RandLoRA: Full-rank parameter-efficient fine-tuning of large models
RandLoRA achieves full-rank weight updates in parameter-efficient fine-tuning by learning diagonal scalings over fixed random low-rank bases, outperforming LoRA across vision and language tasks.
Discussion (0). Continue with ORCID to comment.