AIBullisharXiv – CS AI · Jun 257/10
🧠Researchers developed a multi-agent AI system that autonomously designs hardware-compatible computing systems using an Evolutionary Knowledge Graph, successfully compressing a 235-billion-parameter foundation model onto constrained dual-A100 servers with 75% memory reduction. The framework evolved two novel compression techniques (Q-Enhance and MoE-Salient-AQ) that outperform manually-engineered alternatives, establishing a scalable paradigm for hardware-software co-design in AI deployment.
AIBullisharXiv – CS AI · Jun 27/10
🧠EvoPool is an evolutionary multi-agent framework that generates specialized annotation code to label training data more efficiently than LLMs for domain-specific tasks. The system operates 4,500-31,000x faster than LLM annotation while achieving superior performance across biomedical, legal, and reasoning tasks, with improvements up to +0.301 macro-F1 on specialized benchmarks.
AIBullisharXiv – CS AI · Apr 207/10
🧠Researchers introduce EvoTest, an evolutionary framework enabling AI agents to improve performance across consecutive test episodes without fine-tuning or gradients. The method outperforms existing adaptation techniques on a new Jericho Test-Time Learning benchmark, successfully winning games that all baseline methods failed to complete.
AINeutralarXiv – CS AI · Apr 67/10
🧠AgenticRed introduces an automated red-teaming system that uses evolutionary algorithms and LLMs to autonomously design attack methods without human intervention. The system achieved near-perfect attack success rates across multiple AI models, including 100% success on GPT-5.1, DeepSeek-R1 and DeepSeek V3.2.
🧠 GPT-5🧠 Llama
AIBullisharXiv – CS AI · Mar 177/10
🧠Researchers introduced SOAR, a self-improving language model system that combines evolutionary search with hindsight learning for program synthesis tasks. The method achieved 52% success rate on the challenging ARC-AGI benchmark by iteratively improving through search and refinement cycles.
AIBullisharXiv – CS AI · Mar 57/10
🧠Researchers developed a joint hardware-workload co-optimization framework for in-memory computing accelerators that can efficiently support multiple neural network workloads rather than just single specialized models. The framework achieved significant energy-delay-area product reductions of up to 76.2% and 95.5% compared to baseline methods when optimizing across multiple workloads.
AIBullisharXiv – CS AI · Mar 37/102
🧠Researchers have developed FM Agent, a multi-agent AI framework that combines large language models with evolutionary search to autonomously solve complex research problems. The system achieved state-of-the-art results across multiple domains including operations research, machine learning, and GPU optimization without human intervention.
AIBullisharXiv – CS AI · Feb 277/106
🧠Researchers have developed DAIL (Discovered Adversarial Imitation Learning), the first meta-learned AI algorithm that uses LLM-guided evolutionary methods to automatically discover reward assignment functions for training AI agents. This breakthrough addresses stability issues in adversarial imitation learning and demonstrates superior performance compared to human-designed approaches across different environments.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers decompose financial market dynamics by testing four pluggable mechanisms in an evolutionary agent-based model with 120 heterogeneous agents, finding that selection operators control diversity, price microstructure drives realism, and behavioral bias amplifies fragility—but these levers operate largely independently, offering a framework for understanding which market design choices produce which emergent properties.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers introduce zero-inflated Gaussian (ZIG) distributions for estimation-of-distribution algorithms (EDAs) to optimize sparse parameter spaces where most solution coefficients are zero. This approach eliminates the need for hand-crafted sparsity operators and outperforms existing sparse optimization methods on benchmarks.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers introduce residual-space evolutionary optimization, a framework combining flow-based generative models with evolutionary algorithms to enable data editing without requiring differentiable objectives or gradient-based optimization. The method separates local refinement and broad exploration through self-pollination and cross-pollination mechanisms, validated on image benchmarks and crystal structure data.
AINeutralarXiv – CS AI · Jun 115/10
🧠Researchers present SPEA2+, an improved variant of the Strength Pareto Evolutionary Algorithm 2 that addresses limitations in handling dominated solutions during multi-objective optimization. The original SPEA2 struggles with diversity maintenance compared to competing algorithms, a problem solved by replacing k-th nearest-neighbor distance metrics with all-pairwise distance calculations.
AIBullisharXiv – CS AI · Jun 116/10
🧠APEX introduces a data-efficient framework for automatic prompt optimization in large language models by dynamically categorizing training data into Easy, Hard, and Mixed tiers. The system prioritizes Mixed-tier data to identify high-leverage subsets that improve prompt quality, achieving 11.2% performance gains on Gemini 2.5 Flash with 40% fewer evaluations than static approaches.
🧠 Gemini
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers propose a new evolutionary framework for using large language models to generate diverse, high-quality scientific hypotheses by reformulating the search as a sampling problem inspired by parallel tempering. The approach addresses a critical limitation where traditional optimization-focused methods collapse into homogeneous solutions, enabling scientists to maintain multiple robust candidate hypotheses under fixed validation budgets across molecular, equation, and algorithm discovery domains.
AINeutralarXiv – CS AI · Jun 95/10
🧠Researchers propose EvoCSFL, a machine learning framework that optimizes client selection in federated learning systems by using surrogate models and evolutionary algorithms. The method balances model performance, communication latency, and energy consumption to achieve faster convergence and improved robustness compared to random selection approaches.
AINeutralarXiv – CS AI · Jun 96/10
🧠FunctionEvolve is a new evolutionary framework that combines expression trees with LLM guidance to recover exact mathematical equations from data, achieving 82.9% accuracy on synthetic benchmarks—significantly outperforming prior symbolic regression methods by making the search process structure-aware rather than structure-blind.
🧠 Claude🧠 Opus
AIBullisharXiv – CS AI · Jun 96/10
🧠Researchers have developed AutoModSAT, a framework that leverages large language models to automatically discover and optimize heuristics in SAT solvers, achieving 40% performance improvements over baseline solvers. The approach combines modular solver design with LLM-guided function generation and evolutionary algorithms, demonstrating significant practical gains across diverse datasets.
AINeutralarXiv – CS AI · Jun 86/10
🧠Researchers adapted FunSearch, an LLM-guided evolutionary search method, to discover deletion-correcting codes—mathematical constructs that help recover data lost during transmission. The work represents the first application of LLM-guided evolutionary search to error-correcting codes, achieving improvements in single and multiple deletion scenarios, though computational limitations restrict the approach to short code lengths.
AIBullisharXiv – CS AI · Jun 56/10
🧠Researchers propose iCEM+TL, a framework combining the Cross-Entropy Method with transfer learning to improve robotic manipulation planning efficiency. The approach achieves up to 23% success rate improvements in complex tasks like stacking and shelf placement, with validation demonstrated on a real Franka Emika robot.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers have developed a novel method using large language models and evolutionary algorithms to automatically generate admissible heuristics for optimal classical planning problems. Unlike existing learned heuristics that improve search speed but cannot guarantee optimal solutions, this approach preserves A* optimality guarantees while matching or exceeding the performance of traditional domain-independent methods.
AINeutralarXiv – CS AI · Jun 16/10
🧠EARLY (Evolutionary Algorithm for Reservoir Learning and Yielding) introduces an automated method for optimizing Echo State Networks by evolving both topology and hyperparameters using evolutionary algorithms. The framework demonstrates that evolved architectures outperform random search baselines and adapt their complexity based on task difficulty, suggesting potential for creating reusable neural network structures across diverse temporal learning problems.
AINeutralarXiv – CS AI · May 296/10
🧠Researchers developed DEXiRE-EVO, an evolutionary rule extraction framework combining machine learning with explainable AI to predict SME defaults in Italy. The approach outperforms traditional logistic regression while maintaining interpretability, identifying key risk factors like weak liquidity, high leverage, and operational inefficiency across 50,718 firms from 2015-2024.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers identify a significant gap between evolutionary computation research and real-world physics-based optimization applications. Domain experts consistently require fast convergence and algorithm explainability, but existing evolutionary algorithm techniques remain underutilized in complex practical scenarios due to trust and performance concerns.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers demonstrate that Baldwinian and Lamarckian evolutionary algorithms significantly outperform traditional Darwinian evolution on complex optimization problems like Maximum Independent Set and Maximum Cut. The study provides both empirical validation across multiple datasets and theoretical runtime analysis, showing that local search-augmented evolutionary algorithms offer practical advantages for solving NP-hard graph problems.
AINeutralarXiv – CS AI · May 276/10
🧠Researchers present DEI, a distributed Quality-Diversity search framework that uses heterogeneous large language models as mutation operators to solve competitive programming tasks. A four-model ensemble achieved 124% higher performance than single-model baselines, demonstrating that model diversity—not just computational parallelism—drives superior outcomes in evolutionary AI search.
🧠 GPT-5🧠 Claude🧠 Haiku
