activity
20202026
most citedOn the Opportunities and Risks of Foundation Models

2.3k citations · 2.8k across the 30 of their papers we have counts for

collaborators

31 papers

cs.CL2026

optimize_anything: A Universal API for Optimizing any Text Parameter

Lakshya A Agrawal, Donghyun Lee, Shangyin Tan +11

Can a single LLM-based optimization system match specialized tools across fundamentally different domains? We show that when optimization problems are formulated as improving a tex…

cs.IR2025

LIR: The First Workshop on Late Interaction and Multi Vector Retrieval @ ECIR 2026

Benjamin Clavié, Xianming Li, Antoine Chaffin +4

Late interaction retrieval methods, pioneered by ColBERT, have emerged as a powerful alternative to single-vector neural IR. By leveraging fine-grained, token-level representations…

cs.CL2025

Composing Policy Gradients and Prompt Optimization for Language Model Programs

Noah Ziems, Dilara Soylu, Lakshya A Agrawal +10

Group Relative Policy Optimization (GRPO) has proven to be an effective tool for post-training language models (LMs). However, AI systems are increasingly expressed as modular prog…

cs.CL2025★ 2 cited

GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning

Lakshya A Agrawal, Shangyin Tan, Dilara Soylu +14

Large language models (LLMs) are increasingly adapted to downstream tasks via reinforcement learning (RL) methods like Group Relative Policy Optimization (GRPO), which often requir…

cs.IR2025

ColBERT-serve: Efficient Multi-Stage Memory-Mapped Scoring

Kaili Huang, Thejas Venkatesh, Uma Dingankar +9

We study serving retrieval models, specifically late interaction models like ColBERT, to many concurrent users at once and under a small budget, in which the index may not fit in m…

cs.CL2025

LangProBe: a Language Programs Benchmark

Shangyin Tan, Lakshya A Agrawal, Arnav Singhvi +6

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 t…

cs.IR2025★ 7 cited

WARP: An Efficient Engine for Multi-Vector Retrieval

Jan Luca Scheerer, Matei Zaharia, Christopher Potts +2

Multi-vector retrieval methods such as ColBERT and its recent variant, the ConteXtualized Token Retriever (XTR), offer high accuracy but face efficiency challenges at scale. To add…

cs.IR2024★ 1 cited

Drowning in Documents: Consequences of Scaling Reranker Inference

Mathew Jacob, Erik Lindgren, Matei Zaharia +3

Rerankers, typically cross-encoders, are computationally intensive but are frequently used because they are widely assumed to outperform cheaper initial IR systems. We challenge th…

cs.CL2024★ 2 cited

Fine-Tuning and Prompt Optimization: Two Great Steps that Work Better Together

Dilara Soylu, Christopher Potts, Omar Khattab

Natural Language Processing (NLP) systems are increasingly taking the form of sophisticated modular pipelines, e.g., Retrieval Augmented Generation (RAG), where each module may inv…

cs.IR2024★ 1 cited

Prompts as Auto-Optimized Training Hyperparameters: Training Best-in-Class IR Models from Scratch with 10 Gold Labels

Jasper Xian, Saron Samuel, Faraz Khoubsirat +7

We develop a method for training small-scale (under 100M parameter) neural information retrieval models with as few as 10 gold relevance labels. The method depends on generating sy…

cs.CL2024★ 4 cited

Optimizing Instructions and Demonstrations for Multi-Stage Language Model Programs

Krista Opsahl-Ong, Michael J Ryan, Josh Purtell +4

Language Model Programs, i.e. sophisticated pipelines of modular language model (LM) calls, are increasingly advancing NLP tasks, but they require crafting prompts that are jointly…

cs.CL2024★ 2 cited

When Benchmarks are Targets: Revealing the Sensitivity of Large Language Model Leaderboards

Norah Alzahrani, Hisham Abdullah Alyahya, Yazeed Alnumay +9

