The Communication Bottleneck: A Round-Trip Study of Tree-Structured Expression Serialization in Language Models

Apple ML Research··

When language models reason in chain-of-thought or exchange free-text intermediates, they serialize structured information into natural language. How much tree-structured compositional content survives this bottleneck? We propose a round-trip protocol that answers this question empirically for tree-structured expressions. A generator converts a procedurally generated arithmetic expression into a word problem, a separate extractor recovers the expression from the word problem alone, and symbolic ...

Read full article →

Related Articles

OpenAI’s o1 correctly diagnosed 67% of ER patients vs. 50-55% by triage doctors
donsupreme · Hacker News · 4mo ago
Accelerating Gemma 4: faster inference with multi-token prediction drafters
amrrs · Hacker News · 4mo ago
A couple million lines of Haskell: Production engineering at Mercury
unignorant · Hacker News · 4mo ago
Using “underdrawings” for accurate text and numbers
samcollins · Hacker News · 5mo ago
ProgramBench: Can language models rebuild programs from scratch?
jonbaer · Hacker News · 4mo ago