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.
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 oper...
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
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.· Proceedings of the 32nd ACM...· 0 citations
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.
An automatic pipeline that is problem-agnostic to all problems in the MiniZinc format is built, 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%).
Hai Xia, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider· 0 citations
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 a...