按年被提到
20212023 · 4 次2026
大模型与语言模型›量化、解码与分词·arXiv:2111.12763 · cs.LG

Sparse is Enough in Scaling Transformers

Sebastian Jaszczur, Aakanksha Chowdhery, Afroz Mohiuddin, Łukasz Kaiser, Wojciech Gajewski, Henryk Michalewski, Jonni Kanerva · 2021
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2023-04-18 · 最近 2023-05-23
2不同的人
2活跃月份
4讨论串
36被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Large Transformer models yield impressive results on many tasks, but are expensive to train, or even fine-tune, and so slow at decoding that their use and study becomes out of reach. We address this problem by leveraging sparsity. We study sparse variants for all layers in the Transformer and propose Scaling Transformers, a family of next generation Transformer models that use sparse layers to scale efficiently and perform unbatched decoding much faster than the standard Transformer as we scale up the model size. Surprisingly, the sparse layers are enough to obtain the same perplexity as the standard Transformer with the same number of parameters. We also integrate with prior sparsity approaches to attention and enable fast inference on long sequences even with limited memory. This results in performance competitive to the state-of-the-art on long text summarization.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论kir-gadjello · 2023-04

“Thank you for developing the pipeline and amassing considerable compute for gathering and preprocessing this dataset! I'm not sure if this is the right place to ask about this, but could you consider training an LLM using a more advanced, sparse transformer architecture (specifically, "Terraformer" from this paper https://arxiv.org/abs/2111.12763 and thi…”

RedPajama: Reproduction of Llama with Friendly License (Stanford, MILA Quebec)原评论 ↗
评论kir-gadjello · 2023-05

“Impressive model, thank you for releasing it under a business-friendly license! Have you considered using Google's sparse "scaling transformer" architecture as the base? Even at 3B scale it can generate 3-4x more tokens per FLOP while being competitive at perplexity with a dense transformer. I think OpenAI uses a variant of it in their ChatGPT-3.5-Turbo …”

Replit's new Code LLM: Open Source, 77% smaller than Codex, trained in 1 week原评论 ↗
评论kir-gadjello · 2023-05

“It is quite likely GPT-4 uses one or even two sparsity approaches on top of each other (namely, coarse grained switch transformer-like and fine grained intra-tensor block sparsity), if you look at the openly available contributors' research CVs. Google, in collaboration with OpenAI, has published an impressive tour de force where they have throughly deve…”

Google “We Have No Moat, and Neither Does OpenAI”原评论 ↗
评论spi · 2023-05

“I'm pretty sure in GPT3.5+ models, this concept of attention holds no longer true. In [1] the author suggests they are using "Intra-tensor sparsity" from a 2021 paper from Google [2]. Details aside, math suggests they _must_ be using some sparse attention method: the memory used by attention is O(l^2 * d) (here O notation is a bit of overkill: it's exact…”

RWKV: Reinventing RNNs for the Transformer Era原评论 ↗