Comparative Analysis of Demonstration Selection Algorithms for LLM In-Context Learning
Dong Shu, Mengnan Du

TL;DR
This paper evaluates six demonstration selection algorithms for in-context learning with LLMs across multiple datasets, revealing significant performance variability and trade-offs between accuracy and efficiency.
Contribution
It provides a comprehensive empirical comparison of existing demonstration selection algorithms, highlighting their strengths, weaknesses, and practical considerations.
Findings
Performance varies significantly across algorithms and tasks.
Increasing demonstrations does not always improve results.
Trade-offs exist between accuracy and computational efficiency.
Abstract
In-context learning can help Large Language Models (LLMs) to adapt new tasks without additional training. However, this performance heavily depends on the quality of the demonstrations, driving research into effective demonstration selection algorithms to optimize this process. These algorithms assist users in selecting the best input-label pairs (demonstration examples) based on a given test input, enabling LLMs to in-context learn the relationship between the provided examples and the test inputs. Despite all the proposed demonstration selection algorithms, their efficiency and effectiveness remain unclear. This lack of clarity make it difficult to apply these algorithms in real-world scenarios and poses challenges for future research aimed at developing improved methods. This paper revisits six proposed algorithms, evaluating them on five datasets from both efficiency and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Online Learning and Analytics · Data Mining Algorithms and Applications
