Jiaxu Cui
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jiaxu Cui has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Bo Yang
Jilin University
15 shared publications Jiao Hu
Jilin University
3 shared publications- Ximing Li
College of Computer Science and Technology, Jilin University, Changchun, China
3 shared publications - Bing Wang
College of Computer Science and Technology, Jilin University, Changchun, China
2 shared publications - Bingyi Sun
College of Computer Science and Technology, Jilin University, Changchun, China
2 shared publications - Bingyi Sun
Jilin University
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 48 (11) , 14226-14238
SymBOL: A General-Purpose Symbolic Learner for Scientific Discovery Using Bayesian Optimization-Enhanced Large Language Models
Symbolic Regression (SR) is a core challenge in both physics and artificial intelligence, aiming to identify mathematical equations from experimental data. Recent impressive advancements in Large Language Model (LLM)-based SR methods have addressed the limitations of traditional approaches in flexibly incorporating prior knowledge to enhance accuracy, but they still face challenges such as high costs and scalability with numerous variables. To overcome these issues, we introduce SymBOL. This general-purpose symbolic learning framework uses Bayesian Optimization (BO) to guide the generation of high-quality mathematical expressions from the LLM while accommodating complex tasks with a large number of interdependent variables. Experiments on benchmark datasets demonstrate that SymBOL significantly outperforms baseline methods in both accuracy and efficiency. Notably, compared to advanced LLM-based approaches, SymBOL achieves a 24.85% improvement in average accuracy while reducing computational costs by 28.73%. This advantage extends to high-dimensional SR tasks, where SymBOL substantially lowers the average error. Furthermore, when applied to real-world systems in materials science and epidemiology, SymBOL accurately recovers governing equations and provides interpretable pathways for equation discovery. These findings underscore the potential of SymBOL for advancing scientific discovery.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 48 (11) , 14226-14238
SymBOL: A General-Purpose Symbolic Learner for Scientific Discovery Using Bayesian Optimization-Enhanced Large Language Models
Symbolic Regression (SR) is a core challenge in both physics and artificial intelligence, aiming to identify mathematical equations from experimental data. Recent impressive advancements in Large Language Model (LLM)-based SR methods have addressed the limitations of traditional approaches in flexibly incorporating prior knowledge to enhance accuracy, but they still face challenges such as high costs and scalability with numerous variables. To overcome these issues, we introduce SymBOL. This general-purpose symbolic learning framework uses Bayesian Optimization (BO) to guide the generation of high-quality mathematical expressions from the LLM while accommodating complex tasks with a large number of interdependent variables. Experiments on benchmark datasets demonstrate that SymBOL significantly outperforms baseline methods in both accuracy and efficiency. Notably, compared to advanced LLM-based approaches, SymBOL achieves a 24.85% improvement in average accuracy while reducing computational costs by 28.73%. This advantage extends to high-dimensional SR tasks, where SymBOL substantially lowers the average error. Furthermore, when applied to real-world systems in materials science and epidemiology, SymBOL accurately recovers governing equations and provides interpretable pathways for equation discovery. These findings underscore the potential of SymBOL for advancing scientific discovery.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 614-625
LEDA: Latent Semantic Distribution Alignment for Multi-domain Graph Pre-training
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 614-625
Open AccessLEDA: Latent Semantic Distribution Alignment for Multi-domain Graph Pre-training
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35, 10404-10416
Adaptive Hypergraph-Induced Dual-Structure Tensor Embedding for Multi-View Image Representation Learning
Multi-View Multi-Label Learning is pivotal for visual content understanding yet faces two fundamental bottle-necks: (i) Structural Decoupling, where prevalent matrix flattening severs intrinsic high-order correlations between visual features and semantic concepts; and (ii) Semantic Uniformity Bias, where the neglect of label topology heterogeneity leads to overfitting on ambiguous annotations. To address these, we propose the Adaptive HypergrAph-Induced Dual-Structure Tensor Embedding (AHATE) framework. Drawing conceptual inspiration from tensor spectral graph theory, we introduce a novel Dual-Structure Tensor Nuclear Norm (DS-TNN). Unlike loose additive regularization, this mechanism functions as a high-order spectral filter in the Fourier domain, explicitly coupling feature manifolds with label topology to rigorously enforce consensus while suppressing structural noise. Furthermore, grounded in network centrality theory, we design an Adaptive Hypergraph-Weighted Loss. By leveraging PageRank to quantify topological importance, this strategy prioritizes high-confidence structural anchors over ambiguous instances. Finally, a joint sparse projection mechanism is incorporated to eliminate redundancy. Extensive experiments demonstrate that AHATE achieves statistically significant superiority. Specifically, compared to the second-best methods, it improves Average Precision by up to 5.52% and reduces Hamming Loss by up to 4.40%, while achieving the lowest Hamming Loss of 0.0137 on Corel5k. The full source code, including preprocessing and configuration scripts, is available at https://github.com/hpinty/AHATE.git.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35, 10404-10416
Adaptive Hypergraph-Induced Dual-Structure Tensor Embedding for Multi-View Image Representation Learning
Multi-View Multi-Label Learning is pivotal for visual content understanding yet faces two fundamental bottle-necks: (i) Structural Decoupling, where prevalent matrix flattening severs intrinsic high-order correlations between visual features and semantic concepts; and (ii) Semantic Uniformity Bias, where the neglect of label topology heterogeneity leads to overfitting on ambiguous annotations. To address these, we propose the Adaptive HypergrAph-Induced Dual-Structure Tensor Embedding (AHATE) framework. Drawing conceptual inspiration from tensor spectral graph theory, we introduce a novel Dual-Structure Tensor Nuclear Norm (DS-TNN). Unlike loose additive regularization, this mechanism functions as a high-order spectral filter in the Fourier domain, explicitly coupling feature manifolds with label topology to rigorously enforce consensus while suppressing structural noise. Furthermore, grounded in network centrality theory, we design an Adaptive Hypergraph-Weighted Loss. By leveraging PageRank to quantify topological importance, this strategy prioritizes high-confidence structural anchors over ambiguous instances. Finally, a joint sparse projection mechanism is incorporated to eliminate redundancy. Extensive experiments demonstrate that AHATE achieves statistically significant superiority. Specifically, compared to the second-best methods, it improves Average Precision by up to 5.52% and reduces Hamming Loss by up to 4.40%, while achieving the lowest Hamming Loss of 0.0137 on Corel5k. The full source code, including preprocessing and configuration scripts, is available at https://github.com/hpinty/AHATE.git.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2945-2955
Variety Is the Spice of Life: Detecting Misinformation with Dynamic Environmental Representations
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2945-2955
Open AccessVariety Is the Spice of Life: Detecting Misinformation with Dynamic Environmental Representations
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 9, 7867-7875
scSiameseClu: A Siamese Clustering Framework for Interpreting Single-cell RNA Sequencing Data
Single-cell RNA sequencing (scRNA-seq) reveals cell heterogeneity, with cell clustering playing a key role in identifying cell types and marker genes. Recent advances, especially graph neural networks (GNNs)-based methods, have significantly improved clustering performance. However, the analysis of scRNA-seq data remains challenging due to noise, sparsity, and high dimensionality. Compounding these challenges, GNNs often suffer from over-smoothing, limiting their ability to capture complex biological information. In response, we propose scSiameseClu, a novel Siamese Clustering framework for interpreting single-cell RNA-seq data, comprising of 3 key steps: (1) Dual Augmentation Module, which applies biologically informed perturbations to the gene expression matrix and cell graph relationships to enhance representation robustness; (2) Siamese Fusion Module, which combines cross-correlation refinement and adaptive information fusion to capture complex cellular relationships while mitigating over-smoothing; and (3) Optimal Transport Clustering, which utilizes Sinkhorn distance to efficiently align cluster assignments with predefined proportions while maintaining balance. Comprehensive evaluations on seven real-world datasets demonstrate that scSiameseClu outperforms state-of-the-art methods in single-cell clustering, cell type annotation, and cell type classification, providing a powerful tool for scRNA-seq data interpretation.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 9, 7867-7875
Open AccessscSiameseClu: A Siamese Clustering Framework for Interpreting Single-cell RNA Sequencing Data
Single-cell RNA sequencing (scRNA-seq) reveals cell heterogeneity, with cell clustering playing a key role in identifying cell types and marker genes. Recent advances, especially graph neural networks (GNNs)-based methods, have significantly improved clustering performance. However, the analysis of scRNA-seq data remains challenging due to noise, sparsity, and high dimensionality. Compounding these challenges, GNNs often suffer from over-smoothing, limiting their ability to capture complex biological information. In response, we propose scSiameseClu, a novel Siamese Clustering framework for interpreting single-cell RNA-seq data, comprising of 3 key steps: (1) Dual Augmentation Module, which applies biologically informed perturbations to the gene expression matrix and cell graph relationships to enhance representation robustness; (2) Siamese Fusion Module, which combines cross-correlation refinement and adaptive information fusion to capture complex cellular relationships while mitigating over-smoothing; and (3) Optimal Transport Clustering, which utilizes Sinkhorn distance to efficiently align cluster assignments with predefined proportions while maintaining balance. Comprehensive evaluations on seven real-world datasets demonstrate that scSiameseClu outperforms state-of-the-art methods in single-cell clustering, cell type annotation, and cell type classification, providing a powerful tool for scRNA-seq data interpretation.
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 9, 7563-7571
Towards Generalizable Neural Simulators: Addressing Distribution Shifts Induced by Environmental and Temporal Variations
With advancements in deep learning, neural simulators have become increasingly important for improving the efficiency and effectiveness of simulating complex dynamical systems in various scientific and technological fields. This paper presents a novel neural simulator called Context-informed Polymorphic Neural ODE Processes (CoPoNDP), aimed at addressing the challenges of modeling dynamical systems encountering concurrent environmental and temporal distribution shifts, which are common in real-world scenarios. CoPoNDP employs a context-driven neural stochastic process governed by a combination of basic differential equations in a time-sensitive manner to adaptively modulate the evolution of system states. This allows for flexible adaptation to changing temporal dynamics and generalization across different environments. Extensive experiments conducted on dynamical systems from ecology, chemistry, physics, and energy demonstrate that by effectively utilizing contextual information, CoPoNDP outperforms the state-of-the-art models in handling joint distribution shifts. It also shows robustness in sparse and noisy settings, making it a promising approach for modeling dynamical systems in complex real-world applications.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 9, 7563-7571
Open AccessTowards Generalizable Neural Simulators: Addressing Distribution Shifts Induced by Environmental and Temporal Variations
With advancements in deep learning, neural simulators have become increasingly important for improving the efficiency and effectiveness of simulating complex dynamical systems in various scientific and technological fields. This paper presents a novel neural simulator called Context-informed Polymorphic Neural ODE Processes (CoPoNDP), aimed at addressing the challenges of modeling dynamical systems encountering concurrent environmental and temporal distribution shifts, which are common in real-world scenarios. CoPoNDP employs a context-driven neural stochastic process governed by a combination of basic differential equations in a time-sensitive manner to adaptively modulate the evolution of system states. This allows for flexible adaptation to changing temporal dynamics and generalization across different environments. Extensive experiments conducted on dynamical systems from ecology, chemistry, physics, and energy demonstrate that by effectively utilizing contextual information, CoPoNDP outperforms the state-of-the-art models in handling joint distribution shifts. It also shows robustness in sparse and noisy settings, making it a promising approach for modeling dynamical systems in complex real-world applications.
- Open Access
Variety Is the Spice of Life: Detecting Misinformation with Dynamic Environmental Representations
The proliferation of misinformation across diverse social media platforms has drawn significant attention from both academic and industrial communities due to its detrimental effects. Accordingly, automatically distinguishing misinformation, dubbed as Misinformation Detection (MD), has become an increasingly active research topic. The mainstream methods formulate MD as a static learning paradigm, which learns the mapping between the content, links, and propagation of news articles and the corresponding manual veracity labels. However, the static assumption is often violated, since in real-world scenarios, the veracity of news articles may vacillate within the dynamically evolving social environment. To tackle this problem, we propose a novel framework, namely Misinformation detection with Dynamic Environmental Representations (MISDER). The basic idea of MISDER lies in learning a social environmental representation for each period and employing a temporal model to predict the representation for future periods. In this work, we specify the temporal model as the LSTM model, continuous dynamics equation, and pre-trained dynamics system, suggesting three variants of MISDER, namely MISDER-LSTM, MISDER-ODE, and MISDER-PT, respectively. To evaluate the performance of MISDER, we compare it to various MD baselines across 2 prevalent datasets, and the experimental results can indicate the effectiveness of our proposed model.
Open AccessVariety Is the Spice of Life: Detecting Misinformation with Dynamic Environmental Representations
The proliferation of misinformation across diverse social media platforms has drawn significant attention from both academic and industrial communities due to its detrimental effects. Accordingly, automatically distinguishing misinformation, dubbed as Misinformation Detection (MD), has become an increasingly active research topic. The mainstream methods formulate MD as a static learning paradigm, which learns the mapping between the content, links, and propagation of news articles and the corresponding manual veracity labels. However, the static assumption is often violated, since in real-world scenarios, the veracity of news articles may vacillate within the dynamically evolving social environment. To tackle this problem, we propose a novel framework, namely Misinformation detection with Dynamic Environmental Representations (MISDER). The basic idea of MISDER lies in learning a social environmental representation for each period and employing a temporal model to predict the representation for future periods. In this work, we specify the temporal model as the LSTM model, continuous dynamics equation, and pre-trained dynamics system, suggesting three variants of MISDER, namely MISDER-LSTM, MISDER-ODE, and MISDER-PT, respectively. To evaluate the performance of MISDER, we compare it to various MD baselines across 2 prevalent datasets, and the experimental results can indicate the effectiveness of our proposed model.
- Open Access
- 6 July 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-13
Learning interpretable network dynamics via universal neural symbolic regression
Discovering governing equations of complex network dynamics is a fundamental challenge in contemporary science with rich data, which can uncover the hidden patterns and mechanisms of the formation and evolution of complex phenomena in various fields and assist in decision-making. In this work, we develop a universal computational tool that can automatically, efficiently, and accurately learn the symbolic patterns of changes in complex system states by combining the excellent fitting capability of deep learning with the equation inference ability of pre-trained symbolic regression. We perform extensive and intensive experimental verifications on more than ten representative scenarios from fields such as physics, biochemistry, ecology, and epidemiology. The results demonstrate the remarkable effectiveness and efficiency of our tool compared to state-of-the-art symbolic regression techniques for network dynamics. The application to real-world systems including global epidemic transmission and pedestrian movements has verified its practical applicability. We believe that our tool can serve as a universal solution to dispel the fog of hidden mechanisms of changes in complex phenomena, advance toward interpretability, and inspire further scientific discoveries.
- 6 July 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-13
Open AccessLearning interpretable network dynamics via universal neural symbolic regression
Discovering governing equations of complex network dynamics is a fundamental challenge in contemporary science with rich data, which can uncover the hidden patterns and mechanisms of the formation and evolution of complex phenomena in various fields and assist in decision-making. In this work, we develop a universal computational tool that can automatically, efficiently, and accurately learn the symbolic patterns of changes in complex system states by combining the excellent fitting capability of deep learning with the equation inference ability of pre-trained symbolic regression. We perform extensive and intensive experimental verifications on more than ten representative scenarios from fields such as physics, biochemistry, ecology, and epidemiology. The results demonstrate the remarkable effectiveness and efficiency of our tool compared to state-of-the-art symbolic regression techniques for network dynamics. The application to real-world systems including global epidemic transmission and pedestrian movements has verified its practical applicability. We believe that our tool can serve as a universal solution to dispel the fog of hidden mechanisms of changes in complex phenomena, advance toward interpretability, and inspire further scientific discoveries.
- Open Access
Symbolic Foundation Regressor on Complex Networks
In science, we are interested not only in forecasting but also in understanding how predictions are made, specifically what the interpretable underlying model looks like. Data-driven machine learning technology can significantly streamline the complex and time-consuming traditional manual process of discovering scientific laws, helping us gain insights into fundamental issues in modern science. In this work, we introduce a pre-trained symbolic foundation regressor that can effectively compress complex data with numerous interacting variables while producing interpretable physical representations. Our model has been rigorously tested on non-network symbolic regression, symbolic regression on complex networks, and the inference of network dynamics across various domains, including physics, biochemistry, ecology, and epidemiology. The results indicate a remarkable improvement in equation inference efficiency, being three times more effective than baseline approaches while maintaining accurate predictions. Furthermore, we apply our model to uncover more intuitive laws of interaction transmission from global epidemic outbreak data, achieving optimal data fitting. This model extends the application boundary of pre-trained symbolic regression models to complex networks, and we believe it provides a foundational solution for revealing the hidden mechanisms behind changes in complex phenomena, enhancing interpretability, and inspiring further scientific discoveries.
Open AccessSymbolic Foundation Regressor on Complex Networks
In science, we are interested not only in forecasting but also in understanding how predictions are made, specifically what the interpretable underlying model looks like. Data-driven machine learning technology can significantly streamline the complex and time-consuming traditional manual process of discovering scientific laws, helping us gain insights into fundamental issues in modern science. In this work, we introduce a pre-trained symbolic foundation regressor that can effectively compress complex data with numerous interacting variables while producing interpretable physical representations. Our model has been rigorously tested on non-network symbolic regression, symbolic regression on complex networks, and the inference of network dynamics across various domains, including physics, biochemistry, ecology, and epidemiology. The results indicate a remarkable improvement in equation inference efficiency, being three times more effective than baseline approaches while maintaining accurate predictions. Furthermore, we apply our model to uncover more intuitive laws of interaction transmission from global epidemic outbreak data, achieving optimal data fitting. This model extends the application boundary of pre-trained symbolic regression models to complex networks, and we believe it provides a foundational solution for revealing the hidden mechanisms behind changes in complex phenomena, enhancing interpretability, and inspiring further scientific discoveries.
- Open Access
- 29 January 2025
- Published by Springer Nature in Research Square
Learning Interpretable Network Dynamics via Universal Neural Symbolic Regression
Discovering governing equations of complex network dynamics is a fundamental challenge in contemporary science with rich data, which can uncover the hidden patterns and mechanisms of the formation and evolution of complex phenomena in various fields and assist in decision-making. In this work, we develop a universal computational tool that can automatically, efficiently, and accurately learn the symbolic patterns of changes in complex system states by combining the excellent fitting capability of deep learning with the equation inference ability of pre-trained symbolic regression. We perform extensive and intensive experimental verifications on more than ten representative scenarios from fields such as physics, biochemistry, ecology, and epidemiology. The results demonstrate the outstanding effectiveness and efficiency of our tool compared to state-of-the-art symbolic regression techniques for network dynamics. The application to real-world systems including global epidemic transmission and pedestrian movements has verified its practical applicability. We believe that our tool can serve as a universal solution to dispel the fog of hidden mechanisms of changes in complex phenomena, advance toward interpretability, and inspire further scientific discoveries.
- 29 January 2025
- Published by Springer Nature in Research Square
Open AccessLearning Interpretable Network Dynamics via Universal Neural Symbolic Regression
Discovering governing equations of complex network dynamics is a fundamental challenge in contemporary science with rich data, which can uncover the hidden patterns and mechanisms of the formation and evolution of complex phenomena in various fields and assist in decision-making. In this work, we develop a universal computational tool that can automatically, efficiently, and accurately learn the symbolic patterns of changes in complex system states by combining the excellent fitting capability of deep learning with the equation inference ability of pre-trained symbolic regression. We perform extensive and intensive experimental verifications on more than ten representative scenarios from fields such as physics, biochemistry, ecology, and epidemiology. The results demonstrate the outstanding effectiveness and efficiency of our tool compared to state-of-the-art symbolic regression techniques for network dynamics. The application to real-world systems including global epidemic transmission and pedestrian movements has verified its practical applicability. We believe that our tool can serve as a universal solution to dispel the fog of hidden mechanisms of changes in complex phenomena, advance toward interpretability, and inspire further scientific discoveries.