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

Yangjun Wu

dblp:304/5895 · DBLP profile ↗
← Back
10ranked-venue papers
5as first author
10since 2021 · last 2025
—ORCID · conflict

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

Systems, architecture and hardware · 7 · 3 first-author · 7 since 2021Artificial intelligence and machine learning · 3 · 2 first-author · 3 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.

Computer architecture, parallel and distributed computing, and storage systems
7 papers
High-performance computing · 57% Emerging computing paradigms · 30% Parallel and multicore computing · 12%
Artificial intelligence
2 papers
Language models and text generation · 34% Planning, search and constraint satisfaction · 29% Multi-agent systems · 29%
Interdisciplinary, comprehensive, and emerging computing
4 papers
Computational science and engineering · 100%
Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

Topics — the 19 heaviest of 24, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
scientific computing systems
2.342023
Portable and Scalable All-Electron Quantum Perturbation Simulations on Exascale Supercomputers · SC 2023
NNQS-Transformer: an Efficient and Scalable Neural Network Quantum States Approach for Ab initio Quantum Chemistry · SC 2023
Extreme-scale ab initio quantum raman spectra simulations on the leadership HPC system in China · SC 2021
Emerging computing paradigms › quantum computing
neural network quantum states
1.522025
Fast and Scalable Neural Network Quantum States Method for Molecular Potential Energy Surfaces · IEEE Trans. Parallel Distributed Syst. 2025
NNQS-Transformer: an Efficient and Scalable Neural Network Quantum States Approach for Ab initio Quantum Chemistry · SC 2023
Emerging computing paradigms
quantum computing
1.522025
Fast and Scalable Neural Network Quantum States Method for Molecular Potential Energy Surfaces · IEEE Trans. Parallel Distributed Syst. 2025
NNQS-Transformer: an Efficient and Scalable Neural Network Quantum States Approach for Ab initio Quantum Chemistry · SC 2023
High-performance computing
performance optimization at scale
1.022021
Extreme-scale ab initio quantum raman spectra simulations on the leadership HPC system in China · SC 2021
Accelerating all-electron ab initio simulation of raman spectra for biological systems · SC 2021
High-performance computing
quantum mechanical simulation
1.022021
Extreme-scale ab initio quantum raman spectra simulations on the leadership HPC system in China · SC 2021
Accelerating all-electron ab initio simulation of raman spectra for biological systems · SC 2021
Parallel and multicore computing › parallel computing › parallel machine learning
parallel training
0.912025
Fast and Scalable Neural Network Quantum States Method for Molecular Potential Energy Surfaces · IEEE Trans. Parallel Distributed Syst. 2025
High-performance computing
supercomputing
0.912025
Large-Scale Neural Network Quantum States Calculation for Quantum Chemistry on a New Sunway Supercomputer · IEEE Trans. Parallel Distributed Syst. 2025
Natural language and speech › Language models and text generation
token masking
0.712023
TLM: Token-Level Masking for Transformers · EMNLP 2023
Emerging computing paradigms › quantum computing › quantum simulation
quantum many-body simulation
0.712023
NNQS-Transformer: an Efficient and Scalable Neural Network Quantum States Approach for Ab initio Quantum Chemistry · SC 2023
High-performance computing › numerical linear algebra › linear solver
poisson solver
0.612022
Scaling Poisson Solvers on Many Cores via MMEwald · IEEE Trans. Parallel Distributed Syst. 2022
Parallel and multicore computing › parallel algorithms › parallel algorithm design
scalable parallel algorithms
0.612022
Scaling Poisson Solvers on Many Cores via MMEwald · IEEE Trans. Parallel Distributed Syst. 2022
High-performance computing
scientific computing
0.612022
Scaling Poisson Solvers on Many Cores via MMEwald · IEEE Trans. Parallel Distributed Syst. 2022
Computational science and engineering › computational chemistry
molecular simulation
0.322021
Extreme-scale ab initio quantum raman spectra simulations on the leadership HPC system in China · SC 2021
Accelerating all-electron ab initio simulation of raman spectra for biological systems · SC 2021
Computational science and engineering › computational chemistry
quantum chemistry
0.312025
Large-Scale Neural Network Quantum States Calculation for Quantum Chemistry on a New Sunway Supercomputer · IEEE Trans. Parallel Distributed Syst. 2025
High-performance computing › scientific computing systems
quantum chemistry simulation
0.312025
Fast and Scalable Neural Network Quantum States Method for Molecular Potential Energy Surfaces · IEEE Trans. Parallel Distributed Syst. 2025
Natural language and speech › Language models and text generation
mathematical reasoning
0.212024
Chain-of-Experts: When LLMs Meet Complex Operations Research Problems · ICLR 2024
Machine learning › Deep learning architectures and training › regularization
attention regularization
0.212023
TLM: Token-Level Masking for Transformers · EMNLP 2023
High-performance computing › supercomputing
exascale computing
0.212023
Portable and Scalable All-Electron Quantum Perturbation Simulations on Exascale Supercomputers · SC 2023
Hardware accelerators and domain-specific architectures
many-core accelerator
0.212022
Scaling Poisson Solvers on Many Cores via MMEwald · IEEE Trans. Parallel Distributed Syst. 2022

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

