Fast Feedforward Networks

Authors: Peter Belcak, Roger Wattenhofer

12 pages, 6 figures, 4 tables

Results of the summarizing process for the arXiv paper: 2308.14711v2

  • Comprehensive Summary
  • Key points
  • Layman's Summary
  • Blog article
In their paper titled "Fast Feedforward Networks," authors Peter Belcak and Roger Wattenhofer introduce the fast feedforward (FFF) architecture as a log-time alternative to traditional feedforward networks. The FFF architecture breaks the linear link between layer size and inference cost, offering significant improvements in speed and efficiency. The authors demonstrate that FFFs outperform feedforward networks by up to 220 times in terms of speed. Additionally, FFFs are up to 6 times faster than mixture-of-experts networks, which are commonly used for complex tasks. Moreover, FFFs exhibit superior training properties compared to mixtures of experts due to noiseless conditional execution. By pushing the limits of FFFs, the authors show that these networks can achieve remarkable efficiency in vision transformers. They reveal that FFFs can utilize as little as 1% of layer neurons for inference while still preserving an impressive 94.2% of predictive performance. Overall, this research presents a groundbreaking approach to neural network architecture with the introduction of the fast feedforward (FFF) architecture. The findings highlight its potential for significantly improving inference speed and efficiency compared to traditional feedforward networks and mixture-of-experts networks. Furthermore, FFFs offer better training properties thanks to noiseless conditional execution. The study's results also demonstrate how FFFs can achieve exceptional efficiency in vision transformers by utilizing a minimal percentage of layer neurons while maintaining high predictive performance levels.
AI-generated keywords: Fast Feedforward Efficiency Inference Speed Mixture-of-Experts Vision Transformers

AI-generated Key Points

  • Fast feedforward (FFF) architecture introduced as a log-time alternative to traditional feedforward networks
  • FFF architecture breaks the linear link between layer size and inference cost, leading to improvements in speed and efficiency
  • FFFs outperform feedforward networks by up to 220 times in terms of speed
  • FFFs are up to 6 times faster than mixture-of-experts networks commonly used for complex tasks
  • FFFs exhibit superior training properties compared to mixtures of experts due to noiseless conditional execution
  • FFFs can achieve remarkable efficiency in vision transformers by utilizing as little as 1% of layer neurons while preserving 94.2% predictive performance
  • Potential for significantly improving inference speed and efficiency compared to traditional feedforward networks and mixture-of-experts networks
  • Better training properties thanks to noiseless conditional execution
Also access our AI generated: Comprehensive summary, Lay summary, Blog-like article; or ask questions about this paper to our AI assistant.

Abstract: We break the linear link between the layer size and its inference cost by introducing the fast feedforward (FFF) architecture, a log-time alternative to feedforward networks. We demonstrate that FFFs are up to 220x faster than feedforward networks, up to 6x faster than mixture-of-experts networks, and exhibit better training properties than mixtures of experts thanks to noiseless conditional execution. Pushing FFFs to the limit, we show that they can use as little as 1% of layer neurons for inference in vision transformers while preserving 94.2% of predictive performance.

Submitted to arXiv on 28 Aug. 2023

Tools for this paper

Explain it differently 3 free rewrites left today
Export BibTeX · RIS (Zotero, Mendeley, EndNote) · Markdown (Notion, Obsidian) · Premium
Citation alerts Premium
Journal club Slides to present it Premium
For journalists Press kit and hype check Premium

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Assess the quality of the AI-generated content by voting

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.