shawntan / SUTLinks
Repository for Sparse Universal Transformers
☆20Updated 2 years ago
Alternatives and similar repositories for SUT
Users that are interested in SUT are comparing it to the libraries listed below
Sorting:
- ☆53Updated last year
- ☆46Updated 2 years ago
- Official repository of paper "RNNs Are Not Transformers (Yet): The Key Bottleneck on In-context Retrieval"☆27Updated last year
- ☆35Updated last year
- ☆51Updated 2 years ago
- Experiments on the impact of depth in transformers and SSMs.☆40Updated 3 months ago
- Stick-breaking attention☆62Updated 7 months ago
- ☆62Updated last year
- Official repository for the paper "Approximating Two-Layer Feedforward Networks for Efficient Transformers"☆38Updated 7 months ago
- Official implementation of the transformer (TF) architecture suggested in a paper entitled "Looped Transformers as Programmable Computers…☆30Updated 2 years ago
- ☆35Updated last year
- Implementation of Hyena Hierarchy in JAX☆10Updated 2 years ago
- Here we will test various linear attention designs.☆62Updated last year
- Code for NeurIPS 2024 Spotlight: "Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durations"☆88Updated last year
- ☆33Updated last year
- Official code for the paper "Attention as a Hypernetwork"☆47Updated last year
- ☆83Updated 2 years ago
- Parallelizing non-linear sequential models over the sequence length☆56Updated 7 months ago
- Yet another random morning idea to be quickly tried and architecture shared if it works; to allow the transformer to pause for any amount…☆53Updated 2 years ago
- ☆16Updated 2 years ago
- Triton Implementation of HyperAttention Algorithm☆48Updated 2 years ago
- Efficient PScan implementation in PyTorch☆17Updated 2 years ago
- ☆91Updated last year
- Parallel Associative Scan for Language Models☆18Updated 2 years ago
- ☆24Updated last year
- HGRN2: Gated Linear RNNs with State Expansion☆56Updated last year
- A repository for research on medium sized language models.☆77Updated last year
- Reference implementation of "Softmax Attention with Constant Cost per Token" (Heinsen, 2024)☆24Updated last year
- Memory Mosaics are networks of associative memories working in concert to achieve a prediction task.☆57Updated last year
- Using FlexAttention to compute attention with different masking patterns☆47Updated last year