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

Zhenyu Nie

dblp:43/8970 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0002-7714-7903ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 56% Trustworthy machine learning · 44%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures › accelerator integration
heterogeneous accelerator system
1.012026
Adaptive Block-Wise Mapping With Intra-Block Resource Allocation for Multi-DNN Workloads on Heterogeneous Accelerator Systems · IEEE Trans. Parallel Distributed Syst. 2026
Hardware accelerators and domain-specific architectures › machine learning accelerator › DNN acceleration
multi-DNN workload mapping
1.012026
Adaptive Block-Wise Mapping With Intra-Block Resource Allocation for Multi-DNN Workloads on Heterogeneous Accelerator Systems · IEEE Trans. Parallel Distributed Syst. 2026
Machine learning › Trustworthy machine learning
interpretability
0.812024
Hierarchical Explanations for Text Classification Models: Fast and Effective · ICDM 2024
Natural language and speech › Information extraction and text analysis › text classification
interpretable text classification
0.812024
Hierarchical Explanations for Text Classification Models: Fast and Effective · ICDM 2024
Natural language and speech › Information extraction and text analysis
text classification
0.212024
Hierarchical Explanations for Text Classification Models: Fast and Effective · ICDM 2024

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

genetic algorithm · 1.0block-wise mapping · 1.0two-step building strategy · 0.8interaction-based explanation · 0.8
YearPublicationVenuePosition
2026 Adaptive Block-Wise Mapping With Intra-Block Resource Allocation for Multi-DNN Workloads on Heterogeneous Accelerator Systems
abstract
Deep neural networks (DNNs) dominate workloads on cloud and edge platforms. Meanwhile, the hardware platform towards the heterogeneous system with various accelerators. By mapping layers to their different preferred accelerators, the computation cost of each layer can be reduced. While mapping these layers on the same accelerator can reduce the inter-accelerator communication cost. These two costs are often competing and difficult to optimize simultaneously. Therefore, the core challenge in achieving efficient execution of DNN workloads on heterogeneous systems is: how to map layers to achieve the best trade-off between computation and communication costs. Existing works group layers into blocks and perform blockwise mapping to reduce inter-layer communication within blocks. However, when grouping layers, they typically rely on modelagnostic rules, which fail to hide critical inter-layer communication within blocks for diverse DNNs. Moreover, after block mapping, the lack of intra-block resource allocation further increases computation cost of block. In this paper, we proposeGHCoM, a novel block-wise mapping framework for exploring the effective cost trade-offs.GHCoMemploys an adaptive grouping strategy to guide layer grouping based on the topology of DNNs and dynamically adjust the grouping according to the trade-off target. Furthermore,GHCoMconsiders the fine-grained allocation of computation (i.e., processing elements) and communication (i.e., on-chip bandwidth) resources within each block to mitigate interlayer resource contention. To jointly optimize layer grouping, block-wise mapping and intra-block resource allocation,GHCoMleverages a two-level genetic algorithm (GA) with tailored encodings and operators that capture the interdependence across the entire design space. Experiments across various workloads and system configurations show thatGHCoMconsistently outperforms state-of-the-art baselines, achieving 1.08× to 4.79× speedup in execution latency and reducing energy consumption by 1.83% to 87.71%.
Zhenyu Nie, Haotian Wang 0006, Anthony T. Chronopoulos, Zhuo Tang, Kenli Li 0001, Chubo Liu
IEEE Trans. Parallel Distributed Syst.1
2025 TIPS: A text interaction evaluation metric for learning model interpretation
Zhenyu Nie, Tao Wang 0016, Anthony T. Chronopoulos, Razvan Andonie, Amirhosein Mosavi
Expert Syst. Appl.1
2024 Hierarchical Explanations for Text Classification Models: Fast and Effective
abstract
Generating explanations for deep neural networks (DNNs) can make them more trustworthy in real-world applications. For a text classification task, existing methods visualize the contributions of words or word interactions layer by layer in a traversal manner, to assist users in understanding the decision-making of models. However, all these methods only focus on the explanation performance while ignoring inefficiencies in explaining due to the traversal manner. This means that the explanation is not available to users in a timely manner, so users may no longer use it due to the big time cost. To overcome this problem, we propose HETSG, an interaction-based method for explaining text classification models quickly and faithfully, by a simple and effective two-step building strategy. Such a strategy captures the important interaction by first determining the important position and then confirming the direction of interaction, without iterating over all word interactions. We also provide a novel metric to accurately evaluate the performance of each interpretation method. The proposed method is compared with baseline methods (baselines) on six text classification datasets to explain three natural language processing (NLP) models. Experimental results show that our method outperforms all baselines with higher efficiency and it is also competitive in performance.
Zhenyu Nie, Huizhang Luo, Anthony T. Chronopoulos
ICDM1
2022 An extended attention mechanism for scene text recognition
Zhenyu Nie, Anthony T. Chronopoulos
Expert Syst. Appl.2
2011 Synchronization for general complex dynamical networks with sampled-data
Yulian Zhang, Zhenyu Nie
Neurocomputing4