mlsanityData to 14 Oct 2026

Semantic Compression of LLM Instructions via Symbolic Metalanguages

arXiv 2601.07354 ↗First posted 12 Jan 2026cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

We introduce MetaGlyph, a symbolic language for compressing prompts by encoding instructions as mathematical symbols rather than prose. Unlike systems requiring explicit decoding rules, MetaGlyph uses symbols like ∈ (membership) and Rightarrow (implication) that models already understand from their training data. We test whether these symbols work as ''instruction shortcuts'' that models can interpret without additional teaching. We evaluate eight models across two dimensions relevant to practitioners: scale (3B-1T parameters) and accessibility (open-source for local deployment vs. proprietary APIs). MetaGlyph achieves 62-81% token reduction across all task types. For API-based deployments, this translates directly to cost savings; for local deployments, it reduces latency and memory pressure. Results vary by model. Gemini 2.5 Flash achieves 75% semantic equivalence between symbolic and prose instructions on selection tasks, with 49.9% membership operator fidelity. Kimi K2 reaches 98.1% fidelity for implication (Rightarrow) and achieves perfect (100%) accuracy on selection tasks with symbolic prompts. GPT-5.2 Chat shows the highest membership fidelity observed (91.3%), though with variable parse success across task types. Claude Haiku 4.5 achieves 100% parse success with 26% membership fidelity. Among mid-sized models, Qwen 2.5 7B shows 62% equivalence on extraction tasks. Mid-sized open-source models (7B-12B) show near-zero operator fidelity, suggesting a U-shaped relationship where sufficient scale overcomes instruction-tuning biases.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 6 references that are in the map. First posted on arXiv 12 Jan 2026.

Builds on

3 of 6 references.

References · 3

  1. 2023LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Modelscited by 287
  2. 2023Symbol tuning improves in-context learning in language modelscited by 75
  3. 2024Jailbreaking Large Language Models with Symbolic Mathematicscited by 16

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Prompt Compression via Activation Aggregation
  2. 2023Discrete Prompt Compression with Reinforcement Learning
  3. 2026Prompt Minimization: Reducing Input Redundancy Without Sacrificing Output Fidelity
  4. 2025Understanding and Improving Information Preservation in Prompt Compression for LLMs
  5. 2025Task-Related Token Compression in Multimodal Large Language Models from an Explainability Perspective
  6. 2025How Well do LLMs Compress Their Own Chain-of-Thought? A Token Complexity Approach
  7. 2025Tokenization Constraints in LLMs: A Study of Symbolic and Arithmetic Reasoning Limits
  8. 2024Investigating Symbolic Capabilities of Large Language Models