Paper recorded by Signals 4 on 2026-09-16 in cs.AI. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-16 on arXiv · recorded by Signals 4 on 2026-09-17
Category: cs.AI · 人工智能 · first seen 2026-09-17
Two dominant tokenisation algorithms are used by modern language models: byte-pair encoding (BPE) and UnigramLM. These differ along two orthogonal axes: their optimisation objective (compression vs. log-likelihood) and their search procedure (bottom-up merging vs. top-down pruning). Existing comparisons confound these axes, making it unclear whether their observed differences stem from what is bei