CliffSearch: Structured Agentic Co-Evolution over Theory and Code for Scientific Algorithm Discovery
On the map: LLM agents and tool use → Web, search, and research agents
Abstract (arXiv)
Scientific algorithm discovery is iterative: hypotheses are proposed, implemented, stress-tested, and revised. Current LLM-guided search systems accelerate proposal generation, but often under-represent scientific structure by optimizing code-only artifacts with weak correctness/originality gating. We present CliffSearch, an agentic evolutionary framework in which the core evolution operators (pair selection, crossover, mutation, and review) are implemented as LLM agents, and the loop is designed around three principles: (1) each node is a structured scientific artifact, instantiated in either theory+code or code_only mode, (2) reviewer judgments of correctness and originality are first-class selection gates alongside optimization of the benchmark metric of interest, and (3) mutation is split into exploration and correction pathways with distinct objectives. Exploration mutation imports ideas from adjacent scientific domains to increase novelty, while correction mutation performs targeted evidence-guided repair using reviewer signals over theory, code, benchmark results, and runtime errors. We illustrate the framework on three benchmark-grounded studies: transformer hyper-connection evolution, optimizer discovery on a fixed nanoGPT stack, and a smaller native-optimizer ablation. Across these settings, the same loop supports explicit metric direction, reproducible persistence, and reviewer-gated comparison of discoveries under controlled search conditions. The result is a discovery workflow that prioritizes scientific interpretability and correctness while optimizing task metrics under controlled novelty constraints, rather than maximizing candidate throughput alone. Full run artifacts, interactive visualizations, and exported best nodes for the reported studies are available at https://cliffsearch.ai .
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Web, search, and research agents, one of 16 directions in LLM agents and tool use. Builds on 29 of its 66 references that are in the map. First posted on arXiv 1 Apr 2026.
Builds on
29 of 66 references.
References · 29
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Decoupled Weight Decay Regularizationcited by 1,722
- 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 763
- 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 266
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
- 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 179
- 2024Large Language Models to Enhance Bayesian Optimizationcited by 127
- 2024LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristicscited by 92
- 2025Fantastic Pretraining Optimizers and Where to Find Themcited by 87
- 2024Hyper-Connectionscited by 81
- 2025mHC: Manifold-Constrained Hyper-Connectionscited by 76
- 2025Practical Efficiency of Muon for Pretrainingcited by 74
17 more
- 2023Algorithm Evolution Using Large Language Modelcited by 52
- 2022MAtt: A Manifold Attention Network for EEG Decodingcited by 43
- 2024LLM4AD: A Platform for Algorithm Design with Large Language Modelcited by 33
- 2024Evolve Cost-aware Acquisition Functions Using Large Language Modelscited by 17
- 2025Scientific Algorithm Discovery by Augmenting AlphaEvolve with Deep Researchcited by 16
- 2023Curve Your Attention: Mixed-Curvature Transformers for Graph Representation Learningcited by 15
- 2026mHC-lite: You Don't Need 20 Sinkhorn-Knopp Iterationscited by 13
- 2023Automated Design of Metaheuristic Algorithms: A Surveycited by 12
- 2025LLaMEA-BO: A Large Language Model Evolutionary Algorithm for Automatically Generating Bayesian Optimization Algorithmscited by 10
- 2026KromHC: Manifold-Constrained Hyper-Connections with Kronecker-Product Residual Matricescited by 10
- 2023Riemannian Self-Attention Mechanism for SPD Networkscited by 4
- 2026mHC-GNN: Manifold-Constrained Hyper-Connections for Graph Neural Networkscited by 4
- 2026JPmHC Dynamical Isometry via Orthogonal Hyper-Connectionscited by 4
- 2026Spectral-Sphere-Constrained Hyper-Connectionscited by 3
- 2025LLMs, Reasoning and Plagiarismcited by 2
- 2026Geometric Mixture-of-Experts with Curvature-Guided Adaptive Routing for Graph Representation Learningcited by 1
- 2026Early Discoveries of Algorithmist I: Promise of Provable Algorithm Synthesis at Scalecited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025ATHENA: Agentic Team for Hierarchical Evolutionary Numerical Algorithms
- 2026AlgoEvo: Self-Evolving Agentic Search for Automated Algorithm Discovery
- 2026What Do Evolutionary Coding Agents Evolve?
- 2025CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization
- 2026EvoMaster: A Foundational Evolving Agent Framework for Agentic Science at Scale
- 2026Deliberate Evolution: Agentic Reasoning for Sample-Efficient Symbolic Regression with LLMs
- 2026OR-Agent: Bridging Evolutionary Search and Structured Research for Automated Heuristic Design
- 2025ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution