When an AI plans the big ideas first, how much is left for the individual words to decide?
How does hierarchical routing in the concept module influence token-level generation?
This explores how a higher-level 'concept' layer that decides where and how computation is directed ends up shaping the individual tokens a model writes. I'm reading it broadly, because the corpus has no note on a single 'concept module with hierarchical routing'.
This explores how a higher-level 'concept' layer that decides where and how computation is directed ends up shaping the individual tokens a model writes. The corpus has no note on a specific 'concept module with hierarchical routing', so I can't describe that mechanism directly. Four neighbouring ideas cover the same territory, and they suggest a consistent answer: the higher level fixes what gets said, and the token level fills it in.
The closest match is Meta's Large Concept Model. It plans and reasons over sentence embeddings in a language-agnostic space, with paragraph-level planning above that, and only then decodes into words. The concept level is the top of a hierarchy, and token generation is the last, most constrained step. Here the influence is direct: by the time tokens are chosen, the content has already been decided. The note credits this hierarchy with more coherent output than flat token-by-token generation (Can reasoning happen at the sentence level instead of tokens?).
A second version of the influence keeps the concept inside the token stream. Soft Thinking replaces the hard choice of one next token with a probability-weighted 'concept token', so several reasoning paths stay alive at once. The model doesn't commit early, and it can stop early when the distribution sharpens, which cut tokens by 22.4% while slightly improving accuracy (Can we explore multiple reasoning paths without committing to one token?). The Byte Latent Transformer routes compute in a similar way. It uses next-byte entropy to decide how large each patch is, spending more compute where the text is unpredictable and less where it is easy (Can byte-level models match tokenized performance with better efficiency?). In both cases uncertainty decides how much work each generation step gets.
Routing in the usual LLM sense works one level higher still. Routers pick a model before any token exists, by estimating how hard the query is, and they claim 40-50% cost savings (Can routers select the right model before generation happens?). The LLMRouter framework describes this as a sequential decision process built from five component types, which also covers multi-turn and personalized routing (Can five components unify all LLM routing approaches?). Routing therefore influences token generation by choosing which model's distribution the tokens come from.
Two other notes explain why the influence runs mostly from the top down. Only about 20% of tokens are high-entropy forking points, and training on just those matches full-gradient RLVR (Do high-entropy tokens drive reasoning model improvements?). Evidence from faithfulness tests and layer analysis also suggests reasoning mostly happens in hidden-state trajectories, and the visible text is only a partial interface to it (Where does LLM reasoning actually happen during generation?). Together they suggest most tokens are predictable consequences of a decision made earlier, and a few tokens are where that decision becomes visible. A hierarchical concept-and-routing design would matter mainly at those few forks. None of these notes tests a full concept-plus-router architecture, so how the pieces combine is still an open question.
Sources 7 notes
Meta's Large Concept Model operates on sentence embeddings rather than tokens, reasoning in a language-agnostic space before decoding to any target language. This hierarchical approach with paragraph-level planning produces more coherent output than flat token generation.
Training-free method replaces discrete token selection with probability-weighted concept embeddings, preserving superposition of reasoning paths. Improves accuracy up to 2.48 points while reducing tokens 22.4% via entropy-based early stopping.
The Byte Latent Transformer (BLT) dynamically segments bytes into patches based on next-byte entropy, allocating more compute to high-entropy regions and less to predictable ones. At 8B parameters, BLT matches tokenized baselines while reducing inference cost and improving robustness to typos and cross-lingual transfer.
RouteLLM and Hybrid-LLM both achieve 40-50% cost reduction by routing to a single model based on query difficulty prediction, not response evaluation. Single-model routing minimizes latency compared to ensemble or cascade alternatives.
The LLMRouter framework casts routing as a sequential decision process with five component types, enabling fair comparison of diverse routers and unifying single-turn, multi-turn, and personalized routing as instances of a common design space.
Show all 7 sources
Only ~20% of tokens exhibit high entropy as pivotal reasoning decision points; RLVR primarily adjusts these forking tokens. Training exclusively on them matches or exceeds full-gradient performance, revealing that the minority carries the learning signal.
Evidence from CoT faithfulness tests, feature steering, and layer analysis suggests latent-state dynamics drive reasoning, while surface chain-of-thought serves as a partial interface. Hidden reasoning processes should be the default focus of study.
Papers this line draws on 8
The research behind the notes this line reads — ranked by how closely each paper relates.
- Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoning
- Soft Thinking: Unlocking the Reasoning Potential of LLMs in Continuous Concept Space
- Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing
- DeepSeek-R1 Thoughtology: Let's think about LLM Reasoning
- RouteLLM: Learning to Route LLMs with Preference Data
- LLMRouter: Unified Infrastructure for Developing, Evaluating, and Deploying LLM Routers
- When is Routing Meaningful? Diversity and Robustness in Language Model Societies
- MasRouter: Learning to Route LLMs for Multi-Agent Systems