ABAB Pedia

Omar Khattab

Omar Khattab is an assistant professor in MIT’s Department of Electrical Engineering and Computer Science. He leads the OASYS lab and studies language-model programming, information retrieval and AI systems.

Contents25 sections
Key facts

Graduating from Carnegie Mellon

ColBERT Retrieval Model

In 2020, he and Matei Zaharia published ColBERT, which encodes queries and documents separately before fine-grained late interaction. Precomputing document representations makes BERT-based semantic matching more efficient for retrieval.⁠[2]

Retrieval and Traceable Search

In an article with Christopher Potts and Matei Zaharia for Stanford HAI, he advocated neural information retrieval as a foundation for better search, retaining the documents behind answers and incorporating new knowledge through index updates.⁠[3]

Apple Research Internship

DSPy Paper

The DSPy paper, on which he is first author, presents language-model applications as composable declarative modules. Compilation and optimization improve model-call pipelines against task metrics, reducing reliance on manually maintained prompts.⁠[5]

Language-Model Software Abstractions

A Two Sigma article he co-authored organizes language-model software into seven layers and compares five framework categories by reliability, performance, portability and extensibility, emphasizing separation of responsibilities between layers.⁠[6]

Compound AI Systems

He co-authored The Shift from Models to Compound AI Systems. The article examines combinations of models, retrieval and tools, treating quality, cost and optimization as system-wide concerns.⁠[7]

Research at Databricks

From June 2024 to June 2025, he was a research scientist at Databricks, working on natural language processing, information retrieval and machine-learning systems.⁠[4]

Approach to Research

In a personal essay, he recommends organizing research around sustained projects rather than individual papers, choosing problems with room to develop, and building impact through rapid iteration, usable software releases and community feedback.⁠[8]

Stanford PhD

He began a computer-science PhD at StanfordStanford UniversityStanford University is a research university in California founded by Leland and Jane Stanford in 1885 and opened in 1891.Open the full entry in 2019 and completed it in January 2025, advised by Christopher Potts and Matei Zaharia. His doctoral work focused on foundation-model programming for more reliable and scalable AI systems.⁠[4]

WARP and the SIGIR Best Paper Award

He co-authored WARP, a multi-vector retrieval engine, with Jan Luca Scheerer, Matei Zaharia, Christopher Potts and Gustavo Alonso. The paper received the SIGIR 2025 Best Paper Award.⁠[9][10]

Tartans on the Rise

Carnegie Mellon named him to its 2025 Tartans on the Rise alumni list. Its profile highlighted his work on higher-level language-model programming abstractions that help domain experts build software.⁠[1]

Talk on AI Systems Engineering

In an AI Engineer talk, he argued for separating application specifications, control flow, tools and evaluations from changing models and optimization methods. He emphasized defining the problem a system must solve and avoiding designs tied to temporary prompting tricks.⁠[11]

Joining MIT

He began as an assistant professor at MIT in July 2025. His current appointment is in Electrical Engineering and Computer Science, where he also holds the TIBCO Founders Career Development Professorship.⁠[4][12]

GEPA Prompt Optimization

He contributed to GEPA, which uses natural-language reflection on execution traces and feedback to generate and select prompt variants. Its comparisons concern particular tasks and do not establish that prompt optimization universally outperforms reinforcement learning.⁠[13]

Recursive Language Models

He and Alex Zhang introduced recursive language models, storing long inputs in an executable environment where a model can inspect and partition them with code and call sub-models on local questions. Early experiments used limited recursion depth and focused on long-context tasks.⁠[14]

Pedagogical RL

Pedagogical RL, which he co-authored, uses information available to a teacher but hidden from a student to generate teaching trajectories while considering whether the student can learn them. The article reports preliminary task experiments on learning from better-targeted demonstrations.⁠[15]

Machine Studying

He, Jacob Xiaochen Li and Rick Battle formulated machine studying: agents study a corpus without knowing future questions, then solve tasks more efficiently while retaining access to the material. The work measures expertise through the relationship between quality and inference cost and introduces the developing StudyBench benchmark.⁠[16]

Harnesses and Compositional Generalization

He and Alex Zhang studied how agent harnesses can help models transfer from shorter to longer tasks, focusing on context offloading and programmatic sub-calls. Their recursive-language-model experiments examine the relationship between task decomposition and the training distribution.⁠[17]

OASYS and Adapting AI Applications

An MIT profile describes his OASYS lab’s aim as addressing AI’s last mile: adapting general models to specific users’ needs. Khattab emphasizes reusable open-source systems methods rather than solutions confined to a single vertical application.⁠[18]

Fall 2026: AI Systems and Agents Course

He teaches MIT’s 6.S978, Engineering AI Systems and Agents, covering reliability, efficiency and maintainability through declarative specifications, evaluation, feedback and compute budgets.⁠[19]

AI and Research Work

In a personal X post, he said AI productivity gains had not made his research work meaningless. Better tools expanded his ambitions, so high-quality results still required time and expertise. He also expressed concern about concentrated power. These statements describe his own research experience and views.⁠[20]

Weight-Space Programming Experiments

He, Rikiya Takehi, Jayden Teoh and Alex Zhang published experiments in which language models directly read and modify other neural networks’ weights. The article reports early successes alongside experiments without meaningful gains; the results do not establish a general replacement for model training.⁠[21]

Related Organizations, Websites, and Public Accounts

Sources

  1. CMU-Q’s Omar Khattab is a Tartan on the Rise (opens in a new window)
  2. ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT (opens in a new window)
  3. A Moderate Proposal for Radically Better AI-powered Web Search (opens in a new window)
  4. Omar Khattab (opens in a new window)
  5. DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines (opens in a new window)
  6. A Guide to Large Language Model Abstractions (opens in a new window)
  7. The Shift from Models to Compound AI Systems (opens in a new window)
  8. On Impactful AI Research (opens in a new window)
  9. WARP: An Efficient Engine for Multi-Vector Retrieval (opens in a new window)
  10. Best Paper Awards (opens in a new window)
  11. On Engineering AI Systems that Endure The Bitter Lesson - Omar Khattab, DSPy & Databricks (opens in a new window)
  12. Omar Khattab (opens in a new window)
  13. GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning (opens in a new window)
  14. Recursive Language Models (opens in a new window)
  15. Pedagogical RL: Teaching Models to Teach Themselves from Privileged Information (opens in a new window)
  16. Machine Studying (opens in a new window)
  17. Language model harnesses are compositional generalizers (opens in a new window)
  18. Solving AI’s ‘Last Mile’ Problem (opens in a new window)
  19. 6.S978: Engineering AI Systems and Agents (opens in a new window)
  20. Omar Khattab on X (October 27, 2026) (opens in a new window)
  21. Sparks of Weight-Space Programming: LLMs can natively read & write neural network weights (opens in a new window)
  22. Omar Khattab (opens in a new window)