Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jianle Sun

dblp:307/2312 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0002-0001-0992ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 61% Knowledge representation and reasoning · 30% Representation and self-supervised learning · 9%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.912025
When Selection Meets Intervention: Additional Complexities in Causal Discovery · ICLR 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › causal reasoning
causal graphical model
0.912025
When Selection Meets Intervention: Additional Complexities in Causal Discovery · ICLR 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
interventional causal discovery
0.912025
When Selection Meets Intervention: Additional Complexities in Causal Discovery · ICLR 2025
Bioinformatics and computational biology › single-cell analysis › single-cell data integration
single-cell multi-omics integration
0.912025
scMRDR: A scalable and flexible framework for unpaired single-cell multi-omics data integration · NeurIPS 2025
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.312025
scMRDR: A scalable and flexible framework for unpaired single-cell multi-omics data integration · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

masked reconstruction · 1.7isometric regularization · 1.7beta-VAE · 1.7adversarial training · 1.7sound algorithm for causal relation identification · 0.9markov property characterization · 0.9graphical model · 0.9
YearPublicationVenuePosition
2025 When Selection Meets Intervention: Additional Complexities in Causal Discovery
abstract
We address the common yet often-overlooked selection bias in interventional studies, where subjects are selectively enrolled into experiments. For instance, participants in a drug trial are usually patients of the relevant disease; A/B tests on mobile applications target existing users only, and gene perturbation studies typically focus on specific cell types, such as cancer cells. Ignoring this bias leads to incorrect causal discovery results. Even when recognized, the existing paradigm for interventional causal discovery still fails to address it. This is because subtle differences in _when_ and _where_ interventions happen can lead to significantly different statistical patterns. We capture this dynamic by introducing a graphical model that explicitly accounts for both the observed world (where interventions are applied) and the counterfactual world (where selection occurs while interventions have not been applied). We characterize the Markov property of the model, and propose a provably sound algorithm to identify causal relations as well as selection mechanisms up to the equivalence class, from data with soft interventions and unknown targets. Through synthetic and real-world experiments, we demonstrate that our algorithm effectively identifies true causal relations despite the presence of selection bias.
Haoyue Dai, Ignavier Ng, Jianle Sun, Zeyu Tang 0002, Gongxu Luo, Xinshuai Dong, Peter Spirtes, Kun Zhang 0001
ICLR3
2025 scMRDR: A scalable and flexible framework for unpaired single-cell multi-omics data integration
abstract
Advances in single-cell sequencing have enabled high-resolution profiling of diverse molecular modalities, while integrating unpaired multi-omics single-cell data remains challenging. Existing approaches either rely on pair information or prior correspondences, or require computing a global pairwise coupling matrix, limiting their scalability and flexibility. In this paper, we introduce a scalable and flexible generative framework called single-cell Multi-omics Regularized Disentangled Representations (scMRDR) for unpaired multi-omics integration. Specifically, we disentangle each cell’s latent representations into modality-shared and modality-specific components using a well-designed $\beta$-VAE architecture, which are augmented with isometric regularization to preserve intra-omics biological heterogeneity, adversarial objective to encourage cross-modal alignment, and masked reconstruction loss strategy to address the issue of missing features across modalities. Our method achieves excellent performance on benchmark datasets in terms of batch correction, modality alignment, and biological signal preservation. Crucially, it scales effectively to large-scale datasets and supports integration of more than two omics, offering a powerful and flexible solution for large-scale multi-omics data integration and downstream biological discovery.
Jianle Sun, Chaoqi Liang, Peng Zheng 0004, Lei Bai 0001, Wanli Ouyang, Hongliang Yan, Peng Ye 0006
NeurIPS1
2022 SMetABF: A rapid algorithm for Bayesian GWAS meta-analysis with a large number of studies included
abstract
Bayesian methods are widely used in the GWAS meta-analysis. But the considerable consumption in both computing time and memory space poses great challenges for large-scale meta-analyses. In this research, we propose an algorithm named SMetABF to rapidly obtain the optimal ABF in the GWAS meta-analysis, where shotgun stochastic search (SSS) is introduced to improve the Bayesian GWAS meta-analysis framework, MetABF. Simulation studies confirm that SMetABF performs well in both speed and accuracy, compared to exhaustive methods and MCMC. SMetABF is applied to real GWAS datasets to find several essential loci related to Parkinson's disease (PD) and the results support the underlying relationship between PD and other autoimmune disorders. Developed as an R package and a web tool, SMetABF will become a useful tool to integrate different studies and identify more variants associated with complex traits.
Jianle Sun, Ruiqi Lyu, Luojia Deng, Qianwen Li
PLoS Comput. Biol.1
2021 GESLM algorithm for detecting causal SNPs in GWAS with multiple phenotypes
abstract
With the development of genome-wide association studies, how to gain information from a large scale of data has become an issue of common concern, since traditional methods are not fully developed to solve problems such as identifying loci-to-loci interactions (also known as epistasis). Previous epistatic studies mainly focused on local information with a single outcome (phenotype), while in this paper, we developed a two-stage global search algorithm, Greedy Equivalence Search with Local Modification (GESLM), to implement a global search of directed acyclic graph in order to identify genome-wide epistatic interactions with multiple outcome variables (phenotypes) in a case-control design. GESLM integrates the advantages of score-based methods and constraint-based methods to learn the phenotype-related Bayesian network and is powerful and robust to find the interaction structures that display both genetic associations with phenotypes and gene interactions. We compared GESLM with some common phenotype-related loci detecting methods in simulation studies. The results showed that our method improved the accuracy and efficiency compared with others, especially in an unbalanced case-control study. Besides, its application on the UK Biobank dataset suggested that our algorithm has great performance when handling genome-wide association data with more than one phenotype.
Ruiqi Lyu, Jianle Sun, Qianxue Jiang, Chaochun Wei
Briefings Bioinform.2