24 April 2025 in IEEE Computational Intelligence Magazine
Symbolic Regression (SR) is a powerful technique for uncovering hidden mathematical expressions from observed data and has broad applications in scientific discovery and automatic programming. Genetic Programming (GP) has traditionally been the dominant technique for solving the SR, benefiting from a robust global search capability that enables the discovery of solutions with high fitting accuracy. Whereas, GP suffers from low search efficiency and may not fully exploit the accumulated knowledge to accelerate convergence. Conversely, deep learning-based methods, particularly those employing Transformer backbones, are trained offline on large-scale datasets. These methods exhibit strong generalization capabilities for unseen tasks without additional training. However, the lack of refinement mechanisms for specific tasks renders them inferior to GP methods in accuracy. This study aims to combine the specific problem-solving capabilities of GP with the generalization strengths of pretrained Transformer models. Specifically, we propose a pretrained model guided GP (PGGP) method, which is a GP-based method that incorporates a pretrained Transformer model to enhance SR problem-solving. New initialization and mutation operators are proposed based on the well-structured equation obtained using the pre-trained model. Extensive experiments are conducted, and the results show that our method not only surpasses comparative methods in terms of accuracy but also reduces the complexity of the generated solutions, potentially enhancing interpretability.
13 November 2024 in IEEE Transactions on Artificial Intelligence
Planning the movement of the sink to maximize the lifetime in wireless sensor networks is an essential problem. Many existing mobile sink techniques based on mathematical programming or heuristics have demonstrated the feasibility of the task. Nevertheless, the huge computational cost or the over-reliance on human knowledge can result in relatively low performance. To balance the need for high-quality solutions to minimize inference time, we propose a new framework to construct the movement path of the sink automatically. We cast the lifetime maximization problem as an optimization task within a heterogeneous graph, and learn movement policy for the sink by combining graph neural network with deep reinforcement learning. Our approach comprises three key modules: (1) a heterogeneous graph neural network to learn representations of sites and sensors by aggregating features of neighbor nodes and extracting hierarchical graph features. (2) a multi-head attention mechanism that allows the sites to attend to information from sensor nodes, which highly improves the expressive capacity of the learning model. (3) a greedy policy that learns to append the next best site in the solution incrementally. We design twelve types of static and dynamic maps to simulate different wireless sensor networks in the real world, and extensive experiments are conducted to evaluate and analyze our approach. The empirical results show that our approach consistently outperforms the existing methods on all types of maps. Notably, our approach significantly extends the simulation lifetime without sacrificing a large increase in inference time.
11 July 2026 in Neurocomputing