AIBullisharXiv – CS AI · Jun 127/10
🧠Researchers introduce Evoflux, an inference-time evolutionary search method that significantly improves how compact language models handle tool use and workflow execution. By treating tool failures as a repair problem rather than a generation problem, Evoflux increases execution feasibility from 3% to 17-24% on complex multi-tool tasks, outperforming traditional fine-tuning approaches while maintaining cost efficiency.
AIBullisharXiv – CS AI · Jun 47/10
🧠Researchers propose Self-Evolving Prompt Optimization (SePO), a novel system that automatically optimizes AI agent prompts by treating the prompt agent's own instructions as an optimization target. The method demonstrates consistent performance gains across five diverse benchmarks, outperforming existing approaches and showing generalization to unseen tasks.
AIBullisharXiv – CS AI · May 297/10
🧠Researchers used large language models and evolutionary search to create the first domain-independent heuristics for symbolic AI planning that surpass hand-engineered baselines. These evolved heuristics, written in C++, solve more planning tasks than existing state-of-the-art approaches and maintain the soundness guarantees of traditional planners.
AIBullisharXiv – CS AI · Apr 77/10
🧠Researchers developed an LLM-powered evolutionary search method to automatically design uncertainty quantification systems for large language models, achieving up to 6.7% improvement in performance over manual designs. The study found that different AI models employ distinct evolutionary strategies, with some favoring complex linear estimators while others prefer simpler positional weighting approaches.
🧠 Claude🧠 Sonnet🧠 Opus
AINeutralarXiv – CS AI · Jun 256/10
🧠Researchers demonstrate using large language models to automate the generation of increasingly difficult benchmark instances for testing neural reasoning systems. The approach combines LLM-driven evolutionary search with an Edge Transformer evaluator, enabling automated discovery of challenging problem instances and improvements in model generalization without manual benchmark creation.
AIBullisharXiv – CS AI · May 296/10
🧠Researchers propose BaSE, a multi-armed bandit algorithm that optimizes how large language models allocate computational resources during evolutionary search tasks. By dynamically distributing LLM calls across parallel trajectories, BaSE improves mean fitness by 12.3% over existing baselines while addressing the reliability gap between reported best-case and typical run performance.
AIBullisharXiv – CS AI · May 126/10
🧠Researchers introduce LEVI, an open-source evolutionary search framework that achieves superior results on AI research benchmarks while reducing computational costs by 3.3x to 35x compared to existing methods. By optimizing search architecture rather than relying on larger language models, LEVI demonstrates that algorithmic efficiency can significantly reduce the expense of LLM-guided evolutionary discovery.
AIBullisharXiv – CS AI · Mar 266/10
🧠Researchers introduce AscendOptimizer, an AI agent that optimizes operators for Huawei's Ascend NPUs through evolutionary search and experience-based learning. The system achieved 1.19x geometric-mean speedup over baselines on 127 real operators, with nearly 50% outperforming reference implementations.
