mlsanityData to 7 Oct 2026

Explicit Foundation Model Optimization with Self-Attentive Feed-Forward Neural Units

arXiv 2311.07510 ↗First posted 13 Nov 2023cs.LG math.PR physics.data-ancited by 0

Not on the map. Why?

Abstract (arXiv)

Iterative approximation methods using backpropagation enable the optimization of neural networks, but they remain computationally expensive, especially when used at scale. This paper presents an efficient alternative for optimizing neural networks that reduces the costs of scaling neural networks and provides high-efficiency optimizations for low-resource applications. We will discuss a general result about feed-forward neural networks and then extend this solution to compositional (mult-layer) networks, which are applied to a simplified transformer block containing feed-forward and self-attention layers. These models are used to train highly-specified and complex multi-layer neural architectures that we refer to as self-attentive feed-forward unit (SAFFU) layers, which we use to develop a transformer that appears to generalize well over small, cognitively-feasible, volumes of data. Testing demonstrates explicit solutions outperform models optimized by backpropagation alone. Moreover, further application of backpropagation after explicit solutions leads to better optima from smaller scales of data, training effective models from much less data is enabled by explicit solution warm starts. We then carry out ablation experiments training a roadmap of about 250 transformer models over 1-million tokens to determine ideal settings. We find that multiple different architectural variants produce highly-performant models, and discover from this ablation that some of the best are not the most parameterized. This appears to indicate well-generalized models could be reached using less data by using explicit solutions, and that architectural exploration using explicit solutions pays dividends in guiding the search for efficient variants with fewer parameters, and which could be incorporated into low-resource hardware where AI might be embodied.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 19 references that are in the map. First posted on arXiv 13 Nov 2023.

Builds on

13 of 19 references.

References · 13

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  3. 2021Zero-Shot Text-to-Image Generationcited by 4,276
  4. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  5. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
  6. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
  7. 2021Ethical and social risks of harm from Language Modelscited by 957
  8. 2022What learning algorithm is in-context learning? Investigations with linear modelscited by 671
  9. 2023An Overview of Catastrophic AI Riskscited by 214
  10. 2021Alignment of Language Agentscited by 167
  11. 2021Understanding the Capabilities, Limitations, and Societal Impact of Large Language Modelscited by 159
  12. 2023Call for Papers -- The BabyLM Challenge: Sample-efficient pretraining on a developmentally plausible corpuscited by 62
1 more
  1. 2023On Efficient Training of Large-Scale Deep Learning Models: A Literature Reviewcited by 26

Built on by

Not cited yet.