@harold_matmul: it was my idea :) Using GEPA is a very natural workflow for creating LLM programs. The iteration speed is very quick, a…
Summary
A user thanks for the GEPA tool, highlighting its natural workflow for LLM programs, fast iteration, and ability to bias optimization with data-derived priors.
View Cached Full Text
Cached at: 06/03/26, 05:54 PM
@lateinteraction it was my idea :)
Using GEPA is a very natural workflow for creating LLM programs. The iteration speed is very quick, and it easily allows researchers to bias the optimization with some priors (usually derived from just looking at the data).
Thanks a lot for the great tool!
Similar Articles
@tech_optimist: Absolutely amazing work combining RLMs and GEPA. Looking forward to part 2!
A tweet praising the combination of RLMs and GEPA, expressing anticipation for a follow-up.
@lateinteraction: dspy.GEPA used in pretraining data curation in the new Microsoft AI effort :-)
GEPA-optimized LLM judges from dspy are used for data filtering in Microsoft's MAI-Thinking-1 model pre-training pipeline.
@shawntenam: GEPA (http://github.com/gepa-ai/gepa) bumped Haiku 4.5 from 65% to 85% pass rate by auto-optimizing my prompt instructi…
GEPA is an open-source tool that automatically optimizes prompt instructions using execution traces and scores, raising Claude Haiku 4.5's pass rate from 65% to 85% without requiring a model swap.
@HenryL_AI: Big update: @gepa_ai has now been officially integrated into A-Evolve (by community member)! We added GEPA as a new plu…
Community member integrated the GEPA evolution algorithm into A-Evolve as a plug-and-play component, letting any agent use GEPA with zero setup.
@rohanpaul_ai: Another great paper from Google. Shows general LLMs can solve formal math by planning proofs and checking each step. Ra…
A new Google paper introduces LEAP, an agentic framework that enables general LLMs to solve formal math problems by planning proofs and checking each step, raising performance from under 10% to 70% on the Lean IMO benchmark and solving all 2025 Putnam problems.