There is a "bug" in commonly used activation functions (ReLU/SiLU/GeLU etc.) ---- The mean of post-activations is not zero.
This bug, however small it seems, leads to pathologies of training dynamics, including loss spikes & representation overshooting.
By removing the bug, we get improved performance in LLMs and ViTs.
The science of AI can never be under-estimated.
- FlashGDN-2(probably will try also FlashKronLSTM)
- My own open source python library (mostly Rust code) for image processing, I want to leverage a lot of JPEG XL features for better performance
- EMBER, open source ent-to-end T2I diffusion model with small amount of compute(probably I will close this project and publish this model under another name, more details in future)
@ianhildy Because it's indicative? (Argon's training set might have included the exact same or highly similar tasks to those in open benchmarks), whereas Carbon might already contain new private tasks(?) (it's not certain, but there's a chance).
I've always believed that intelligence should come from simple, general building blocks that learn their own abstractions directly from raw data; in other words, the bitter lesson. I think we're finally seeing a real step towards AI that can learn from all data.
Language modeling on raw bytes is a microcosm of this ideal, and to me it's a central problem in AI: if we can't build LLMs that learn end-to-end from bytes, how will we handle the rest of the world's data that we understand even less?
Last year we introduced hierarchical networks (H-Nets) as a first step. Our new version finds up to 3-5x efficiency gains in controlled scaling law experiments, and at larger scale matches an open-source model trained on 11T tokens with ~10x less data and compute. The posts below walk through what we found and why we think it works.