Paper recorded by Signals 4 on 2026-11-01 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-11-01 on arXiv · recorded by Signals 4 on 2026-11-03
Category: cs.LG · 机器学习 · first seen 2026-11-03
Lempel-Ziv Plurality (LZP) is an algorithm of Kosoy that predicts the next symbol of a string by using its Lempel-Ziv factorization, and makes at most $O(z\log n)$ mistakes on every string of length $n$ with $z$ LZ77 phrases. We give efficient online implementations of LZP and of a new variant of it. Our first implementation maintains a run-length encoded Burrows-Wheeler transform (RLBWT) of the r