Cascaded Batch Prompting

Sho Hoshino, Peinan Zhang


Abstract
Although batch prompting makes large language model inference more efficient by processing multiple instances simultaneously, it suffers from unpredictable downstream task performance. We propose cascaded batch prompting, a two-stage approach designed to resolve the unpredictability of conventional batch prompting by disentangling complex reasoning from symbol grounding. Experiments on multiple-choice question answering and natural language inference demonstrate that the proposed method outperforms the standard single prompting baseline while achieving a speedup proportional to batch size, establishing a new state of the art on the Pareto frontier.
Anthology ID:
2026.findings-emnlp.119
Volume:
Findings of the Association for Computational Linguistics: EMNLP 2026
Month:
October
Year:
2026
Address:
Budapest, Hungary
Editors:
Hung-Yi Lee, Sunipa Dev, Jessy Li, Desmond Elliott
Venue:
Findings
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
2462–2469
Language:
URL:
https://aclanthology.org/2026.findings-emnlp.119/
DOI:
Bibkey:
Cite (ACL):
Sho Hoshino and Peinan Zhang. 2026. Cascaded Batch Prompting. In Findings of the Association for Computational Linguistics: EMNLP 2026, pages 2462–2469, Budapest, Hungary. Association for Computational Linguistics.
Cite (Informal):
Cascaded Batch Prompting (Hoshino & Zhang, Findings 2026)
Copy Citation:
PDF:
https://aclanthology.org/2026.findings-emnlp.119.pdf