Reproduce “Computed Permutation Trellis Coding: Near-Optimal Quantization from Two Multiplications and a 64-Byte Table” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Muhammed Fatih Balın
CPTC jointly encodes neighboring weights, so decoded values depend on shared code bits. Its decoder uses two 16-bit multiplications and a 64-byte table matched to the nonuniform index distribution. For four-bit Gaussian quantization, it reaches 3.93 effective bits. Separately, on Llama 3.1 8B Instruct without fine-tuning, its codebook lowers KL divergence versus QTIP HYB; this does not establish general accuracy gains.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.