y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#evolutionary-algorithms News & Analysis

31 articles tagged with #evolutionary-algorithms. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

31 articles
AIBullisharXiv – CS AI · Apr 207/10
🧠

EvoTest: Evolutionary Test-Time Learning for Self-Improving Agentic Systems

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: Evolving Agentic Systems for Red-Teaming

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 57/10
🧠

Joint Hardware-Workload Co-Optimization for In-Memory Computing Accelerators

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
🧠

The FM Agent

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
🧠

On Discovering Algorithms for Adversarial Imitation Learning

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 · 5d ago6/10
🧠

DEI: Diversity in Evolutionary Inference for Quality-Diversity Search

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
AIBullisharXiv – CS AI · 5d ago6/10
🧠

EvoEmo: Towards Evolved Emotional Policies for Adversarial LLM Agents in Multi-Turn Price Negotiation

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
🧠

Teacher-Aware Evolution of Heuristic Programs from Learned Optimization Policies

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
🧠

GESR: A Genetic Programming-Based Symbolic Regression Method with Gene Editing

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
🧠

Resource-Aware Evolutionary Neural Architecture Search for Cardiac MRI Segmentation

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
🧠

Evolutionary Ensemble of Agents

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
🧠

EvoPref: Multi-Objective Evolutionary Optimization Discovers Diverse LLM Alignments Beyond Gradient Descent

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
🧠

Exploring the non-convexity in machine learning using quantum-inspired optimization

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
🧠

Discovering Multiagent Learning Algorithms with Large Language Models

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
🧠

Intentmaking and Sensemaking: Human Interaction with AI-Guided Mathematical Discovery

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
🧠

MASPO: Joint Prompt Optimization for LLM-based Multi-Agent Systems

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
🧠

Evolutionary fine tuning of quantized convolution-based deep learning models

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: LLM-Driven Evolutionary Optimization with Runtime-Enriched Target Selection for Multi-Language Code Enhancement

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
🧠

LLM DNA: Tracing Model Evolution via Functional Representations

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
🧠

Prompt Evolution for Generative AI: A Classifier-Guided Approach

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.

AINeutralarXiv – CS AI · Mar 96/10
🧠

ContextBench: Modifying Contexts for Targeted Latent Activation

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
🧠

EvoTool: Self-Evolving Tool-Use Policy Optimization in LLM Agents via Blame-Aware Mutation and Diversity-Aware Selection

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
Page 1 of 2Next →