Alternatives and similar repositories for Stochastic-Mixture-of-Experts

Users that are interested in Stochastic-Mixture-of-Experts are comparing it to the libraries listed below

• Hunter-DDM / stablemoe
  Code for the ACL-2022 paper "StableMoE: Stable Routing Strategy for Mixture of Experts"
  ☆47Updated 2 years ago
• VITA-Group / Random-MoE-as-Dropout
  [ICLR 2023] "Sparse MoE as the New Dropout: Scaling Dense and Self-Slimmable Transformers" by Tianlong Chen*, Zhenyu Zhang*, Ajay Jaiswal…
  ☆52Updated 2 years ago
• dguo98 / DiffPruning
  Parameter Efficient Transfer Learning with Diff Pruning
  ☆73Updated 4 years ago
• princeton-nlp / LM-Kernel-FT
  A Kernel-Based View of Language Model Fine-Tuning https://arxiv.org/abs/2210.05643
  ☆75Updated last year
• thunlp / MoEfication
  ☆137Updated 11 months ago
• kssteven418 / LTP
  [KDD'22] Learned Token Pruning for Transformers
  ☆98Updated 2 years ago
• SimiaoZuo / MoEBERT
  This PyTorch package implements MoEBERT: from BERT to Mixture-of-Experts via Importance-Guided Adaptation (NAACL 2022).
  ☆107Updated 3 years ago
• microsoft / SparseMixer
  Sparse Backpropagation for Mixture-of-Expert Training
  ☆29Updated 11 months ago
• VITA-Group / EarlyBERT
  [ACL-IJCNLP 2021] "EarlyBERT: Efficient BERT Training via Early-bird Lottery Tickets" by Xiaohan Chen, Yu Cheng, Shuohang Wang, Zhe Gan, …
  ☆18Updated 3 years ago
• asappresearch / flop
  Pytorch library for factorized L0-based pruning.
  ☆45Updated last year
• swj0419 / in-context-pretraining
  ☆51Updated last year
• HKUNLP / efficient-attention
  [EVA ICLR'23; LARA ICML'22] Efficient attention mechanisms via control variates, random features, and importance sampling
  ☆86Updated 2 years ago
• jzbjyb / ReAtt
  Retrieval as Attention
  ☆82Updated 2 years ago
• huggingface / block_movement_pruning
  Block Sparse movement pruning
  ☆80Updated 4 years ago
• kernelmachine / demix
  DEMix Layers for Modular Language Modeling
  ☆53Updated 3 years ago
• Shark-NLP / CAB
  ☆31Updated last year
• pkunlp-icler / ChildTuning
  ☆32Updated 3 years ago
• sanagno / adaptively_sparse_attention
  ☆21Updated last year
• QingruZhang / PLATON
  This pytorch package implements PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance (ICML 2022).
  ☆46Updated 2 years ago
• KwanWaiChung / M4LE
  Code for M4LE: A Multi-Ability Multi-Range Multi-Task Multi-Domain Long-Context Evaluation Benchmark for Large Language Models
  ☆23Updated 10 months ago
• VITA-Group / BERT-Tickets
  [NeurIPS 2020] "The Lottery Ticket Hypothesis for Pre-trained BERT Networks", Tianlong Chen, Jonathan Frankle, Shiyu Chang, Sijia Liu, Ya…
  ☆140Updated 3 years ago
• AkariAsai / ATTEMPT
  This is the oficial repository for "Parameter-Efficient Multi-task Tuning via Attentional Mixtures of Soft Prompts" (EMNLP 2022)
  ☆102Updated 2 years ago
• BaohaoLiao / mefts
  [NeurIPS 2023] Make Your Pre-trained Model Reversible: From Parameter to Memory Efficient Fine-Tuning
  ☆31Updated 2 years ago
• chijames / KERPLE
  ☆19Updated 2 years ago
• nayeon7lee / FactualityPrompt
  ☆86Updated 2 years ago
• Shwai-He / MEO
  The source code of "Merging Experts into One: Improving Computational Efficiency of Mixture of Experts (EMNLP 2023)":
  ☆39Updated last year
• jxhe / efficient-knnlm
  Pytorch implementation of paper "Efficient Nearest Neighbor Language Models" (EMNLP 2021)
  ☆73Updated 3 years ago
• yxli2123 / LoSparse
  ☆57Updated last year
• rabeehk / hyperformer
  ☆155Updated 3 years ago
• fuzihaofzh / repetition-problem-nlg
  Code for the paper "A Theoretical Analysis of the Repetition Problem in Text Generation" in AAAI 2021.
  ☆54Updated 2 years ago