Alternatives and similar repositories for LTP:

Users that are interested in LTP are comparing it to the libraries listed below

• microsoft / Stochastic-Mixture-of-Experts
  This package implements THOR: Transformer with Stochastic Experts.
  ☆62Updated 3 years ago
• huggingface / block_movement_pruning
  Block Sparse movement pruning
  ☆78Updated 4 years ago
• han-shi / SparseBERT
  ☆13Updated 2 years ago
• princeton-nlp / CoFiPruning
  [ACL 2022] Structured Pruning Learns Compact and Accurate Models https://arxiv.org/abs/2204.00408
  ☆192Updated last year
• teelinsan / parallel-decoding
  Repository of the paper "Accelerating Transformer Inference for Translation via Parallel Decoding"
  ☆114Updated 11 months ago
• QingruZhang / PLATON
  This pytorch package implements PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance (ICML 2022).
  ☆43Updated 2 years ago
• ruikangliu / IntactKV
  Official PyTorch implementation of IntactKV: Improving Large Language Model Quantization by Keeping Pivot Tokens Intact
  ☆39Updated 8 months ago
• kssteven418 / BigLittleDecoder
  [NeurIPS'23] Speculative Decoding with Big Little Decoder
  ☆88Updated last year
• SimiaoZuo / MoEBERT
  This PyTorch package implements MoEBERT: from BERT to Mixture-of-Experts via Importance-Guided Adaptation (NAACL 2022).
  ☆100Updated 2 years ago
• sanagno / adaptively_sparse_attention
  ☆19Updated last year
• 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…
  ☆48Updated last year
• ChandlerGuan / Transkimmer
  Code for ACL2022 publication Transkimmer: Transformer Learns to Layer-wise Skim
  ☆21Updated 2 years ago
• HKUNLP / efficient-attention
  [EVA ICLR'23; LARA ICML'22] Efficient attention mechanisms via control variates, random features, and importance sampling
  ☆80Updated last year
• WoosukKwon / retraining-free-pruning
  [NeurIPS 2022] A Fast Post-Training Pruning Framework for Transformers
  ☆181Updated last year
• rycolab / differentiable-subset-pruning
  ☆15Updated 3 years ago
• hdong920 / LESS
  ☆49Updated 9 months ago
• dilab-zju / self-speculative-decoding
  Code associated with the paper **Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding**
  ☆157Updated this week
• berlino / gated_linear_attention
  ☆99Updated 11 months ago
• dguo98 / DiffPruning
  Parameter Efficient Transfer Learning with Diff Pruning
  ☆73Updated 4 years ago
• raymin0223 / fast_robust_early_exit
  Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decoding (EMNLP 2023 Long)
  ☆56Updated 4 months ago
• CASIA-IVA-Lab / FLAP
  [AAAI 2024] Fluctuation-based Adaptive Structured Pruning for Large Language Models
  ☆43Updated last year
• mitchellgordon95 / bert-prune
  ☆17Updated 4 years ago
• yxli2123 / LoSparse
  ☆49Updated last year
• htqin / BiBERT
  This project is the official implementation of our accepted ICLR 2022 paper BiBERT: Accurate Fully Binarized BERT.
  ☆85Updated last year
• wimh966 / outlier_suppression
  The official PyTorch implementation of the NeurIPS2022 (spotlight) paper, Outlier Suppression: Pushing the Limit of Low-bit Transformer L…
  ☆48Updated 2 years ago
• thunlp / TR-BERT
  Source code for NAACL 2021 paper "TR-BERT: Dynamic Token Reduction for Accelerating BERT Inference"
  ☆44Updated 2 years ago
• txsun1997 / awesome-early-exiting
  A curated list of Early Exiting papers, benchmarks, and misc.
  ☆104Updated last year
• 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…
  ☆59Updated last year
• TobiasLee / Awesome-Efficient-PLM
  Must-read papers on improving efficiency for pre-trained language models.
  ☆102Updated 2 years ago
• Hunter-DDM / stablemoe
  Code for the ACL-2022 paper "StableMoE: Stable Routing Strategy for Mixture of Experts"
  ☆44Updated 2 years ago