Pith. sign in

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

arxiv 2405.05417 v2 pith:BLXYOMCW submitted 2024-05-08 cs.CL

classification cs.CL
keywords tokensmodelmodelslanguagedetectingtokenizeracrossanalysis
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bit-level BPE: Below the byte boundary

    cs.CL 2025-06 conditional novelty 6.0 of 10

    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.

  2. Train It and Forget It: Merge Lists are Unnecessary for BPE Inference in Language Models

    cs.CL 2025-08 unverdicted novelty 5.0 of 10

    Non-targeted merge-list-free BPE inference causes minimal downstream performance loss, unlike targeted merge-list corruption.

Pith tools