Skip to content
Log in
Book Open access

CEAgent-GSL: Code-level Evolutionary Agent for Interpretable Graph Structure Learning on Omics

Zhongyu Xing Hanwen Luo Maozu Guo Ziwei Zhang Quanming Yao Wei Du Jun Wang Guoxian Yu
Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 12504-12515 · 0 citations · 33 references

TL;DR

This work introduces Evolutionary Rule Abstraction to distill generalized logic from optimization trajectories, overcoming the opacity of traditional evolution, and designs a Counterfactual Validation Module to strictly verify the causal reliability of abstracted rules.

Abstract

Graph Structure Learning (GSL) is fundamental to effective graph-based modeling, particularly for life omics analysis. Traditional heuristics-based GSL methods impose overly rigid inductive biases, while optimization centric GSL suffers from non-convexity and inherent interpretability challenges. Evolutionary algorithms (EAs) have emerged as a promising alternative for their robust global exploration and ability to navigate discrete search spaces without gradient information. However, such stochastic mutations essentially bottleneck evolutionary efficiency. Furthermore, both optimization-based and existing evolutionary paradigms lack semantic guidance, resulting in inexplainable graph structures. Specifically, the topological modifications tend to be arbitrary, failing to reveal the underlying algorithmic logic required for biological insights. To address these problems, we propose CEAgent-GSL, a Code-level Evolutionary LLM Agent framework. CEAgent-GSL treats graph generation as an evolving population of executable scripts, leveraging an LLM for semantic mutation guided by task feedback. Recognizing that omics analysis demands not only high performance but also transparent and verifiable construction principles, we introduce Evolutionary Rule Abstraction to distill generalized logic from optimization trajectories, overcoming the opacity of traditional evolution. Furthermore, to ensure the scientific rigorousness of these discovered principles, we design a Counterfactual Validation Module to strictly verify the causal reliability of abstracted rules. Through this transparent evolutionary paradigm, CEAgent-GSL overcomes the limitations of conventional parametric tuning, and facilitates highly efficient and interpretable GSL, rigorously validated across 11 foundational bioinformatics algorithms on 10 diverse omics datasets. Besides individual task optimization, it can seamlessly integrate domain expertise with task-specific requirements by retrieving and adapting proven logic, thus generating customized rules for novel scenarios.

DOI Semantic Scholar
Read PDF

Similar papers

Preprint Jul 2026

GAE: Graph-Augmented Evolution for Scientific Discovery via Reinforcement Optimization

Evolutionary program search guided by Large Language Models (LLMs) has emerged as a powerful paradigm for automated scientific discovery. However, current approaches are fundamentally constrained by three bottlenecks: structurally blind parent selection, sparse whole-program evaluation rewards, and static mutation operators that fail to adapt during search. We present GAE (Graph-Augmented Evolution), a framework that resolves these limitations through a tightly coupled, three-pillar architecture. First, a relational graph neural network (GNN) parses programs into typed computation graphs, producing structure-aware embeddings. Second, an RL-optimized meta-controller leverages these embeddings to replace blind evolutionary sampling with a directed policy, dynamically selecting optimal parents and mutation directions based on reward history. Third, an online GRPO fine-tuning loop continuously updates the LLM mutation operator at test-time using group-normalized evaluation rewards, directly aligning the model's generation distribution with high-fitness structural edits. We evaluate GAE on a challenging scientific discovery task: symbolic regression for complex nonlinear oscillator systems. By transforming stochastic search into a directed, self-improving trajectory, GAE efficiently discovers closed-form physical equations, consistently matching or outperforming static LLM-driven baselines and achieving state-of-the-art out-of-distribution performance.

Xuanzhou Chen, Taoli Cheng · 0 citations
Preprint Jul 2026

AgentGFM: A Graph Foundation Model with Node-Agent Information-Flow Control

This work proposes AgentGFM, in which all node agents follow a shared end-to-end trainable policy rather than using independent models, and describes this capability as information-flow control, which is inspired by recent advances in agent technology.

Jingbo Cui, Jitao Zhao, Di Jin et al. · 0 citations
Book Open access Aug 2026

UniEdit: A Graph-based MoE Alternative to Sequence Generation for Molecular Editing

This paper proposes UniEdit, a Unified Graph-based Mixture-of-Experts (MoE) Molecular Editing model that offers a robust alternative to LLMs and incorporates a Mixture-of-Experts architecture that dynamically routes tasks to specialized components.

Jiajun Yu, Zhihao Wu, Yizhen Zheng et al. · 0 citations
Preprint Jul 2026

SAGA: Synthetic Agentic Graph Architecture for Temporal Benchmark Generation

SAGA (Synthetic Agentic Graph Architecture), a system for generating large-scale, semantically rich temporal graphs via a four-phase pipeline, achieves structural realism, semantic richness, and automatic anomaly labeling in a unified framework.

Jiacheng Ding, Xiaofei Zhang · 0 citations
Preprint Aug 2026

LLM-Guided Graph Generation for Structure-Based Local Improvement Methods

Large neighborhood search normally selects a random subset of decision variables for iterative optimization. To efficiently solve various problems, researchers tend to design variable selection strategies that take into account structural features across different domains. In this paper, we build an automatic pipeline that is problem-agnostic to all problems in the MiniZinc format. By prompting an LLM with our semantic guidelines, we guide the LLM to produce a graph generator that maps any instance of a problem type to a uniform weighted graph, where nodes represent decision variables and edges represent constraint relationships. These problem-agnostic graphs guide our structure-based local improvement (SLIM) framework for variable selection. Meanwhile, the weighted graph enables all problem instances to share the same generic graph representation, from which the same graph features can be extracted and used for configuration selection. We evaluated our pipeline on instances across 20 MiniZinc competition problems, finding that algorithm selection achieves a 39.6% average problem-weighted win rate against a one-shot Gurobi baseline, more than doubling the best single configuration (19.3%). A post-hoc configuration and a feature ablation indicate a headroom of up to 44.0%, demonstrating that LLM-based semantic generation enables effective automated structure and feature extraction for constraint optimization.

Hai Xia, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider · 0 citations
Preprint Jul 2026

Evolution-Aware MSA Reasoning for Subsampling via Factor Graphs

Experiments show that AP-REASONER outperforms baseline subsamplers on structure-sensitive downstream tasks and enables controllable recovery of alternative protein conformations, highlighting the value of modeling MSA subsampling as a controllable optimization problem, where factor-graph reasoning offers an effective alternative to heuristic selection.

Zhangzhi Xiong, Minzhang Li, Hao Yu et al. · 0 citations