AIarXiv

Ranked by formulaVerdict: Notable

A Cross-Domain Evaluation of Prompting Techniques for Large Language Models

Prompt engineering has become a central mechanism for guiding the behavior of Large Language Models (LLMs) across a wide range of reasoning and language understanding tasks [1], [2].

By Krazius, Schlippe, Libbrecht

Score████░░░░░░3.9

Key numbers

  • 78.33% when 300 examples are

VerdictWorth a reader's time today.

Read the originalPDF

Abstract

Prompt engineering has become a central mechanism for guiding the behavior of Large Language Models (LLMs) across a wide range of reasoning and language understanding tasks [1], [2]. However, existing studies frequently evaluate prompting techniques using different LLMs, datasets, or task settings, making direct comparisons across methods and domains difficult [3]. Consequently, in this paper we present a controlled cross-domain evaluation of Zero-Shot prompting, Few-Shot prompting, Retrieval-Augmented Generation (RAG), and automatic prompt optimization based on a PE2-inspired optimization pipeline [4]-[6]. All experiments were conducted with the same LLM and evaluated on six benchmark datasets covering arithmetic reasoning, logical reasoning, commonsense reasoning, and factual verification. The results show that no prompting strategy consistently outperforms the others across all domains, and pairwise statistical comparisons of the highest-performing configurations revealed no significant differences. RAG achieves the highest overall average accuracy of 78.33% when 300 examples are available for retrieval, while Few-Shot Prompting achieves comparatively high accuracies across several structured reasoning tasks. Zero-Shot Prompting remains competitive on tasks with self-contained inputs, whereas the PE2-inspired optimization approach produces stable but not systematically superior results compared to the other evaluated prompting techniques. Furthermore, increasing the number of task-specific examples does not consistently improve performance across prompting techniques, indicating strong domain and task dependency. These findings suggest that prompting techniques should be selected adaptively based on task characteristics rather than treated as universally applicable optimization strategies.

Kevin Krazius, Tim Schlippe, Paul Libbrecht

The editor's rubric

Heuristic review

Leverage4 / 5
A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).
24% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty3 / 5
A genuinely new approach to an open problem.
16% of this desk’s rubric
Trajectory3 / 5
A clear path to scale.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (general-purpose, wide range, many tasks); gains (outperforms); novelty (alternative to status quo); verification (multiple benchmarks); stakes (general AI).

How the score was computed

rank-2026-10-18

Score████░░░░░░3.9

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
6.3 / 10
Weighted rubric, evidence-gated.
Adjusted merit
5.1 / 10
Shrunk toward the desk prior by editor confidence (48%).
Attention
5%
Citations, upvotes, points, mentions.
Freshness
42%
Half-life decay since publication.
  • Citations1 (reference 15, via semantic-scholar, Oct 21, 2026, 03:16 UTC)
  • Influential citations0 (reference 3, via semantic-scholar, Oct 21, 2026, 03:16 UTC)

The record

  • Reviewed by heuristic-v7 on Oct 20, 2026, 13:49 UTC. Paper type: method.
  • Categories: cs.AI, cs.CL
  • BRIEF, No.7 in the Artificial Intelligence edition of October 21, 2026.