Yumeng Zhou

dblp:258/3501 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
8since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 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 · 60% Graph learning · 40%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%
Human-computer interaction and pervasive computing
1 paper
Immersive interaction · 77% Design research and methods · 23%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.912025
Differentiable Constraint-Based Causal Discovery · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
constraint-based causal discovery
0.912025
Differentiable Constraint-Based Causal Discovery · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
differentiable causal discovery
0.912025
Differentiable Constraint-Based Causal Discovery · NeurIPS 2025
Machine learning › Graph learning › dynamic graph learning
dynamic link prediction
0.912025
Position-Aware Neighbor Aggregation for Dynamic Link Prediction · KDD (2) 2025
Machine learning › Graph learning › graph neural network › message passing
neighborhood aggregation
0.912025
Position-Aware Neighbor Aggregation for Dynamic Link Prediction · KDD (2) 2025
Computational science and engineering › computational chemistry
quantum chemistry
0.912025
NNQS-SCI: Tackling Trillion-Dimensional Hilbert Space with Adaptive Neural Network Quantum States · SC 2025
High-performance computing › performance optimization at scale
extreme-scale scalability
0.912025
NNQS-SCI: Tackling Trillion-Dimensional Hilbert Space with Adaptive Neural Network Quantum States · SC 2025
Design research and methods
research methodology
0.112021
Remote VR Studies: A Framework for Running Virtual Reality Studies Remotely Via Participant-Owned HMDs · ACM Trans. Comput. Hum. Interact. 2021

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

