Geoffrey Hinton tweeted a guide to tuning deep learning models. Definitely reading this one tomorrow:
https://twitter.com/geoffreyhinton/status/1616154554768162818
https://twitter.com/geoffreyhinton/status/1616154554768162818
X (formerly Twitter)
Geoffrey Hinton (@geoffreyhinton) on X
A huge amount of practical experience has been distilled into this great guide to tuning deep learning models.
❤1
S4 ready to prod? Colab with the author of Flash Attention
https://twitter.com/realdanfu/status/1617605971395891201
https://twitter.com/realdanfu/status/1617605971395891201
Twitter
Attention is all you need... but how much of it do you need?
Announcing H3 - a new generative language models that outperforms GPT-Neo-2.7B with only *2* attention layers! Accepted as a *spotlight* at #ICLR2023! 📣 w/ @tri_dao
📜 https://t.co/vKdOTCH8Lk…
Announcing H3 - a new generative language models that outperforms GPT-Neo-2.7B with only *2* attention layers! Accepted as a *spotlight* at #ICLR2023! 📣 w/ @tri_dao
📜 https://t.co/vKdOTCH8Lk…
Bidirectional attention and unidirectional attention in one model can be achieved by changing the attention mask. This is called "Prefix LM"
https://www.semanticscholar.org/paper/Generating-Wikipedia-by-Summarizing-Long-Sequences-Liu-Saleh/7570afa31c68e24fce1342b7d67c591787219bc1
The image is from the T5 paper.
https://www.semanticscholar.org/paper/Generating-Wikipedia-by-Summarizing-Long-Sequences-Liu-Saleh/7570afa31c68e24fce1342b7d67c591787219bc1
The image is from the T5 paper.
https://twitter.com/30SecToMercury/status/1626265029346566145
HMM efficient forward-backward kernel + representation learning method
> However, running dynamic programming in Pytorch is computationally expensive especially for long sequences such as speech.
> This repo provides a C++ kernel of the HMM layer, gradients are computed with batched message passing algorithm (also known as forward-backward).
HMM efficient forward-backward kernel + representation learning method
> However, running dynamic programming in Pytorch is computationally expensive especially for long sequences such as speech.
> This repo provides a C++ kernel of the HMM layer, gradients are computed with batched message passing algorithm (also known as forward-backward).
Twitter
My paper on learning discrete speech representations with neural HMMs was accepted at ICASSP23 🎉
paper:
https://t.co/hhTegkp11U
The hmm layer:
https://t.co/k9BnwC4aD4
paper:
https://t.co/hhTegkp11U
The hmm layer:
https://t.co/k9BnwC4aD4
All you need is a good init, again
1. Model warmup (zipformer) is not only a soft way to speed up training (in contrast to train small, double, continue on medium) IS ALSO a way to mitigate attention rank collapse.
2. Deep attention loses rank very quickly as depth grows — attention can collapse when training large models. Probably hints at an explanation of why my causal -> bidirectional GPT adaptation failed.
https://twitter.com/bobby_he/status/1628388400142204928
1. Model warmup (zipformer) is not only a soft way to speed up training (in contrast to train small, double, continue on medium) IS ALSO a way to mitigate attention rank collapse.
2. Deep attention loses rank very quickly as depth grows — attention can collapse when training large models. Probably hints at an explanation of why my causal -> bidirectional GPT adaptation failed.
https://twitter.com/bobby_he/status/1628388400142204928
Ok you might have caught the wind that I like dabbing with LSTM now. In my second paper on GPT-2 (details later!) reviewers noticed that the LSTM baseline performed surprisingly well and encouraged me to dig deeper. Here's a slide on LSTM limitations from the man himself: https://people.idsia.ch/~juergen/lstm/sld025.htm
In the modern world shooting sparrows with cannons means using context length 1024 and larger when you can fit your data into 128 time steps.
Yes, you can stack 5 MFCC time steps with no overlap no problem
Yes, you can stack 5 MFCC time steps with no overlap no problem
> We note that the models trained on uniformly distributed samples seem to perform the best amongst all the four distributions in all the three languages.
https://aclanthology.org/W19-0128.pdf
Let's find out if resampling my dataset is going to help with the data distributed like on the attached figure.
https://aclanthology.org/W19-0128.pdf
Let's find out if resampling my dataset is going to help with the data distributed like on the attached figure.
This video is definitely validating my anxieties when training models https://www.youtube.com/watch?v=p9IxoSkvZ-M
In our previous work we trained several GPT-style models on UberText 2.0 and found that
1. the bigger transformer the faster to train (applying Chinchilla scaling laws to Ukrainian datasets)
2. small transformers seem to struggle with context lookup, which we fix by constraining decoding
3. small multi-task decoder-only models lose to small encoder-decoder models pretrained more (possibly out of domain) data and finetuned on one task (in retrospect really hoped that one would not be true)
Please enjoy:
https://aclanthology.org/2023.unlp-1.4/
You can play with the models by doing
Since then we learned that context lookup (aka induction heads) requires 2^14 *tasks* in decoder-only models, and it's feasible using synthetic pretraining (Kirsch on GPICL 2022). We also learned a thing or two about learning rate schedules, like pretend convergences happen faster if you decay early (search for Vaswani on arxiv), Dmytro is currently playing with that on TPUs.
Now it's time to take all that to speech!
1. the bigger transformer the faster to train (applying Chinchilla scaling laws to Ukrainian datasets)
2. small transformers seem to struggle with context lookup, which we fix by constraining decoding
3. small multi-task decoder-only models lose to small encoder-decoder models pretrained more (possibly out of domain) data and finetuned on one task (in retrospect really hoped that one would not be true)
Please enjoy:
https://aclanthology.org/2023.unlp-1.4/
You can play with the models by doing
pip install haloop, see instructions in https://github.com/proger/haloopSince then we learned that context lookup (aka induction heads) requires 2^14 *tasks* in decoder-only models, and it's feasible using synthetic pretraining (Kirsch on GPICL 2022). We also learned a thing or two about learning rate schedules, like pretend convergences happen faster if you decay early (search for Vaswani on arxiv), Dmytro is currently playing with that on TPUs.
Now it's time to take all that to speech!
ACL Anthology
GPT-2 Metadata Pretraining Towards Instruction Finetuning for Ukrainian
Volodymyr Kyrylov, Dmytro Chaplynskyi. Proceedings of the Second Ukrainian Natural Language Processing Workshop (UNLP). 2023.
Oh, and metadata pretraining is awesome. Stop cleaning your data, let the transformer slurp it all in.