Metraipolis › archive › dc_afdf0fa6e56c

Greedy Byte-Pair Encoding Achieves at Least 0.361 of the Optimal Compression — arXiv:2611.08671

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08671
License (as archived)
CC0-1.0
Archived
2026-11-09T22:36:06.817Z
SHA-256 of the archived text
36ce918364faa06140b7eba5c38da28b68afa00a766798cf393466f60472adb3
Stable URL of this page
https://metraipolis.com/documento/dc_afdf0fa6e56c

How to cite

Greedy Byte-Pair Encoding Achieves at Least 0.361 of the Optimal Compression — arXiv:2611.08671 — arXiv (en), https://arxiv.org/abs/2611.08671 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_afdf0fa6e56c (Metraipolis archive dc_afdf0fa6e56c, sha256 36ce918364faa06140b7eba5c38da28b68afa00a766798cf393466f60472adb3)
BibTeX
@misc{dcafdf0fa6e56c,
  title = {Greedy Byte-Pair Encoding Achieves at Least 0.361 of the Optimal Compression — arXiv:2611.08671},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08671},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_afdf0fa6e56c; sha256 36ce918364faa06140b7eba5c38da28b68afa00a766798cf393466f60472adb3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08671. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Byte-Pair Encoding (BPE) builds a tokeniser by repeatedly merging a most frequent adjacent pair of symbols; its utility is the total reduction in string length achieved by $k$ merges. It was known that this greedy rule achieves at least a third of the optimal reduction. We prove that it always achieves at least 0.361 of the optimal reduction in string length, for every string, every budget and every tie-breaking rule; this is the first improvement of the bound one third. We also explain why one third was a barrier: the pair-packing relaxation behind it is tight, so a better bound must use more of the optimum's structure. When greedy destroys three of the optimum's merge points at once, one of them can usually be moved next door, because all copies of a rule of the optimum look alike; the remaining cases are paid for later. Along the way we determine the worst-case ratio for two merges exactly, bound it for three, and isolate a single inequality that would settle the problem.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.CL, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computation and Language (cs.CL).
Pagina del lavoro: https://arxiv.org/abs/2611.08671 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:31:01.955Z dalla pagina https://arxiv.org/list/cs.CL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).