Alternatives and similar repositories for bert-prune

Users that are interested in bert-prune are comparing it to the libraries listed below

• huggingface / block_movement_pruning
  Block Sparse movement pruning
  ☆81Updated 4 years ago
• IBM / PoWER-BERT
  Method to improve inference time for BERT. This is an implementation of the paper titled "PoWER-BERT: Accelerating BERT Inference via Pro…
  ☆61Updated 2 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
• kssteven418 / LTP
  [KDD'22] Learned Token Pruning for Transformers
  ☆98Updated 2 years ago
• kssteven418 / BigLittleDecoder
  [NeurIPS'23] Speculative Decoding with Big Little Decoder
  ☆93Updated last year
• ChandlerGuan / Transkimmer
  Code for ACL2022 publication Transkimmer: Transformer Learns to Layer-wise Skim
  ☆21Updated 2 years ago
• Hunter-DDM / stablemoe
  Code for the ACL-2022 paper "StableMoE: Stable Routing Strategy for Mixture of Experts"
  ☆47Updated 3 years ago
• microsoft / Stochastic-Mixture-of-Experts
  This package implements THOR: Transformer with Stochastic Experts.
  ☆65Updated 3 years ago
• jxhe / efficient-knnlm
  Pytorch implementation of paper "Efficient Nearest Neighbor Language Models" (EMNLP 2021)
  ☆73Updated 3 years ago
• asappresearch / flop
  Pytorch library for factorized L0-based pruning.
  ☆45Updated last year
• kernelmachine / demix
  DEMix Layers for Modular Language Modeling
  ☆53Updated 3 years ago
• clovaai / length-adaptive-transformer
  Official Pytorch Implementation of Length-Adaptive Transformer (ACL 2021)
  ☆101Updated 4 years ago
• castorini / DeeBERT
  DeeBERT: Dynamic Early Exiting for Accelerating BERT Inference
  ☆157Updated 3 years ago
• dguo98 / DiffPruning
  Parameter Efficient Transfer Learning with Diff Pruning
  ☆74Updated 4 years ago
• JetRunner / PABEE
  Code for the paper "BERT Loses Patience: Fast and Robust Inference with Early Exit".
  ☆65Updated 4 years ago
• SimiaoZuo / MoEBERT
  This PyTorch package implements MoEBERT: from BERT to Mixture-of-Experts via Importance-Guided Adaptation (NAACL 2022).
  ☆108Updated 3 years ago
• rycolab / differentiable-subset-pruning
  ☆15Updated 3 years ago
• thunlp / TR-BERT
  Source code for NAACL 2021 paper "TR-BERT: Dynamic Token Reduction for Accelerating BERT Inference"
  ☆47Updated 3 years ago
• pmichel31415 / are-16-heads-really-better-than-1
  Code for the paper "Are Sixteen Heads Really Better than One?"
  ☆172Updated 5 years ago
• anadim / the-little-retrieval-test
  ☆34Updated 2 years ago
• sai-prasanna / bert-experiments
  ☆19Updated 4 years ago
• princeton-nlp / CoFiPruning
  [ACL 2022] Structured Pruning Learns Compact and Accurate Models https://arxiv.org/abs/2204.00408
  ☆196Updated 2 years ago
• castorini / berxit
  ☆22Updated 4 years ago
• princeton-pli / PruLong
  Code for the preprint "Cache Me If You Can: How Many KVs Do You Need for Effective Long-Context LMs?"
  ☆41Updated last week
• benzakenelad / BitFit
  Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-models
  ☆142Updated 2 years ago
• princeton-nlp / LM-Kernel-FT
  A Kernel-Based View of Language Model Fine-Tuning https://arxiv.org/abs/2210.05643
  ☆78Updated last year
• AkariAsai / evidentiality_qa
  The official implemetation of "Evidentiality-guided Generation for Knowledge-Intensive NLP Tasks" (NAACL 2022).
  ☆44Updated 2 years ago
• twinkle0331 / Xcompression
  [ICLR 2022] Code for paper "Exploring Extreme Parameter Compression for Pre-trained Language Models"(https://arxiv.org/abs/2205.10036)
  ☆22Updated 2 years ago
• LorrinWWW / SkipBERT
  Code associated with the paper **SkipBERT: Efficient Inference with Shallow Layer Skipping**, at ACL 2022
  ☆16Updated 3 years ago
• ekinakyurek / influence
  Code for "Tracing Knowledge in Language Models Back to the Training Data"
  ☆38Updated 2 years ago