variational monte carlo · 1.7slater-condon rules · 1.7multi-level parallelism · 1.7memory compression · 1.7soft logic · 0.9position-aware aggregation · 0.9percolation theory · 0.9graph neural network · 0.9gradient-based optimization · 0.9d-separation · 0.9online survey · 0.5case study · 0.5
YearPublicationVenuePosition
2025 Position-Aware Neighbor Aggregation for Dynamic Link Prediction
Yumeng Zhou, Mingzhe Liu 0002, Leilei Sun, Yifei Huang 0003, Liangzhe Han, Chuanren Liu, Tongyu Zhu
KDD (2)1
2025 Differentiable Constraint-Based Causal Discovery
abstract
Causal discovery from observational data is a fundamental task in artificial intelligence, with far-reaching implications for decision-making, predictions, and interventions. Despite significant advances, existing methods can be broadly categorized as constraint-based or score-based approaches. Constraint-based methods offer rigorous causal discovery but are often hindered by small sample sizes, while score-based methods provide flexible optimization but typically forgo explicit conditional independence testing. This work explores a third avenue: developing differentiable $d$-separation scores, obtained through a percolation theory using soft logic. This enables the implementation of a new type of causal discovery method: gradient-based optimization of conditional independence constraints. Empirical evaluations demonstrate the robust performance of our approach in low-sample regimes, surpassing traditional constraint-based and score-based baselines on a real-world dataset. Code implementing the proposed method is publicly available at [https://github.com/PurdueMINDS/DAGPA](https://github.com/PurdueMINDS/DAGPA).
Jincheng Zhou, Mengbo Wang 0001, Anqi He, Yumeng Zhou, Hessam Olya, Murat Kocaoglu, Bruno Ribeiro 0001
NeurIPS4
2025 NNQS-SCI: Tackling Trillion-Dimensional Hilbert Space with Adaptive Neural Network Quantum States
abstract
Neural Network Quantum States (NNQS) offer a powerful variational Monte Carlo (VMC) approach for quantum many-body problems, balancing polynomial scaling with high expressive power. However, scaling NNQS to large chemical systems faces challenges in preserving accuracy with exact energy and managing vast configurations efficiently. In this work, we introduce NNQS-SCI, a high-performance Selected Configuration Interaction (SCI) based NNQS method designed to overcome these limitations. NNQS-SCI employs highly parallelized Slater-Condon rules for fast local energy evaluations, avoiding accuracy loss, while its adaptive SCI engine dynamically manages billions of configurations without space explosion or arbitrary cutoffs that plague other NNQS-CI approaches. Optimized for extreme scalability via multi-level parallelism and memory compression, NNQS-SCI successfully simulates systems up to 152 spin orbitals, tackling Hilbert space dimensions exceeding 1014 and demonstrating significant advances in scale and efficiency. NNQS-SCI thus provides a robust and scalable path towards high-accuracy quantum chemistry on high-performance computing platforms.
Bowen Kan, Yumeng Zhou, Daiyou Xie, Yunquan Zhang, Honghui Shang
SC2
2025 Mural image restoration with spatial geometric perception and progressive context refinement
Yumeng Zhou, Miao Ma
Comput. Graph.1
2023 RMDGCN: Prediction of RNA methylation and disease associations based on graph convolutional network with attention mechanism
abstract
RNA modification is a post transcriptional modification that occurs in all organisms and plays a crucial role in the stages of RNA life, closely related to many life processes. As one of the newly discovered modifications, N1-methyladenosine (m1A) plays an important role in gene expression regulation, closely related to the occurrence and development of diseases. However, due to the low abundance of m1A, verifying the associations between m1As and diseases through wet experiments requires a great quantity of manpower and resources. In this study, we proposed a computational method for predicting the associations of RNA methylation and disease based on graph convolutional network (RMDGCN) with attention mechanism. We build an adjacency matrix through the collected m1As and diseases associations, and use positive-unlabeled learning to increase the number of positive samples. By extracting the features of m1As and diseases, a heterogeneous network is constructed, and a GCN with attention mechanism is adopted to predict the associations between m1As and diseases. The experimental results indicate that under a 5-fold cross validation, RMDGCN is superior to other methods (AUC = 0.9892 and AUPR = 0.8682). In addition, case studies indicate that RMDGCN can predict the relationships between unknown m1As and diseases. In summary, RMDGCN is an effective method for predicting the associations between m1As and diseases.
Yumeng Zhou, Xiujuan Lei
PLoS Comput. Biol.2
2021 Self Separation and Misseparation Impact Minimization for Open-Set Domain Adaptation
Yuntao Du 0001, Yikang Cao, Yumeng Zhou, Ruiting Zhang, Chong-Jun Wang
DASFAA (2)3
2021 When Friends Become Strangers: Understanding the Influence of Avatar Gender on Interpersonal Distance in Virtual Reality
Radiah Rivu, Yumeng Zhou, Robin Welsch, Ville Mäkelä, Florian Alt
INTERACT (5)2
2021 Remote VR Studies: A Framework for Running Virtual Reality Studies Remotely Via Participant-Owned HMDs
abstract
We investigate opportunities and challenges of running virtual reality (VR) studies remotely. Today, many consumers own head-mounted displays (HMDs), allowing them to participate in scientific studies from their homes using their own equipment. Researchers can benefit from this approach by being able to recruit study populations normally out of their reach, and to conduct research at times when it is difficult to get people into the lab (cf. the COVID pandemic). In an initial online survey ( N = 227), we assessed HMD owners’ demographics, their VR setups and their attitudes toward remote participation. We then identified different approaches to running remote studies and conducted two case studies for an in-depth understanding. We synthesize our findings into a framework for remote VR studies, discuss strengths and weaknesses of the different approaches, and derive best practices. Our work is valuable for Human-Computer Interaction (HCI) researchers conducting VR studies outside labs.
Radiah Rivu, Ville Mäkelä, Sarah Prange, Sarah Delgado Rodriguez, Robin Piening, Yumeng Zhou, Kay Köhle, Ken Pfeuffer, Yomna Abdelrahman, Matthias Hoppe 0001, Albrecht Schmidt 0001, Florian Alt
ACM Trans. Comput. Hum. Interact.6