← All speakers

Bio, Work & Ideas

Lakshya Agrawal

Conference affiliation: Creator and maintainer of GEPA · GEPA · 2026

Lakshya A. Agrawal was described in his 2026 AI Engineer conference biography as the creator and maintainer of GEPA and a second-year EECS PhD student at UC Berkeley’s Sky Computing Lab. His research focuses on optimization, evaluation, and self-improvement for LLM-based agents and systems. He previously worked as an AI4Code Research Fellow at Microsoft Research.

Agrawal presents reflective optimization as a way to improve AI systems by learning from full execution traces, including intermediate outputs, tool responses, and error messages. GEPA uses this feedback to propose better prompts and maintains a Pareto pool of candidates that perform well on individual training examples, helping the search avoid local optima. He also presents Optimize Anything, which extends this approach to code, agent harnesses, scheduling policies, and other text artifacts that can be scored, with evaluators supplying diagnostic feedback alongside results.

His examples include evolving a four-line program into a six-step agent that hypothesizes rules, synthesizes and executes code, and debugs its solutions. He reports that this raised Gemini Flash accuracy on an ARC-AGI example from 32.5% to 89.5%. He also describes learning repository-specific coding skills that improved a GPT-5 mini agent’s Go issue-resolution results from 24% to 93%, with those skills transferring to Claude Sonnet. For subjective tasks, he explains how detailed human feedback on production trajectories can train an LLM judge that guides further agent improvement, and discusses jointly optimizing model weights and prompt harnesses.

1 conference talk

Key ideas

Scroll to read ↓

Lakshya A. Agrawal explains how full execution traces can teach an optimizer more than a reward alone—and how the same search can improve prompts, agent programs, repository skills and evaluators.

  • Reflection uses the diagnostic content of an attempt—intermediate outputs, tool responses and errors—to propose a behavioral change in text.
    2:40 ↗
  • GEPA’s Pareto pool preserves candidates with strengths on individual examples, allowing search to continue along alternatives when the highest-scoring prompt stops improving.
    8:51 ↗
  • Optimize Anything can search over prompts, programs and policies when they can be represented as text and scored. The evaluator should return actionable feedback alongside its score.
    10:41 ↗
  • Learned repository skills can carry practical knowledge between attempts and models, reducing repeated exploration as well as improving task completion.
    15:56 ↗
  • For subjective tasks, detailed human annotations can first train an LLM judge prompt; that judge can then guide agent optimization in a continuing production feedback cycle.
    19:18 ↗

References