大模型
arxiv.org ·
ClusterFewshot:改进 LLM 工作流的少样本优化
该论文提出 ClusterFewshot,一种结合语义结构化与效用感知评分的少样本演示选择策略,用于构建更具代表性的 in-context 示例集。作者在基于 DSPy 的流水线中评估,称其在多个基准上显著降低优化成本,并在独立提示调优与提示-权重混合优化两种设置下相对既有 bootstrap 方法持续提升准确率。摘要未披露具体基准、数据集与数值结果。
AI推荐理由 arXiv 新提交论文(2026-09-22),作者提出 ClusterFewshot,将语义聚类与效用感知打分结合来构建少样本演示集,在 DSPy 流水线中评估,声称降低优化成本并相对 bootstrap 类方法提升准确率。新信息在于把任务语义结构引入演示选择,替代随机采样或指标排序;局限是仅有摘要,未给出具体基准、数据集与量化结果,效果无法独立核实。
72
正文
Computer Science > Computation and Language
arXiv:2609.25939 (cs)
[Submitted on 22 Sep 2026]
Title:ClusterFewshot: Improving Few-shot Optimization for LLMs workflow
Authors:Omri Bar Haim, Shahar Katz, Lior Wolf
View a PDF of the paper titled ClusterFewshot: Improving Few-shot Optimization for LLMs workflow, by Omri Bar Haim and 2 other authors
View PDF
HTML (experimental)
Abstract:The performance of large language model (LLM) workflows often depends on selecting a small set of in-context demonstrations to guide model behavior on new tasks. Recent methods improve this process by augmenting prompts with successful reasoning paths. However, their demonstration selection relies on random sampling or metric-based rankings, overlooking the semantic structure of the task. We propose ClusterFewshot, a strategy that combines semantic structuring with utility-aware scoring to construct representative and effective few-shot demonstration sets. Evaluated within DSPy-based pipelines, ClusterFewshot substantially reduces optimization cost across multiple benchmarks, while consistently improving accuracy relative to prior bootstrap-based methods in both standalone prompt tuning and hybrid prompt-weight optimization.
Subjects:
Computation and Language (cs.CL)
Cite as:
arXiv:2609.25939 [cs.CL]
(or
arXiv:2609.25939v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2609.25939
Focus to learn more
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Omri Bar Haim [view email]
[v1]
Tue, 22 Sep 2026 09:45:29 UTC (309 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled ClusterFewshot: Improving Few-shot Optimization for LLMs workflow, by Omri Bar Haim and 2 other authors
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.CL
new
|
recent
| 2026-09
Change to browse by:
cs
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
export BibTeX citation
Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
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?)