Large Language Model (LLM) leaderboards based on benchmark rankings are regularly used to guide practitioners in model selection. Often, the published leaderboard rankings are take…

cs.CL2024★ 5 cited

In-Context Learning for Extreme Multi-Label Classification

Karel D'Oosterlinck, Omar Khattab, François Remy +3

Multi-label classification problems with thousands of classes are hard to solve with in-context learning alone, as language models (LMs) might lack prior knowledge about the precis…

cs.CL2024★ 7 cited

Building Efficient and Effective OpenQA Systems for Low-Resource Languages

Emrah Budur, Rıza Özçelik, Dilara Soylu +3

Question answering (QA) is the task of answering questions posed in natural language with free-form natural language answers extracted from a given passage. In the OpenQA variant,…

cs.CL2023★ 2 cited

DSPy Assertions: Computational Constraints for Self-Refining Language Model Pipelines

Arnav Singhvi, Manish Shetty, Shangyin Tan +4

Chaining language model (LM) calls as composable modules is fueling a new way of programming, but ensuring LMs adhere to important constraints requires heuristic "prompt engineerin…

cs.CL2023★ 6 cited

ARES: An Automated Evaluation Framework for Retrieval-Augmented Generation Systems

Jon Saad-Falcon, Omar Khattab, Christopher Potts +1

Evaluating retrieval-augmented generation (RAG) systems traditionally relies on hand annotations for input queries, passages to retrieve, and responses to generate. We introduce AR…

cs.CL2023★ 55 cited

DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines

Omar Khattab, Arnav Singhvi, Paridhi Maheshwari +10

The ML community is rapidly exploring techniques for prompting language models (LMs) and for stacking them into pipelines that solve complex tasks. Unfortunately, existing LM pipel…

cs.IR2023

Resources and Evaluations for Multi-Distribution Dense Information Retrieval

Soumya Chatterjee, Omar Khattab, Simran Arora

We introduce and define the novel problem of multi-distribution information retrieval (IR) where given a query, systems need to retrieve passages from within multiple collections,…

cs.IR2023★ 1 cited

UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankers

Jon Saad-Falcon, Omar Khattab, Keshav Santhanam +6

Many information retrieval tasks require large labeled datasets for fine-tuning. However, such datasets are often unavailable, and their utility for real-world applications can dim…

cs.CL2023★ 53 cited

Demonstrate-Search-Predict: Composing retrieval and language models for knowledge-intensive NLP

Omar Khattab, Keshav Santhanam, Xiang Lisa Li +4

Retrieval-augmented in-context learning has emerged as a powerful approach for addressing knowledge-intensive tasks using frozen language models (LM) and retrieval models (RM). Exi…

cs.IR2022

Moving Beyond Downstream Task Accuracy for Information Retrieval Benchmarking

Keshav Santhanam, Jon Saad-Falcon, Martin Franz +7

Neural information retrieval (IR) systems have progressed rapidly in recent years, in large part due to the release of publicly available benchmarking tasks. Unfortunately, some di…

cs.CL2022★ 128 cited

Holistic Evaluation of Language Models

Percy Liang, Rishi Bommasani, Tony Lee +47

Language models (LMs) are becoming the foundation for almost all major language technologies, but their capabilities, limitations, and risks are not well understood. We present Hol…

cs.IR2022★ 8 cited

PLAID: An Efficient Engine for Late Interaction Retrieval

Keshav Santhanam, Omar Khattab, Christopher Potts +1

Pre-trained language models are increasingly important components across multiple information retrieval (IR) paradigms. Late interaction, introduced with the ColBERT model and rece…

cs.IR2022★ 7 cited

Introducing Neural Bag of Whole-Words with ColBERTer: Contextualized Late Interactions using Enhanced Reduction

Sebastian Hofstätter, Omar Khattab, Sophia Althammer +2

Recent progress in neural information retrieval has demonstrated large gains in effectiveness, while often sacrificing the efficiency and interpretability of the neural model compa…