LangProBe: a Language Programs Benchmark

Shangyin Tan, Lakshya A Agrawal, Arnav Singhvi, Liheng Lai, Michael J Ryan +4 more
2/27/2025
cs.CLcs.AIcs.IR

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Composing language models (LMs) into multi-step language programs and automatically optimizing their modular prompts is now a mainstream paradigm for building AI systems, but the tradeoffs in this space have only scarcely been studied before. We introduce LangProBe, the first large-scale benchmark for evaluating the architectures and optimization strategies for language programs, with over 2000 combinations of tasks, architectures, optimizers, and choices of LMs. Using LangProBe, we are the first to study the impact of program architectures and optimizers (and their compositions together and with different models) on tradeoffs of quality and cost. We find that optimized language programs offer strong cost--quality Pareto improvement over raw calls to models, but simultaneously demonstrate that human judgment (or empirical decisions) about which compositions to pursue is still necessary for best performance. We will open source the code and evaluation data for LangProBe.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tan2025langprobe,
  title  = {LangProBe: a Language Programs Benchmark},
  author = {Shangyin Tan and Lakshya A Agrawal and Arnav Singhvi and Liheng Lai and Michael J Ryan and Dan Klein and Omar Khattab and Koushik Sen and Matei Zaharia},
  year   = {2025},
  eprint = {2502.20315},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.20315v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.20315.svg)](https://codeofpaper.com/paper/2502.20315)

Discussion