LEVI: Stronger Search Architectures Can Substitute for Larger LLMs in Evolutionary Search
Kicking off the AIDDA Institute speaker series, Temoor Tanveer presents LEVI, a framework showing that stronger search architectures can substitute for — or even outperform — larger LLMs in evolutionary search.
Date
Tuesday, July 28, 2026
Time
6:00 PM - 7:00 PM GMT+1
Location
Virtual (Zoom)
Status
Registration Open
About This Event
Kicking off the AIDDA Institute speaker series, Temoor Tanveer (Carnegie Mellon University alumnus, independent researcher) presents LEVI, a framework demonstrating that stronger search architectures can substitute for — or even outperform — larger LLMs in evolutionary search. The talk covers LEVI's conceptual foundations, core design, research findings, and cost-saving mechanisms, and may include a live demonstration on a computational problem. LEVI achieves top benchmark scores at 3.3-6.7x lower computational cost than competing frameworks, matches existing best results on one problem at 35x reduced expense, and outperforms GEPA on prompt optimization benchmarks using less than half the computational budget.
Speakers & Talks
LEVI: Stronger Search Architectures Can Substitute for Larger LLMs in Evolutionary Search
LEVI is a framework demonstrating that stronger search architectures can substitute for or even outperform larger LLMs in evolutionary search. The presentation covers the conceptual foundations, core design, research findings, and cost-saving mechanisms, and may include a live demonstration on a computational problem.