Dynamic Few-Shot Prompting: Retrieve the k Nearest Exemplars with Cosine kNN

Static few-shot prompting pastes the same handful of examples into every prompt. That one set has to serve every possible input at once, so it is a permanent compromise: for any particular request most of its examples are off-topic filler that spends tokens and dilutes the pattern, and any kind of input it didn't anticipate gets no relevant demonstration at all. Dynamic few-shot flips that. You keep a pool of labeled exemplars and, per input, retrieve the k most similar and paste only those.…