REVIEW 2 cited by
Fishing for Magikarp: Automatically Detecting Under-trained Tokens in Large Language Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The disconnect between tokenizer creation and model training in language models allows for specific inputs, such as the infamous SolidGoldMagikarp token, to induce unwanted model behaviour. Although such `glitch tokens', tokens present in the tokenizer vocabulary but that are nearly or entirely absent during model training, have been observed across various models, a reliable method to identify and address them has been missing. We present a comprehensive analysis of Large Language Model tokenizers, specifically targeting this issue of detecting under-trained tokens. Through a combination of tokenizer analysis, model weight-based indicators, and prompting techniques, we develop novel and effective methods for automatically detecting these problematic tokens. Our findings demonstrate the prevalence of such tokens across a diverse set of models and provide insights into improving the efficiency and safety of language models.
Forward citations
Cited by 2 Pith papers
-
Bit-level BPE: Below the byte boundary
Re-encoding UTF-8 byte fallbacks as shared 6-bit prefixes plus 9-bit tokens shortens CJK token sequences losslessly, at the cost of reduced tokenizer entropy and mixed wall-clock speedups.
-
Train It and Forget It: Merge Lists are Unnecessary for BPE Inference in Language Models
Non-targeted merge-list-free BPE inference causes minimal downstream performance loss, unlike targeted merge-list corruption.
Discussion (0). Continue with ORCID to comment.