Sign inGet started
Paper · arXiv

Long-Context Demonstration Selection Using State Space Models

We study the problem of demonstration selection, which involves selecting a subset of examples for prepending to a query to a language model. This problem is closely related to in-context learning and language model inference. Since the inference cost of a transformer model scales quadratically with sequence length, the selection problem becomes especially challenging in a long-context scenario. In this paper, we tackle this problem by building on state space models (SSMs), which require only linear inference time given the input. Our approach involves two algorithms. The first learns a small set of SSMs through distillation of a (trained) transformer model. We partition all the layers in...

AuthorsZiniu Zhang, Zhenshuo Zhang, Ruoxuan Xiong et al.
Primary categorycs.LG
Published15 September 2026
Last updated at source15 September 2026
cs.LGcs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/7b26b6a9-b2a5-4b16-804c-59f3cfb954fa" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.