Skip to content

Learning to Ask: Information Acquisition for SLM-LLM Collaboration, under a budget

Oct 2026 · 0 citations
Computer Science

TL;DR

This work forms SLM-LLM collaboration as an information acquisition problem, under an API budget constraint, and develops a three-stage RLVR framework that learns whether to call the advisor, how to formulate useful queries, and how to integrate the collaboration into the reasoning process by jointly refining advisor invocation and information use.

Abstract

Collaboration between a small language model (SLM) and a large language model (LLM) offers an opportunity to combine the efficiency of smaller models with the strong reasoning capabilities of larger ones. Existing approaches primarily frame such collaboration as a computation allocation problem, determining which model should handle each portion of the reasoning process. In black-box API-based settings, however, this paradigm can be inefficient due to coarse-grained delegation or repeated transmission of context across model switches. In this work, we instead formulate SLM-LLM collaboration as an information acquisition problem, under an API budget constraint. The SLM remains the primary reasoner and selectively queries a black-box LLM advisor only when needed, issuing targeted queries rather than delegating the reasoning process itself. To realize this strategy, we develop a three-stage RLVR framework that learns whether to call the advisor, how to formulate useful queries, and how to integrate the collaboration into the reasoning process by jointly refining advisor invocation and information use. Across mathematical reasoning and coding tasks, our approach improves the performance--cost tradeoff over existing collaboration baselines and, in some settings, matches or exceeds oracle problem-level routing. Finally, we show that our strategy can transfer to other advisor model families, without further training.

View source

Similar papers

#natural language process... Preprint Sep 2026

Offline Guidance, Online Reasoning: Reusing LLM Feedback for Small Language Models

Reusable Latent Correction (RLC) is proposed, which converts one-off natural-language guidance from a black-box LLM into persistent corrective experiences in the hidden space of an SLM, enabling the SLM to reuse LLM-derived corrections during inference without any online LLM calls.

Bo-Han Zhang, Li-Nan Yue, Weibo Gao et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Sibyl: An Efficient Small-large Model Collaboration Framework for Long-horizon Tasks

Small language models (SLMs) offer a promising foundation for on-device agents through low-latency, resource-efficient inference, yet limited reasoning and planning capabilities constrain their performance on long-horizon tasks requiring multi-step interaction with the environment. Step-level collaboration between SLMs...

Zhe-Wei Fang, Yu-Xin Zhang, Zhen-Wei Shao et al. · 0 citations
Conference Open access Sep 2026

A Review on Test-Time Scaling for Agentic Large Language Models

A novel RAIE taxonomy along four scaling dimensions is proposed, which optimizes the entire thought process through search algorithms and self-verification, and introduces a task-oriented guideline for choosing the best TTS strategy.

Jia-Yu An, Zheng Chen, Yong-Cheng Jing et al. · 0 citations
#machine learning Preprint Sep 2026

You Only Edit Once: Incentivizing In-Context Capability of LLMs via Local Demonstration Refinement

In-context learning (ICL) is crucial for boosting the inference performance of large language models (LLMs). However, the effectiveness of ICL in LLMs is greatly influenced by the choice of demonstration sets. Exhaustive searches over these sets are combinatorial, and existing selectors often rely on relevance or likel...

Jia-Rong Wen, Qi Wang, Yun Qu et al. · 0 citations
Open access Aug 2026

Provisioning An Adaptive Model to Analyze Uncertainty and Large Language Patterns for Enhanced Document Re-Ranking

This work introduces a trust based adaptive reranking model- ATM (Adaptive Trust Model) that allocates computational resources according to file level uncertainty, instead of assigning a fixed number of reranker calls per query, which focuses computation only where ranking confidence is low.

Jenny Kalaiarasi.S · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.