CLFeb 18, 2024

In-Context Example Ordering Guided by Label Distributions

arXiv:2402.11447v134 citationsh-index: 38NAACL-HLT
Originality Incremental advance
AI Analysis

This work addresses a key bottleneck in in-context learning for NLP, offering a method to enhance performance without task-specific training, though it is incremental as it builds on existing ordering sensitivity issues.

The paper tackles the sensitivity of in-context learning performance to example ordering in large language models by formulating it as an optimization problem and proposing principles guided by label distributions. The approach improves classification accuracy, reduces miscalibration, and selects better examples across 13 datasets and 9 models with up to 13B parameters.

By allowing models to predict without task-specific training, in-context learning (ICL) with pretrained LLMs has enormous potential in NLP. However, a number of problems persist in ICL. In particular, its performance is sensitive to the choice and order of in-context examples. Given the same set of in-context examples with different orderings, model performance may vary between near random to near state-of-the-art. In this work, we formulate in-context example ordering as an optimization problem. We examine three problem settings that differ in the assumptions they make about what is known about the task. Inspired by the idea of learning from label proportions, we propose two principles for in-context example ordering guided by model's probability predictions. We apply our proposed principles to thirteen text classification datasets and nine different autoregressive LLMs with 700M to 13B parameters. We demonstrate that our approach outperforms the baselines by improving the classification accuracy, reducing model miscalibration, and also by selecting better in-context examples.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes