The paper introduces EDRM, an entropy‑dynamics‑based routing framework that decides whether to use direct, standard, or chain‑of‑thought decoding for large language models. By analyzing early decoding entropy, EDRM identifies tasks that benefit from explicit reasoning and routes queries accordingly, achieving 16–55% token savings while maintaining accuracy across 15 benchmarks and 7 LLMs. The study also shows that a short direct fallback branch can further improve accuracy by up to 4.9 percentage points compared to routing alone.
arXiv:2605. 22873v2 Announce Type: replace-cross Abstract: Chain-of-thought (CoT) reasoning has become the default strategy for enhancing LLM capabilities, yet its application raises a fundamental question: when is explicit reasoning actually beneficial?
The paper introduces SCX Router, a lightweight GLiClass-based model selector that assigns suitability scores to inference-time language models without autoregressive generation. It uses a 0.6B-parameter Qwen3 decoder with a shallow bidirectional scorer, preserving a text-only key–value cache across sessions and predicting task attributes such as type, difficulty, and expected output length. The authors build a comprehensive task ontology with 23 families, 115 types, and 1,173 synthetic examples, generating 150,000 verifier-scored tasks to train the router, which outperforms baseline models on LiveBench subsets with a top‑1 score of 0.707 versus 0.696 for the strongest fixed model.
arXiv:2602. 09924v4 Announce Type: replace-cross Abstract: Running LLMs with extended reasoning on every problem is expensive, but determining which inputs actually require additional compute remains challenging.
arXiv:2610.19705v1 Announce Type: new Abstract: LLM routing dynamically selects and coordinates heterogeneous language models across diverse tasks. However, existing approaches are largely built arou...
arXiv:2603.04445v3 Announce Type: replace-cross Abstract: The rapid growth of large language models (LLMs) with diverse capabilities, costs, and domains has created a critical need for intelligent mo...
arXiv:2608.28771v1 Announce Type: new Abstract: Large reasoning models achieve strong performance on complex tasks by generating extended chain-of-thought (CoT) traces via reinforcement learning with...
arXiv:2609.23085v1 Announce Type: cross Abstract: Large language models (LLMs) and agentic AI systems are creating rapidly growing inference energy demands as model sizes grow and reasoning trajector...
arXiv:2609.37362v1 Announce Type: new Abstract: Large language model (LLM) routing aims to assign each query to the most suitable model from a heterogeneous candidate pool, improving the quality--eff...
arXiv:2609.35831v1 Announce Type: new Abstract: Modern large language models now support context windows of more than one million tokens, which has raised the question of whether retrieval-augmented...
The paper introduces Root-token Policy Optimization (RPO), a framework that lets large reasoning models decide when to engage in explicit reasoning by training only the initial root token. RPO uses group-relative rewards and advantages to focus on this branching point, dramatically cutting training overhead and VRAM usage. Experiments across various model families show that RPO achieves difficulty-aware adaptive thinking with roughly 2% of the compute required by previous adaptive-reasoning methods.
arXiv:2606. 06098v1 Announce Type: cross Abstract: Foundational Large Language Models (LLMs) demonstrate proficiency on a wide range of general tasks, and achieve remarkable results on various specialized tasks via domain-expert LLMs.
Route-and-Generate (Rouge) is a hierarchical training framework that lets large language models decide how much reasoning to apply to each input. It separates reasoning effort from answer generation by using a routing policy that distributes a fixed sampling budget across different reasoning formats, while the base model is trained with GRPO and per-sample rewards. The method employs a rank‑based reward favoring shorter correct solutions and updates the router through a closed‑form KL‑regularized policy improvement, leading to more concise answers on easy tasks and longer reasoning on harder ones, thereby improving accuracy‑efficiency trade‑offs on multiple reasoning benchmarks.