Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.06033

Help | Advanced Search

Computer Science > Computation and Language

arXiv:2506.06033 (cs)
[Submitted on 6 Jun 2025 ]

Title: Large Language Models are Demonstration Pre-Selectors for Themselves

Title: 大型语言模型是自己的演示预选器

Authors:Jiarui Jin, Yuwei Wu, Haoxuan Li, Xiaoting He, Weinan Zhang, Yiming Yang, Yong Yu, Jun Wang, Mengyue Yang
Abstract: In-context learning (ICL) with large language models (LLMs) delivers strong few-shot performance by choosing few-shot demonstrations from the entire training data. However, existing ICL methods, which rely on similarity or diversity scores to choose demonstrations, incur high computational costs due to repeatedly retrieval from large-scale datasets for each query. To this end, we propose FEEDER (FEw yet Essential Demonstration prE-selectoR), a novel pre-selection framework that identifies a representative subset of demonstrations containing the most representative examples in the training data, tailored to specific LLMs. To construct this subset, we introduce the "sufficiency" and "necessity" metrics in the pre-selection stage and design a tree-based algorithm to identify representative examples efficiently. Once pre-selected, this representative subset can effectively replace the full training data, improving efficiency while maintaining comparable performance in ICL. Additionally, our pre-selected subset also benefits fine-tuning LLMs, where we introduce a bi-level optimization method that enhances training efficiency without sacrificing performance. Experiments with LLMs ranging from 300M to 8B parameters show that FEEDER can reduce training data size by over 20% while maintaining performance and seamlessly integrating with various downstream demonstration selection strategies in ICL.
Abstract: 上下文学习(ICL)借助大型语言模型(LLMs)通过从整个训练数据中选择少量演示样本能够实现强大的少样本性能。然而,现有的依赖相似性或多样性分数来选择演示样本的 ICL 方法,由于需要对每个查询反复从大规模数据集中检索,计算成本较高。为此,我们提出了 FEEDER(FEw yet Essential Demonstration prE-selectoR),这是一种新颖的预选框架,旨在为特定的 LLMs 识别包含训练数据中最具有代表性的示例的代表性演示子集。为了构建这个子集,我们在预选阶段引入了“充分性”和“必要性”度量,并设计了一种基于树的算法以高效地识别代表性示例。一旦预选完成,这个代表性子集可以有效地替代完整的训练数据,在提高效率的同时保持与 ICL 相当的性能。此外,我们的预选子集还能够促进 LLMs 的微调,我们引入了一种双层优化方法,能够在不牺牲性能的情况下提升训练效率。实验结果显示,使用参数范围从 300M 到 8B 的 LLMs 进行测试时,FEEDER 可以减少超过 20% 的训练数据量,同时保持性能,并且能够无缝集成到 ICL 中的各种下游演示选择策略中。
Comments: ICML 2025
Subjects: Computation and Language (cs.CL)
Cite as: arXiv:2506.06033 [cs.CL]
  (or arXiv:2506.06033v1 [cs.CL] for this version)
  https://doi.org/10.48550/arXiv.2506.06033
arXiv-issued DOI via DataCite

Submission history

From: Jiarui Jin [view email]
[v1] Fri, 6 Jun 2025 12:29:03 UTC (700 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.CL
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号