Alternatives and similar repositories for DuoDecoding

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

• NJUNLP / MCSD
  Multi-Candidate Speculative Decoding
  ☆35Updated last year
• thunlp / FR-Spec
  [ACL 2025 main] FR-Spec: Frequency-Ranked Speculative Sampling
  ☆34Updated this week
• mutonix / pyramidinfer
  ☆42Updated 7 months ago
• FFY0 / AdaKV
  The Official Implementation of Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inference
  ☆79Updated 5 months ago
• OpenMOSS / Thus-Spake-Long-Context-LLM
  a survey of long-context LLMs from four perspectives, architecture, infrastructure, training, and evaluation
  ☆50Updated 2 months ago
• smart-lty / ParallelSpeculativeDecoding
  [ICLR 2025] PEARL: Parallel Speculative Decoding with Adaptive Draft Length
  ☆90Updated 2 months ago
• ruipeterpan / specreason
  PoC for "SpecReason: Fast and Accurate Inference-Time Compute via Speculative Reasoning" [arXiv '25]
  ☆39Updated last month
• antgroup / cakekv
  ☆18Updated 3 months ago
• hemingkx / SWIFT
  [ICLR 2025] SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration
  ☆51Updated 4 months ago
• horseee / CoT-Valve
  CoT-Valve: Length-Compressible Chain-of-Thought Tuning
  ☆73Updated 4 months ago
• Zanette-Labs / SpeculativeRejection
  [NeurIPS 2024] Fast Best-of-N Decoding via Speculative Rejection
  ☆45Updated 7 months ago
• zyxxmu / cam
  Pytorch implementation of our paper accepted by ICML 2024 -- CaM: Cache Merging for Memory-efficient LLMs Inference
  ☆39Updated last year
• UNITES-Lab / MC-SMoE
  [ICLR 2024 Spotlight] Code for the paper "Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy"
  ☆85Updated last week
• OpenSparseLLMs / Linear-MoE
  ☆104Updated 3 weeks ago
• Jikai0Wang / OPT-Tree
  ☆23Updated last month
• yangyifei729 / KVSharer
  Source code of paper ''KVSharer: Efficient Inference via Layer-Wise Dissimilar KV Cache Sharing''
  ☆26Updated 8 months ago
• ZhenweiAn / Dynamic_MoE
  Inference Code for Paper "Harder Tasks Need More Experts: Dynamic Routing in MoE Models"
  ☆52Updated 10 months ago
• dilab-zju / self-speculative-decoding
  Code associated with the paper **Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding**
  ☆194Updated 4 months ago
• Blueyee / Efficient-CoT-LRMs
  Chain of Thoughts (CoT) is so hot! so long! We need short reasoning process!
  ☆54Updated 2 months ago
• hyx1999 / SAM-Decoding
  Official Implementation of SAM-Decoding: Speculative Decoding via Suffix Automaton
  ☆28Updated 4 months ago
• hemingkx / TokenSkip
  TokenSkip: Controllable Chain-of-Thought Compression in LLMs
  ☆156Updated 3 months ago
• henryzhongsc / longctx_bench
  Official implementation for Yuan & Liu & Zhong et al., KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark o…
  ☆79Updated 4 months ago
• Zanette-Labs / efficient-reasoning
  ☆65Updated 2 months ago
• HarryWu99 / llm_kvcache_sparsity
  Implement some method of LLM KV Cache Sparsity
  ☆32Updated last year
• namespace-Pt / UltraGist
  ☆18Updated 6 months ago
• hahahawu / Long-to-Short-via-Model-Merging
  Model merging is a highly efficient approach for long-to-short reasoning.
  ☆65Updated 3 weeks ago
• MingyuJ666 / Rope_with_LLM
  [ICML'25] Our study systematically investigates massive values in LLMs' attention mechanisms. First, we observe massive values are concen…
  ☆73Updated last week
• BaiTheBest / SparseLLM
  Official Repo for SparseLLM: Global Pruning of LLMs (NeurIPS 2024)
  ☆62Updated 3 months ago
• wangqinsi1 / CoreInfer
  This is the official Python version of CoreInfer: Accelerating Large Language Model Inference with Semantics-Inspired Adaptive Sparse Act…
  ☆16Updated 8 months ago
• zwxandy / Awesome-Efficient-CoT-Reasoning-Summary
  🔥 How to efficiently and effectively compress the CoTs or directly generate concise CoTs during inference while maintaining the reasonin…
  ☆49Updated last month