Unverified50% confidenceFactExact time
GEPA is a class of black-box methods that combine evolutionary search with prompt optimization, maintaining a population of candidates and iterating across generations through sampling, mutation, and evaluation, using a Pareto frontier to retain diverse winning candidates and alleviate premature convergence.
1
Sources
50%
Confidence
Long-term
Relevance
10/31/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedGEPA is an automatic prompt optimization method that combines evolutionary computation with multi-objective optimization, selecting optimal prompts through Pareto frontier criteria.80% similarUnverifiedThe recommended progression is: first use ablation experiments to confirm feature effectiveness, then implement 64-bit integer encoding for acceleration, then gradually increase search depth, and finally use genetic algorithms to re-optimize feature weights at the new depth.62% similarUnverified"Mutants" in the comments refers to candidate variants generated by a program during search or optimization: the model produces multiple versions of code, plans or parameter combinations at once, then eliminates them one by one through testing, scoring or self-critique, keeping the best.62% similarUnverifiedGEPA-Curator adds two modules to the original prompt optimizer GEPA: task curation and prior success retrieval.61% similarUnverifiedThe EPOCH framework takes instance coverage directly as the objective of evolutionary search and, through experience preference optimization, enables the generator to internalize the reflection signal.60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1121318API
curl https://kongchang.com/api/v1/knowledge/claims/1121318MCP
get_claim(id=1121318)