Fast Feedforward Networks
Authors: Peter Belcak, Roger Wattenhofer
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
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.
Tools for this paper
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.
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 representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
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.