Zhiyuan Ning
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhiyuan Ning has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Pengfei Wang
Chinese Academy of Sciences, Beijing, China
10 shared publications - Yuanchun Zhou
Computer Network Information Center, Chinese Academy of Sciences, China
10 shared publications - Meng Xiao
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China and DUKE-NUS Medical School, National University of Singapore, Singapore, Singapore
8 shared publications - Pengyang Wang
University of Macau
6 shared publications - Yi Du
Computer Network Information Center Chinese Academy of Sciences Beijing China
5 shared publications Yuanchun Zhou
5 shared publications
Latest Publications
- Open Access
- 11 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
Trajectory-Constrained Feature Transformation Optimization Framework for Stable Tabular Data Reprogramming
Tabular data reprogramming is a cornerstone of Data-Centric AI, which seeks to mathematically reconfigure raw features into more expressive and model-efficient representations. This process has traditionally relied on extensive manual engineering. Further, recent automated feature transformation approaches treat each transformation as conditionally independent, preventing the reuse of successful exploration experiences and learning from failures. This myopic view results in redundant evaluations, unstable exploration, and limited generalizability. To address the limitations, we propose the Trajectory-Constrained Transformation Optimization ( TCTO ), a novel data reprogramming framework that reconceptualizes feature transformation as a coordinated planning problem rather than isolated optimization steps. TCTO introduces a cascading multi-agent reinforcement learning (MARL) system that maintains an evolving roadmap where features become nodes and transformations form edges. This framework supports three critical capabilities: (1) trajectory-aware planning with intelligent backtracking from local optima, (2) reuse of previously generated intermediate features, and (3) localized contribution tracking that stabilizes the exploration process. During agent learning, experience replay reuses stored transitions and rewards, avoiding repeated downstream-model evaluations for the sampled experiences. Extensive experiments and case studies across diverse benchmark datasets and tasks demonstrate that TCTO achieves superior performance, stability, and traceability, advancing the DCAI paradigm toward intelligent systems that learn not only from data, but to reprogram data itself. 1
- 11 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
Open AccessTrajectory-Constrained Feature Transformation Optimization Framework for Stable Tabular Data Reprogramming
Tabular data reprogramming is a cornerstone of Data-Centric AI, which seeks to mathematically reconfigure raw features into more expressive and model-efficient representations. This process has traditionally relied on extensive manual engineering. Further, recent automated feature transformation approaches treat each transformation as conditionally independent, preventing the reuse of successful exploration experiences and learning from failures. This myopic view results in redundant evaluations, unstable exploration, and limited generalizability. To address the limitations, we propose the Trajectory-Constrained Transformation Optimization ( TCTO ), a novel data reprogramming framework that reconceptualizes feature transformation as a coordinated planning problem rather than isolated optimization steps. TCTO introduces a cascading multi-agent reinforcement learning (MARL) system that maintains an evolving roadmap where features become nodes and transformations form edges. This framework supports three critical capabilities: (1) trajectory-aware planning with intelligent backtracking from local optima, (2) reuse of previously generated intermediate features, and (3) localized contribution tracking that stabilizes the exploration process. During agent learning, experience replay reuses stored transitions and rewards, avoiding repeated downstream-model evaluations for the sampled experiences. Extensive experiments and case studies across diverse benchmark datasets and tasks demonstrate that TCTO achieves superior performance, stability, and traceability, advancing the DCAI paradigm toward intelligent systems that learn not only from data, but to reprogram data itself. 1
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 4, 3217-3225
Rethinking Graph Contrastive Learning Through Relative Similarity Preservation
Graph contrastive learning (GCL) has achieved remarkable success by following the computer vision paradigm of preserving absolute similarity between augmented views. However, this approach faces fundamental challenges in graphs due to their discrete, non-Euclidean nature -- view generation often breaks semantic validity and similarity verification becomes unreliable. Through analyzing 11 real-world graphs, we discover a universal pattern transcending the homophily-heterophily dichotomy: label consistency systematically diminishes as structural distance increases, manifesting as smooth decay in homophily graphs and oscillatory decay in heterophily graphs. We establish theoretical guarantees for this pattern through random walk theory, proving label distribution convergence and characterizing the mechanisms behind different decay behaviors. This discovery reveals that graphs naturally encode relative similarity patterns, where structurally closer nodes exhibit collectively stronger semantic relationships. Leveraging this insight, we propose RELGCL, a novel GCL framework with complementary pairwise and listwise implementations that preserve these inherent patterns through collective similarity objectives. Extensive experiments demonstrate that our method consistently outperforms 20 existing approaches across both homophily and heterophily graphs, validating the effectiveness of leveraging natural relative similarity over artificial absolute similarity.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 4, 3217-3225
Open AccessRethinking Graph Contrastive Learning Through Relative Similarity Preservation
Graph contrastive learning (GCL) has achieved remarkable success by following the computer vision paradigm of preserving absolute similarity between augmented views. However, this approach faces fundamental challenges in graphs due to their discrete, non-Euclidean nature -- view generation often breaks semantic validity and similarity verification becomes unreliable. Through analyzing 11 real-world graphs, we discover a universal pattern transcending the homophily-heterophily dichotomy: label consistency systematically diminishes as structural distance increases, manifesting as smooth decay in homophily graphs and oscillatory decay in heterophily graphs. We establish theoretical guarantees for this pattern through random walk theory, proving label distribution convergence and characterizing the mechanisms behind different decay behaviors. This discovery reveals that graphs naturally encode relative similarity patterns, where structurally closer nodes exhibit collectively stronger semantic relationships. Leveraging this insight, we propose RELGCL, a novel GCL framework with complementary pairwise and listwise implementations that preserve these inherent patterns through collective similarity objectives. Extensive experiments demonstrate that our method consistently outperforms 20 existing approaches across both homophily and heterophily graphs, validating the effectiveness of leveraging natural relative similarity over artificial absolute similarity.
- 10 August 2025
- Published by Elsevier in Information Fusion
- Vol. 126
Deep cut-informed graph embedding and clustering
- 10 August 2025
- Published by Elsevier in Information Fusion
- Vol. 126
Deep cut-informed graph embedding and clustering
- Open Access
Soft Graph Clustering for single-cell RNA Sequencing Data
Clustering analysis is fundamental in single-cell RNA sequencing (scRNA-seq) data analysis for elucidating cellular heterogeneity and diversity. Recent graph-based scRNA-seq clustering methods, particularly graph neural networks (GNNs), have significantly improved in tackling the challenges of high-dimension, high-sparsity, and frequent dropout events that lead to ambiguous cell population boundaries. However, their reliance on hard graph constructions derived from thresholded similarity matrices presents challenges:(i) The simplification of intercellular relationships into binary edges (0 or 1) by applying thresholds, which restricts the capture of continuous similarity features among cells and leads to significant information loss.(ii) The presence of significant inter-cluster connections within hard graphs, which can confuse GNN methods that rely heavily on graph structures, potentially causing erroneous message propagation and biased clustering outcomes. To tackle these challenges, we introduce scSGC, a Soft Graph Clustering for single-cell RNA sequencing data, which aims to more accurately characterize continuous similarities among cells through non-binary edge weights, thereby mitigating the limitations of rigid data structures. The scSGC framework comprises three core components: (i) a zero-inflated negative binomial (ZINB)-based feature autoencoder; (ii) a dual-channel cut-informed soft graph embedding module; and (iii) an optimal transport-based clustering optimization module. Extensive experiments across ten datasets demonstrate that scSGC outperforms 13 state-of-the-art clustering models in clustering accuracy, cell type annotation, and computational efficiency. These results highlight its substantial potential to advance scRNA-seq data analysis and deepen our understanding of cellular heterogeneity.
Open AccessSoft Graph Clustering for single-cell RNA Sequencing Data
Clustering analysis is fundamental in single-cell RNA sequencing (scRNA-seq) data analysis for elucidating cellular heterogeneity and diversity. Recent graph-based scRNA-seq clustering methods, particularly graph neural networks (GNNs), have significantly improved in tackling the challenges of high-dimension, high-sparsity, and frequent dropout events that lead to ambiguous cell population boundaries. However, their reliance on hard graph constructions derived from thresholded similarity matrices presents challenges:(i) The simplification of intercellular relationships into binary edges (0 or 1) by applying thresholds, which restricts the capture of continuous similarity features among cells and leads to significant information loss.(ii) The presence of significant inter-cluster connections within hard graphs, which can confuse GNN methods that rely heavily on graph structures, potentially causing erroneous message propagation and biased clustering outcomes. To tackle these challenges, we introduce scSGC, a Soft Graph Clustering for single-cell RNA sequencing data, which aims to more accurately characterize continuous similarities among cells through non-binary edge weights, thereby mitigating the limitations of rigid data structures. The scSGC framework comprises three core components: (i) a zero-inflated negative binomial (ZINB)-based feature autoencoder; (ii) a dual-channel cut-informed soft graph embedding module; and (iii) an optimal transport-based clustering optimization module. Extensive experiments across ten datasets demonstrate that scSGC outperforms 13 state-of-the-art clustering models in clustering accuracy, cell type annotation, and computational efficiency. These results highlight its substantial potential to advance scRNA-seq data analysis and deepen our understanding of cellular heterogeneity.
- Open Access
Rethinking Graph Contrastive Learning through Relative Similarity Preservation
Graph contrastive learning (GCL) has achieved remarkable success by following the computer vision paradigm of preserving absolute similarity between augmented views. However, this approach faces fundamental challenges in graphs due to their discrete, non-Euclidean nature -- view generation often breaks semantic validity and similarity verification becomes unreliable. Through analyzing 11 real-world graphs, we discover a universal pattern transcending the homophily-heterophily dichotomy: label consistency systematically diminishes as structural distance increases, manifesting as smooth decay in homophily graphs and oscillatory decay in heterophily graphs. We establish theoretical guarantees for this pattern through random walk theory, proving label distribution convergence and characterizing the mechanisms behind different decay behaviors. This discovery reveals that graphs naturally encode relative similarity patterns, where structurally closer nodes exhibit collectively stronger semantic relationships. Leveraging this insight, we propose RELGCL, a novel GCL framework with complementary pairwise and listwise implementations that preserve these inherent patterns through collective similarity objectives. Extensive experiments demonstrate that our method consistently outperforms 20 existing approaches across both homophily and heterophily graphs, validating the effectiveness of leveraging natural relative similarity over artificial absolute similarity.
Open AccessRethinking Graph Contrastive Learning through Relative Similarity Preservation
Graph contrastive learning (GCL) has achieved remarkable success by following the computer vision paradigm of preserving absolute similarity between augmented views. However, this approach faces fundamental challenges in graphs due to their discrete, non-Euclidean nature -- view generation often breaks semantic validity and similarity verification becomes unreliable. Through analyzing 11 real-world graphs, we discover a universal pattern transcending the homophily-heterophily dichotomy: label consistency systematically diminishes as structural distance increases, manifesting as smooth decay in homophily graphs and oscillatory decay in heterophily graphs. We establish theoretical guarantees for this pattern through random walk theory, proving label distribution convergence and characterizing the mechanisms behind different decay behaviors. This discovery reveals that graphs naturally encode relative similarity patterns, where structurally closer nodes exhibit collectively stronger semantic relationships. Leveraging this insight, we propose RELGCL, a novel GCL framework with complementary pairwise and listwise implementations that preserve these inherent patterns through collective similarity objectives. Extensive experiments demonstrate that our method consistently outperforms 20 existing approaches across both homophily and heterophily graphs, validating the effectiveness of leveraging natural relative similarity over artificial absolute similarity.
- Open Access
- 14 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (2) , 1-21
Interdisciplinary Fairness in Imbalanced Research Proposal Topic Inference: A Hierarchical Transformer-based Method with Selective Interpolation
The objective of topic inference in research proposals aims to obtain the most suitable disciplinary division from the discipline system defined by a funding agency. The agency will subsequently find appropriate peer-review experts from their database based on this division. Automated topic inference can reduce human errors caused by manual topic filling, bridge the knowledge gap between funding agencies and project applicants, and improve system efficiency. Existing methods focus on modeling this as a hierarchical multi-label classification problem, using generative models to iteratively infer the most appropriate topic information. However, these methods overlook the gap in scale between interdisciplinary research proposals and non-interdisciplinary ones, leading to an unjust phenomenon where the automated inference system categorizes interdisciplinary proposals as non-interdisciplinary, causing unfairness during the expert assignment. How can we address this data imbalance issue under a complex discipline system and hence resolve this unfairness? In this article, we implement a topic label inference system based on a Transformer encoder–decoder architecture. Furthermore, we utilize interpolation techniques to create a series of pseudo-interdisciplinary proposals from non-interdisciplinary ones during training based on non-parametric indicators, such as cross-topic probabilities and topic occurrence probabilities. This approach aims to reduce the bias of the system during model training. Finally, we conduct extensive experiments on a real-world dataset to verify the effectiveness of the proposed method. The experimental results demonstrate that our training strategy can significantly mitigate the unfairness generated in the topic inference task. To improve the reproducibility of our research, we have released accompanying code by Dropbox. 1
- 14 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (2) , 1-21
Open AccessInterdisciplinary Fairness in Imbalanced Research Proposal Topic Inference: A Hierarchical Transformer-based Method with Selective Interpolation
The objective of topic inference in research proposals aims to obtain the most suitable disciplinary division from the discipline system defined by a funding agency. The agency will subsequently find appropriate peer-review experts from their database based on this division. Automated topic inference can reduce human errors caused by manual topic filling, bridge the knowledge gap between funding agencies and project applicants, and improve system efficiency. Existing methods focus on modeling this as a hierarchical multi-label classification problem, using generative models to iteratively infer the most appropriate topic information. However, these methods overlook the gap in scale between interdisciplinary research proposals and non-interdisciplinary ones, leading to an unjust phenomenon where the automated inference system categorizes interdisciplinary proposals as non-interdisciplinary, causing unfairness during the expert assignment. How can we address this data imbalance issue under a complex discipline system and hence resolve this unfairness? In this article, we implement a topic label inference system based on a Transformer encoder–decoder architecture. Furthermore, we utilize interpolation techniques to create a series of pseudo-interdisciplinary proposals from non-interdisciplinary ones during training based on non-parametric indicators, such as cross-topic probabilities and topic occurrence probabilities. This approach aims to reduce the bias of the system during model training. Finally, we conduct extensive experiments on a real-world dataset to verify the effectiveness of the proposed method. The experimental results demonstrate that our training strategy can significantly mitigate the unfairness generated in the topic inference task. To improve the reproducibility of our research, we have released accompanying code by Dropbox. 1
- 2 September 2024
- Published by Springer Nature
- p. 172-187
scCDCG: Efficient Deep Structural Clustering for Single-Cell RNA-Seq via Deep Cut-Informed Graph Embedding
- 2 September 2024
- Published by Springer Nature
- p. 172-187
scCDCG: Efficient Deep Structural Clustering for Single-Cell RNA-Seq via Deep Cut-Informed Graph Embedding
- Open Access
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 6, 4724-4732
Automated Strategy Invention for Confluence of Term Rewrite Systems
Term rewriting plays a crucial role in software verification and compiler optimization. With dozens of highly parameterizable techniques developed to prove various system properties, automatic term rewriting tools work in an extensive parameter space. This complexity exceeds human capacity for parameter selection, motivating an investigation into automated strategy invention. In this paper, we focus on confluence of term rewrite systems, and apply AI techniques to invent strategies for automatic confluence proving. Moreover, we randomly generate a large dataset to analyze confluence for term rewrite systems. We improve the state-of-the-art automatic confluence prover CSI: When equipped with our invented strategies, it surpasses its human-designed strategies both on the augmented dataset and on the original human-created benchmark dataset ARI-COPS, proving/disproving the confluence of several term rewrite systems for which no automated proofs were known before.
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 6, 4724-4732
Open AccessAutomated Strategy Invention for Confluence of Term Rewrite Systems
Term rewriting plays a crucial role in software verification and compiler optimization. With dozens of highly parameterizable techniques developed to prove various system properties, automatic term rewriting tools work in an extensive parameter space. This complexity exceeds human capacity for parameter selection, motivating an investigation into automated strategy invention. In this paper, we focus on confluence of term rewrite systems, and apply AI techniques to invent strategies for automatic confluence proving. Moreover, we randomly generate a large dataset to analyze confluence for term rewrite systems. We improve the state-of-the-art automatic confluence prover CSI: When equipped with our invented strategies, it surpasses its human-designed strategies both on the augmented dataset and on the original human-created benchmark dataset ARI-COPS, proving/disproving the confluence of several term rewrite systems for which no automated proofs were known before.
- Open Access
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 3916-3924
Efficient Algorithms for Electing Successive Committees
In a recently introduced model of successive committee elections, for a given set of ordinal or approval preferences one aims to find a sequence of a given length of “best” same-size committees such that each candidate is a member of a limited number of consecutive committees. However, the practical usability of this model remains limited, as the described task turns out to be NP-hard for most selection criteria already for seeking committees of size three. Non-trivial or somewhat efficient algorithms for these cases are lacking too. Motivated by a desire to unlock the full potential of the described temporal model of committee elections, we devise (parameterized) algorithms that effectively solve the mentioned hard cases in realistic scenarios of a moderate number of candidates or of a limited time horizon.
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 3916-3924
Open AccessEfficient Algorithms for Electing Successive Committees
In a recently introduced model of successive committee elections, for a given set of ordinal or approval preferences one aims to find a sequence of a given length of “best” same-size committees such that each candidate is a member of a limited number of consecutive committees. However, the practical usability of this model remains limited, as the described task turns out to be NP-hard for most selection criteria already for seeking committees of size three. Non-trivial or somewhat efficient algorithms for these cases are lacking too. Motivated by a desire to unlock the full potential of the described temporal model of committee elections, we devise (parameterized) algorithms that effectively solve the mentioned hard cases in realistic scenarios of a moderate number of candidates or of a limited time horizon.
- 1 February 2024
- Published by Elsevier in Artificial Intelligence
- Vol. 329
Temporal inductive path neural network for temporal knowledge graph reasoning
- 1 February 2024
- Published by Elsevier in Artificial Intelligence
- Vol. 329
Temporal inductive path neural network for temporal knowledge graph reasoning