AIBullisharXiv – CS AI · May 276/10
🧠Researchers present EvoEmo, an evolutionary reinforcement learning framework that enables LLM agents to develop dynamic emotional strategies in multi-turn price negotiations. The system outperforms baseline approaches by achieving higher success rates and efficiency while improving buyer outcomes, demonstrating that adaptive emotional expression enhances AI negotiation capabilities.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers propose a teacher-aware evolutionary framework that leverages pre-trained learned optimization policies to guide the automatic design of heuristic programs for combinatorial optimization problems. The method uses behavioral feedback from teacher policies during evolution rather than relying solely on endpoint performance, achieving better results than baseline LLM-driven approaches without requiring neural inference at deployment.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers propose GESR, a genetic programming method that uses BERT language models to intelligently guide mutations and crossovers in symbolic regression tasks, rather than relying on random evolutionary processes. The approach significantly improves computational efficiency compared to traditional genetic programming algorithms while maintaining strong performance across multiple regression problems.
AINeutralarXiv – CS AI · May 126/10
🧠CardiacNAS presents an evolutionary neural architecture search framework that optimizes cardiac MRI segmentation models for both accuracy and computational efficiency. The approach achieves 93.22% dice similarity with only 3.58M parameters, demonstrating how resource-aware AI design can enable deployment of medical imaging models on resource-constrained environments.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce Evolutionary Ensemble (EvE), a decentralized framework that organizes coding agents into a self-evolving system for algorithmic discovery. By co-evolving two populations—functional code solvers and agent guidance states—EvE autonomously discovered novel mechanisms for In-Context Operator Networks, demonstrating that dynamic agent adaptation outperforms static optimization approaches.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce EvoPref, a multi-objective evolutionary algorithm that optimizes LLM alignment across multiple objectives using population-based methods rather than traditional gradient descent. The approach demonstrates 18% improvement in preference coverage and 47% reduction in preference collapse while maintaining competitive alignment quality compared to gradient-based methods like ORPO.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers propose Quantum-Inspired Evolutionary Optimization (QIEO), a novel algorithmic framework for solving non-convex optimization problems common in modern machine learning. Testing across sparse signal recovery and robust regression tasks, QIEO outperforms established methods like ADAM, genetic algorithms, and specialized solvers by leveraging quantum superposition principles to escape local minima.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers deployed AlphaEvolve, an LLM-powered evolutionary coding framework, to automatically discover new multi-agent reinforcement learning algorithms for imperfect-information games. The system produced two competitive algorithms (VAD-CFR and SHOR-PSRO) that match human-designed baselines, but further analysis revealed that distilled, minimal versions (WOP-CFR and PM-PSRO) generalize better with simpler structures, demonstrating that LLM-discovered complexity often obscures fundamental algorithmic principles.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers conducted a user study with 11 expert mathematicians using AlphaEvolve, an AI coding agent, to explore how humans effectively collaborate with AI systems for scientific discovery. The study identified a cyclical workflow called 'intentmaking'—where users iteratively define and refine experimental goals through system interaction—paired with traditional sensemaking, suggesting AI tools should function as collaborative instruments rather than black-box assistants.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers introduce MASPO, a framework that automatically optimizes prompts across multi-agent LLM systems by evaluating how well each agent's outputs enable downstream success rather than in isolation. The approach uses evolutionary beam search to navigate prompt spaces and achieves 2.9% average accuracy improvements over existing methods across six diverse tasks.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers propose using evolutionary strategies to fine-tune quantized deep learning models, improving accuracy beyond standard nearest-neighbor quantization techniques. The approach selectively adjusts weight values across iterations to find better quantization states, demonstrating effectiveness on VGG, ResNet, and autoencoder architectures for image classification and detection tasks.
AIBullisharXiv – CS AI · May 76/10
🧠CodeEvolve is an AI-driven evolutionary framework that automates code optimization by using LLMs, runtime profiling, and Monte Carlo Tree Search to identify and improve performance bottlenecks. The system achieves significant speedups (15.22x average) on enterprise Java codebases while maintaining functional correctness through rigorous validation pipelines.
AINeutralarXiv – CS AI · May 46/10
🧠Researchers have developed a mathematical framework called LLM DNA that traces the evolutionary relationships between large language models through functional representations rather than documentation. The training-free method successfully identified previously unknown connections among 305 LLMs and constructed an evolutionary tree reflecting architectural shifts and temporal progression in model development.
AINeutralarXiv – CS AI · Apr 156/10
🧠Researchers propose a prompt evolution framework that uses classifier-guided evolutionary algorithms to improve generative AI outputs. Rather than enhancing prompts before generation, the method applies selection pressure during the generative process to produce images better aligned with user preferences while maintaining diversity.
AIBullisharXiv – CS AI · Apr 66/10
🧠Researchers introduce AutoCO, a new method that combines large language models with constraint optimization to solve complex problems more effectively. The approach uses bidirectional coevolution with Monte Carlo Tree Search and Evolutionary Algorithms to prevent premature convergence and improve solution quality.
AINeutralarXiv – CS AI · Mar 96/10
🧠Researchers have developed ContextBench, a new benchmark for evaluating methods that generate targeted inputs to trigger specific behaviors in language models. The study introduces enhanced Evolutionary Prompt Optimization techniques that better balance effectiveness in activating AI model features while maintaining linguistic fluency.
AIBullisharXiv – CS AI · Mar 66/10
🧠Researchers propose EvoTool, a new framework that optimizes AI agent tool-use policies through evolutionary algorithms rather than traditional gradient-based methods. The system decomposes agent policies into four modules and uses blame attribution and targeted mutations to improve performance, showing over 5-point improvements on benchmarks.
🧠 GPT-4
AIBullisharXiv – CS AI · Mar 36/108
🧠Researchers introduced RAISE, a training-free evolutionary framework that improves text-to-image generation by adaptively refining outputs based on prompt complexity. The system achieves state-of-the-art alignment scores while reducing computational costs by 30-80% compared to existing methods.
AIBullisharXiv – CS AI · Mar 36/105
🧠Researchers introduce CEMMA, a co-evolutionary framework for improving AI safety alignment in multimodal large language models. The system uses evolving adversarial attacks and adaptive defenses to create more robust AI systems that better resist jailbreak attempts while maintaining functionality.
AINeutralarXiv – CS AI · May 124/10
🧠Researchers present RDEx-CASK, an enhanced optimization algorithm that extends RDEx-CSOP with three modifications targeting stagnation issues in constrained single-objective optimization. The method introduces Cauchy-sampled scale factors, a small feasible-only archive, and per-individual stagnation counters that trigger adaptive parameter adjustments, achieving competitive performance on CEC benchmark problems.
AINeutralarXiv – CS AI · Mar 174/10
🧠Researchers developed an evolutionary transfer learning approach to adapt chess AI heuristics for Dragonchess, a 3D chess variant. While direct transfers from Stockfish failed, evolutionary optimization using CMA-ES significantly improved AI performance in this complex multi-layer game environment.
AIBullisharXiv – CS AI · Mar 115/10
🧠Researchers present GenePlan, a framework that uses large language models with evolutionary algorithms to generate domain-specific planners for classical planning tasks in PDDL. The system achieved a 0.91 SAT score across eight benchmark domains, nearly matching state-of-the-art performance while significantly outperforming other LLM-based approaches.
🧠 GPT-4
AIBullisharXiv – CS AI · Mar 115/10
🧠Researchers developed CMA-ES-IG, a new algorithm that helps robots learn user preferences more effectively by incorporating user experience considerations. The algorithm suggests perceptually distinct and informative robot behaviors for users to rank, showing improved scalability, computational efficiency, and user satisfaction compared to existing methods.
AINeutralarXiv – CS AI · Mar 34/105
🧠Researchers have developed Lilium, an automated evolutionary method that uses AI to improve skull-face overlay accuracy in forensic identification of skeletal remains. The system employs a Differential Evolution algorithm with 3D cone-based representation to model soft-tissue variability and outperforms existing state-of-the-art methods.