neural network quantum states · 2.6many-core architecture optimization · 2.0transformer · 1.5task mapping · 1.3hierarchical collective communication · 1.3OpenCL · 1.3mixed precision training · 0.9KV-cache sharing · 0.9large language model · 0.8forward thought construction · 0.8backward reflection · 0.8variational monte carlo · 0.7parallel batch sampling · 0.7drophead · 0.7attention dropout · 0.7mixed-precision computing · 0.5
YearPublicationVenuePosition
2025 Fast and Scalable Neural Network Quantum States Method for Molecular Potential Energy Surfaces
abstract
The Neural Network Quantum States (NNQS) method is highly promising for accurately solving the Schrödinger equation, yet it encounters challenges such as computational demands and slow rates of convergence. To address the high computational requirements, we introduce optimizations including a cross-sample KV cache sharing technique to enhance sampling efficiency, Quantum Bitwise and BloomHash methods for more efficient local energy computation, and mixed-precision training strategies to boost computational efficiency. To overcome the issue of slow convergence, we propose a parallel training algorithm for NNQS under second quantization to accelerate the training of base models for molecular potential surfaces. Our approach achieves up to 27-fold acceleration specifically in local energy calculations in systems with 154 spin orbitals and demonstrates strong and weak scaling efficiencies of 98% and 97%, respectively, on the H$_{2}$O$_{2}$potential surface training set. The parallelized implementation of transformer-based NNQS is highly portable on various high-performance computing architectures, offering new perspectives on quantum chemistry simulations.
Yangjun Wu, Wanlu Cao, Honghui Shang
IEEE Trans. Parallel Distributed Syst.1
2025 Large-Scale Neural Network Quantum States Calculation for Quantum Chemistry on a New Sunway Supercomputer
Yangjun Wu, Li Shen 0001, Hong Qian, Honghui Shang
IEEE Trans. Parallel Distributed Syst.1
2024 Chain-of-Experts: When LLMs Meet Complex Operations Research Problems
abstract
Large language models (LLMs) have emerged as powerful techniques for various NLP tasks, such as mathematical reasoning and plan generation. In this paper, we study automatic modeling and programming for complex operation research (OR) problems, so as to alleviate the heavy dependence on domain experts and benefit a spectrum of industry sectors. We present the first LLM-based solution, namely Chain-of-Experts (CoE), a novel multi-agent cooperative framework to enhance reasoning capabilities. Specifically, each agent is assigned a specific role and endowed with domain knowledge related to OR. We also introduce a conductor to orchestrate these agents via forward thought construction and backward reflection mechanism. Furthermore, we release a benchmark dataset (ComplexOR) of complex OR problems to facilitate OR research and community development. Experimental results show that CoE significantly outperforms the state-of-the-art LLM-based approaches both on LPWP and ComplexOR.
Ziyang Xiao, Dongxiang Zhang, Yangjun Wu, Lilin Xu, Yuan Jessica Wang, Xiongwei Han, Xiaojin Fu, Tao Zhong 0004, Mingli Song, Gang Chen 0001
ICLR3
2023 TLM: Token-Level Masking for Transformers
abstract
Structured dropout approaches, such as attention dropout and DropHead, have been investigated to regularize the multi-head attention mechanism in Transformers.In this paper, we propose a new regularization scheme based on token-level rather than structure-level to reduce overfitting.Specifically, we devise a novel Token-Level Masking (TLM) training strategy for Transformers to regularize the connections of self-attention, which consists of two masking techniques that are effective and easy to implement.The underlying idea is to manipulate the connections between tokens in the multi-head attention via masking, where the networks are forced to exploit partial neighbors' information to produce a meaningful representation.The generality and effectiveness of TLM are thoroughly evaluated via extensive experiments on 4 diversified NLP tasks across 18 datasets, including natural language understanding benchmark GLUE, ChineseGLUE, Chinese Grammatical Error Correction, and data-to-text generation.The results indicate that TLM can consistently outperform attention dropout and DropHead, e.g., it increases by 0.5 points relative to DropHead with BERT-large on GLUE.Moreover, TLM can establish a new record on the data-to-text benchmark Rotowire (18.93 BLEU).Our code will be publicly available at https://github.com/Young1993/tlm.
Yangjun Wu, Kebin Fang, Dongxiang Zhang, Hao Zhang 0029, Gang Chen 0001
EMNLP1
2023 NNQS-Transformer: an Efficient and Scalable Neural Network Quantum States Approach for Ab initio Quantum Chemistry
abstract
Neural network quantum state (NNQS) has emerged as a promising candidate for quantum many-body problems, but its practical applications are often hindered by the high cost of sampling and local energy calculation. We develop a high-performance NNQS method for ab initio electronic structure calculations. The major innovations include: (1) A transformer based architecture as the quantum wave function ansatz; (2) A data-centric parallelization scheme for the variational Monte Carlo (VMC) algorithm which preserves data locality and well adapts for different computing architectures; (3) A parallel batch sampling strategy which reduces the sampling cost and achieves good load balance; (4) A parallel local energy evaluation scheme which is both memory and computationally efficient; (5) Study of real chemical systems demonstrates both the superior accuracy of our method compared to state-of-the-art and the strong and weak scalability for large molecular systems with up to 120 spin orbitals.
Yangjun Wu, Chu Guo, Honghui Shang
SC1
2023 Portable and Scalable All-Electron Quantum Perturbation Simulations on Exascale Supercomputers
abstract
Quantum perturbation theory is pivotal in determining the critical physical properties of materials. The first-principles computations of these properties have yielded profound and quantitative insights in diverse domains of chemistry and physics. In this work, we propose a portable and scalable OpenCL implementation for quantum perturbation theory, which can be generalized across various high-performance computing (HPC) systems. Optimal portability is realized through the utilization of a cross-platform unified interface and a collection of performance-portable heterogeneous optimizations. Exceptional scalability is attained by addressing major constraints on memory and communication, employing a locality-enhancing task mapping strategy and a packed hierarchical collective communication scheme. Experiments on two advanced supercomputers demonstrate that our implementation exhibits remarkably performance on various material systems, scaling the system to 200,000 atoms with all-electron precision. This research enables all-electron quantum perturbation simulations on substantially larger molecular scales, with a potentially significant impact on progress in material sciences.
Zhikun Wu, Yangjun Wu, Ying Liu 0055, Honghui Shang, Yingxiang Gao, Zhongcheng Zhang, Yingchi Long, Xiaobing Feng 0002, Huimin Cui
SC2
2022 Incorporating Instructional Prompts into a Unified Generative Framework for Joint Multiple Intent Detection and Slot Filling
abstract
The joint multiple Intent Detection (ID) and Slot Filling (SF) is a significant challenge in spoken language understanding. Because the slots in an utterance may relate to multi-intents, most existing approaches focus on utilizing task-specific components to capture the relations between intents and slots. The customized networks restrict models from modeling commonalities between tasks and generalization for broader applications. To address the above issue, we propose a Unified Generative framework (UGEN) based on a prompt-based paradigm, and formulate the task as a question-answering problem. Specifically, we design 5-type templates as instructional prompts, and each template includes a question that acts as the driver to teach UGEN to grasp the paradigm, options that list the candidate intents or slots to reduce the answer search space, and the context denotes original utterance. Through the instructional prompts, UGEN is guided to understand intents, slots, and their implicit correlations. On two popular multi-intent benchmark datasets, experimental results demonstrate that UGEN achieves new SOTA performances on full-data and surpasses the baselines by a large margin on 5-shot (28.1%) and 10-shot (23%) scenarios, which verify that UGEN is robust and effective.
Yangjun Wu, Dongxiang Zhang, Gang Chen 0001, Hao Zhang 0029
COLING1
2022 Scaling Poisson Solvers on Many Cores via MMEwald
abstract
The Poisson solver for the calculation of the electrostatic potential is an essential primitive in quantum mechanics calculations. In this article, we adopt the Ewald method and propose a highly-optimized and scalable framework for Poisson solver, MMEwald, on the new generation Sunway supercomputer, capable of utilizing the collection of 390-core accelerators it uses. The MMEwald is based on a grid adapted cut-plane approach to partition the points into batches and distribute the batch to the processors. Furthermore, we propose a set of architecture-specific optimizations to efficiently utilize the memory bandwidth and computation capacity of the supercomputer. Experimental results demonstrate the efficiency of the MMEwald in providing strong and weak scaling performance.
Mingchuan Wu, Yangjun Wu, Honghui Shang, Ying Liu 0055, Huimin Cui, Xiaohui Duan, Yunquan Zhang, Xiaobing Feng 0002
IEEE Trans. Parallel Distributed Syst.2
2021 Accelerating all-electron ab initio simulation of raman spectra for biological systems
abstract
Raman spectroscopy provides chemical and compositional information that can serve as a structural fingerprint for various materials. Therefore, simulations of Raman spectra, including both quantum perturbation analyses and ground-state calculations are of significant interest. However, highly accurate full quantum mechanical (QM) simulations of Raman spectra have previously been confined to small systems. For large systems such as biological materials, the computational cost of full QM simulations is extremely high, and their extension to such systems remains challenging. In the work described here, by employing robust new algorithms and advances in implementation for the many-core architectures, we are able to perform fast, accurate, and massively parallel full ab initio simulations of the Raman spectra of biological systems with excellent strong and weak scaling, thereby providing a starting point for applying QM approaches to structural studies of such systems.
Honghui Shang, Yunquan Zhang, Ying Liu 0055, Mingchuan Wu, Yangjun Wu, Di Wei, Huimin Cui, Xin Liu 0081, Fei Wang 0096, Yuxi Ye, Yingxiang Gao, Shuang Ni, Xin Chen 0023, Dexun Chen
SC7
2021 Extreme-scale ab initio quantum raman spectra simulations on the leadership HPC system in China
abstract
Raman spectroscopy provides chemical and compositional information that can serve as a structural fingerprint for various materials. Therefore, simulations of Raman spectra, including both quantum perturbation analyses and ground-state calculations, are of significant interest. However, highly accurate full quantum mechanical (QM) simulations of Raman spectra have previously been confined to small systems. For large systems such as biological materials, full QM simulations have an extremely high computational cost and remain challenging. In this work, robust new algorithms and advanced implementations on many-core architectures are employed to enable fast, accurate, and massively parallel full ab initio simulations of the Raman spectra of realistic biological systems containing up to 3006 atoms, with excellent strong and weak scaling. Up to a performance of 468.5 PFLOP/s in double-precision and 813.7 PLOPS/s in mixed-half precision is achieved on the new-generation Sunway high-performance computing system, suggesting the potential for new applications of the QM approach to biological systems.
Honghui Shang, Yunquan Zhang, You Fu, Yingxiang Gao, Yangjun Wu, Xiaohui Duan, Rongfen Lin, Xin Liu 0081, Ying Liu 0055, Dexun Chen
SC7