Exploring Collaboration between a language and a non-language agent
Harini S I, Somesh Singh, Yaman K Singla, Rajiv Ratn Shah, David Doermann, Balaji Krishnamurthy
Adobe Media and Data Science Research · IIIT-Delhi · IIT Kanpur · SUNY at Buffalo
Published September 2, 2026 · on the feed September 3, 2026 · ▲ 5 · arXiv 2609.00474
The abstract
LLMs are increasingly deployed as orchestrators that coordinate specialized subagents to solve complex tasks through natural language. However, in many important domains like game playing and robotics, the strongest available agents are not language models. Integrating non-language agents with LLMs would require verbalization: compressing their rich continuous representations into sparse textual summaries at each interaction step. To study whether verbalization constitutes a bottleneck, we introduce LLAMIA-Bench, a suite of six diverse collaborative chess tasks spanning three facets: behavioral imitation, state assessment, and natural-language explanation. Each task instantiates a well-established chess problem that neither the LLM nor the chess engine can solve alone. To solve LLM collaboration with non-language agents, we introduce latent state internalization, which projects the subagent's continuous representations directly into the LLM's token stream as learned state tokens, with dynamic re-encoding as actions advance the environment state. Comparing internalization to verbalized integration, our experiments reveal a consistent verbalization debt: the performance gap widens throughout training and persists as the LLM scales from 4B to 14B parameters. A single 14B model, LLAMIA, trained with latent state internalization, matches or exceeds task specialists and frontier models including GPT-5.1 with tool access across all benchmark tasks, and generalizes out-of-distribution where task-specific finetunes collapse
The Brief
2:37A short podcast summary of the paper. Written and voiced by AI.
Transcript
Exploring Collaboration between a language and a non-language agent. By Harini S I and five others, from Adobe Media and Data Science Research, the Indraprastha Institute of Information Technology Delhi, and two other institutions. Published on the second of September. No code repository is linked to it.
Language models are increasingly deployed as orchestrators, coordinating specialized subagents through natural language to solve complex tasks. But in many important domains, game playing and robotics among them, the strongest available agents are not language models at all. Bringing such an agent into the conversation would require verbalization. Its rich, continuous representations would have to be compressed into sparse textual summaries at every step of the interaction. The question is whether that compression is a bottleneck.
Two contributions address it. The first is a testbed, LLAMIA-Bench: six diverse collaborative chess tasks spanning three facets, namely behavioral imitation, state assessment, and explanation in natural language. Each task instantiates a well-established chess problem that neither the language model nor the chess engine can solve alone. The second is an alternative to verbalization, called latent state internalization. Instead of describing the subagent's state in words, it projects the subagent's continuous representations directly into the language model's token stream, as learned state tokens.
Those state tokens are not computed once and left alone. As actions advance the environment, the state is dynamically re-encoded, so the tokens the language model sees keep pace with the position on the board. The comparison at the heart of the study is then direct: the same collaboration, with the engine's state either internalized as tokens or verbalized as text.
The experiments find a consistent verbalization debt. Internalization outperforms verbalized integration, and the gap widens over the course of training. It also persists as the language model grows from four billion to fourteen billion parameters, so scale does not close it.
A single model of fourteen billion parameters, LLAMIA, trained with latent state internalization, matches or exceeds task specialists across every task in the benchmark. It does the same against frontier models, including GPT five point one with tool access. And it generalizes out of distribution, in settings where finetunes built for a specific task collapse.
Talking has a cost, and here it is measured. Asking a chess engine to explain itself in sentences squeezes a rich internal state into a sparse summary, and the resulting gap does not shrink with more training or a bigger model. Letting the language model read the engine's state directly, as tokens of its own, avoids paying that debt in the first place.
Paper Quest · 7 chapters · about 40 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
Every quest starts with a wall. Here it is a chess engine that can't speak.
You use a language model to coordinate specialist helpers. In chess, the strongest helper is an engine, not a language model: its knowledge lives in continuous internal activations.
The road ahead
- 1 · The problem ~7 min When the best chess helper is an engine, not a language model, its knowledge must be squeezed into short text, and that text loses a lot.
- 2 · What came before ~3 min
- 3 · The key idea ~8 min Don't rely on words alone: also project the engine's internal activations into the language model's input as learned state tokens, refreshed when a new position is queried.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Read the engine's activations, project them into state tokens, put them in the language model's stream, and re-encode when a new position is queried.
- 6 · The experiment ~6 min You’ll guess: As the language model grew from 4B to 14B parameters, what happened to the performance gap between internalized and verbalized integration?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.