#algorithm-discovery News & Analysis

8 articles tagged with #algorithm-discovery. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

8 articles

AIBullisharXiv – CS AI · Jun 57/10

🧠

MLEvolve: A Self-Evolving Framework for Automated Machine Learning Algorithm Discovery

MLEvolve introduces a self-evolving multi-agent framework powered by large language models that automates machine learning algorithm discovery through enhanced tree search, dynamic memory systems, and hierarchical planning. The system achieves state-of-the-art results on ML engineering benchmarks while operating in half the standard runtime, demonstrating significant advances in automating complex scientific discovery tasks.

AIBullisharXiv – CS AI · May 127/10

🧠

AHD Agent: Agentic Reinforcement Learning for Automatic Heuristic Design

Researchers introduce AHD Agent, a reinforcement learning framework that enables language models to autonomously design heuristics for solving complex combinatorial optimization problems. A 4-billion-parameter model achieves performance comparable to much larger systems while requiring significantly fewer computational evaluations, advancing the frontier of AI-driven algorithm design.

AIBullisharXiv – CS AI · Apr 207/10

🧠

EVIL: Evolving Interpretable Algorithms for Zero-Shot Inference on Event Sequences and Time Series with LLMs

Researchers introduce EVIL, an LLM-guided evolutionary approach that discovers interpretable Python algorithms for zero-shot inference on time series and event sequences without traditional neural network training. The evolved algorithms match or exceed deep learning performance while remaining transparent and significantly faster, demonstrating a novel paradigm for dynamical systems inference.

AINeutralarXiv – CS AI · Jun 96/10

🧠

Discovering Data Structures: Nearest Neighbor Search and Beyond

Researchers propose an end-to-end machine learning framework that discovers optimal data structures from scratch, with applications to nearest neighbor search and stream frequency estimation. The framework learns algorithms like binary search, interpolation search, k-d trees, and locality-sensitive hashing variants without explicit initialization, demonstrating AI's capability to reverse-engineer classical computer science solutions.

AINeutralarXiv – CS AI · May 276/10

🧠

The Kalman Evolve: Closing the Gap in Kalman Filtering via Interpretable Algorithm Discovery

Researchers introduce Kalman Evolve, a framework that uses large language models to discover improved filtering algorithms for state estimation by optimizing both noise parameters and the update structure of classical Kalman filters. The approach addresses performance gaps in nonlinear sensing scenarios like Doppler radar and LiDAR, achieving up to 12% RMSE improvement over standard methods.

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 116/10

🧠

Discovering Learning-Friendly Generation Orders for Sequential Computation

Researchers have developed an automated method to discover optimal generation orders for sequential computation tasks, using loss profiling to evaluate candidate orders efficiently. The technique successfully raises success rates from ~10% to ~100% on order-sensitive tasks and rediscovers known efficient patterns like reverse-digit ordering for multiplication.

AINeutralarXiv – CS AI · Apr 146/10

🧠

Layerwise Dynamics for In-Context Classification in Transformers

Researchers have developed a method to make transformer neural networks interpretable by studying how they perform in-context classification from few examples. By enforcing permutation equivariance constraints, they extracted an explicit algorithmic update rule that reveals how transformers dynamically adjust to new data, offering the first identifiable recursion of this kind.