Beyond Query Memorization: Large Language Model Routing with Query Decomposition and Historical Matching (2026.acl-long)
Copied to clipboard
Bo Lv, Jingbo Sun, Jianwei Lv, Chen Tang, Shaojie Zhang, Nayu Liu, Guoxin Yu, Zihao Li, Qichao Zhang, Dongbin Zhao, Ping Luo, Yue Yu
| Challenge: | Existing routing methods rely on direct mapping from queries to models based on surface-level features, leading to poor generalizability on out-of-distribution data. |
| Approach: | They propose a new routing framework that recasts the routing task as a matching process of sifting similar queries from historical logs. |
| Outcome: | The proposed framework improves matching accuracy while lowering inference costs . it decouples linguistic surface forms from task-intrinsic requirements . |
Similar Papers
StitchLLM: Serving LLMs, One Block at a Time (2025.acl-long)
Copied to clipboard
Bodun Hu, Shuozhe Li, Saurabh Agarwal, Myungjin Lee, Akshay Jajoo, Jiamin Li, Le Xu, Geon-Woo Kim, Donghyun Kim, Hong Xu, Amy Zhang, Aditya Akella
| Challenge: | Existing techniques like distillation and pruning are not efficient for large language models. |
| Approach: | They propose a dynamic model routing framework that uses a powerful bottom model to process all queries and a lightweight routing mechanism to allocate computational resources appropriately. |
| Outcome: | The proposed framework improves system throughput while minimizing performance degradation. |
Enabling LLM Knowledge Analysis via Extensive Materialization (2025.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) have majorly advanced NLP and AI, and a major success factor is their internalized factual knowledge. |
| Approach: | They propose a method to comprehensively materialize an LLM’s factual knowledge through recursive querying and result consolidation. |
| Outcome: | The proposed method provides constructive insights into the scope and structure of LLM knowledge (or beliefs) it provides scale, accuracy, bias, cutoff and consistency at the same time. |
InferenceDynamics: Adaptive LLM Routing through Structured Capability and Knowledge Profiling (2026.acl-long)
Copied to clipboard
Haochen Shi, Tianshi Zheng, Weiqi Wang, Baixuan Xu, Chunyang Li, Chunkit Chan, Tao Fan, Yangqiu Song
| Challenge: | Large Language Model (LLM) routing is a pivotal technique for navigating a diverse landscape of LLMs. |
| Approach: | They propose a flexible and scalable multi-dimensional routing framework that models the capability and knowledge of models. |
| Outcome: | The proposed framework can be used to generalize and identify top-performing models for group-level routing using modern benchmarks including MMLU-Pro, GPQA, BigGenBench, and LiveBench. |
Generalising LLM Routing using Past Performance Retrieval: A Few-Shot Router is Sufficient (2026.eacl-srw)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) use a single LLM to perform tasks. |
| Approach: | They propose a meta-evaluation framework that predicts per-model performance for new queries by retrieving similar past queries and reweighting model scores with lightweight attention. |
| Outcome: | The proposed framework matches the quality–cost trade-offs of generalisable routers across five routing benchmarks. |
Rethinking Pruning Large Language Models: Benefits and Pitfalls of Reconstruction Error Minimization (2024.emnlp-main)
Copied to clipboard
| Challenge: | minimizing reconstruction error is not always ideal and can overfit calibration data. |
| Approach: | They propose a method to prune large language models by divide and conquer . they propose minimizing reconstruction error by more than 90% by using calibration data . |
| Outcome: | The proposed pruning approach generates high reconstruction errors . the proposed technique reduces reconstruction error by more than 90% . |
MixLLM: Dynamic Routing in Mixed Large Language Models (2025.naacl-long)
Copied to clipboard
Xinyuan Wang, Yanchi Liu, Wei Cheng, Xujiang Zhao, Zhengzhang Chen, Wenchao Yu, Yanjie Fu, Haifeng Chen
| Challenge: | Large Language Models (LLMs) exhibit potential artificial generic intelligence, however, their usage is costly with high response latency. |
| Approach: | They develop a dynamic contextual-bandit-based routing system for query-LLM assignment that leverages query tags to enhance query embeddings. |
| Outcome: | The proposed model maximizes response quality and minimizes cost and latency. |
Disentangling Memory and Reasoning Ability in Large Language Models (2025.acl-long)
Copied to clipboard
Mingyu Jin, Weidi Luo, Sitao Cheng, Xinyi Wang, Wenyue Hua, Ruixiang Tang, William Yang Wang, Yongfeng Zhang
| Challenge: | Existing LLMs operate as an opaque process without explicit separation between knowledge retrieval and reasoning steps, making the decision-making process unclear and disorganized. |
| Approach: | They propose a language model inference paradigm that decomposes the complex inference process into two distinct and clear actions: (1) memory recall: which retrieves relevant knowledge, and (2) reasoning: which performs reasoning steps based on the recalled knowledge. |
| Outcome: | The proposed paradigm decomposes the inference process into two distinct and clear actions, memory and reason, guiding the model to distinguish between steps that require knowledge retrieval and those that involve reasoning. |
MemORAI: Memory Organization and Retrieval via Adaptive Graph Intelligence for LLM Conversational Agents (2026.findings-acl)
Copied to clipboard
Hung Pham Van, Nguyen Manh Hieu, Khang Pham Tran Tuan, Nam Le Hai, Linh Ngo Van, Nguyen Thi Ngoc Diep, Trung Le
| Challenge: | Existing graph-based memory systems suffer from information dilution, absent provenance tracking, and uniform retrieval that ignores query context. |
| Approach: | They propose a framework that integrates memory organization and retrieval via a Graph Intelligence framework. |
| Outcome: | Evaluated on LOCOMO and LongMemEval benchmarks, MemORAI achieves state-of-the-art performance in memory retrieval and personalized response generation. |
LLMRouterBench: A Massive Benchmark and Unified Framework for LLM Routing (2026.findings-acl)
Copied to clipboard
Hao Li, Yiqun Zhang, Zhaoyan Guo, Chenxu Wang, Shengji Tang, Qiaosheng Zhang, Yang Chen, Biqing Qi, Peng Ye, Lei Bai, Zhen Wang, Shuyue Hu
| Challenge: | Large language model (LLM) routing assigns each query to the best suitable model from an ensemble. |
| Approach: | They introduce a large-scale benchmark and unified framework for LLM routing . they find that many routing methods exhibit similar performance under unified evaluation . |
| Outcome: | The proposed benchmark provides comprehensive metrics for both performance-oriented and performance-cost trade-off routing. |
Decomposing Complex Queries for Tip-of-the-tongue Retrieval (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Tip-of-the-tongue retrieval is a retrieval setting in which a user is unable to formulate a precise query that identifies a sought item . a framework that decomposes complex queries into subqueries can improve gold book recall . |
| Approach: | They propose a framework for handling tip-of-the-tongue queries by decomposing queries into individual clues routing them to specialized retrievers. |
| Outcome: | The proposed framework improves gold book recall up to 6% on a new query-book pair . it takes advantage of off-the-shelf retrievers or incorporates retriever-specific logic . |