StartledWatermelon@alien.topBtoMachine Learning@academy.garden•[R] Exponentially Faster Language ModellingEnglish
1·
1 year agoThe output of each parent neuron is basically treated as logit. So no activation is necessary. At inference, the logits below zero correspond to the choice of one child node and logits above zero correspond to the choice of alternative child node. At their deepest model, there are 11 such consecutive choices to be made, a descent down the binary tree.
The specifics of training are discussed in the previous paper of the authors. All nodes are computed during training so there’s no speed-up at this stage compared to vanilla dense layer.
The number of neurons that should be used is fixed in advance. Basically, it’s determined by the shape of the tree in which neurons are organised.
GPT-4: 1.76 trillion parameters, about 6.5* trillion tokens in the dataset.