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.

Libang Zhang

dblp:68/7557 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0002-4940-2698ORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
Transfer learning and domain adaptation · 35% Graph learning · 35% Trustworthy machine learning · 15%
Network and information security
1 paper
Hardware security and side channels · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › domain adaptation
graph domain adaptation
0.912025
Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptation · AAAI 2025
Machine learning › Graph learning
graph neural network
0.912025
Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptation · AAAI 2025
Machine learning › Graph learning › graph out-of-distribution generalization
structural distribution shift
0.912025
Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptation · AAAI 2025
Machine learning › Transfer learning and domain adaptation › domain adaptation › graph domain adaptation
unsupervised graph domain adaptation
0.912025
Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptation · AAAI 2025
Natural language and speech › Language models and text generation
dataset refinement
0.812024
Collaborative Refining for Learning from Inaccurate Labels · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.812024
Collaborative Refining for Learning from Inaccurate Labels · NeurIPS 2024
Hardware security and side channels › side-channel attack › profiled side-channel attack
deep learning-based side-channel attack
0.512021
Multilabel Deep Learning-Based Side-Channel Attack · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2021
Hardware security and side channels › side-channel attack
profiled side-channel attack
0.512021
Multilabel Deep Learning-Based Side-Channel Attack · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2021
Hardware security and side channels
side-channel attack
0.512021
Multilabel Deep Learning-Based Side-Channel Attack · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2021

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

structural smoothing · 0.9neighborhood sampling · 0.9theoretical analysis · 0.8sample selection · 0.8annotator agreement · 0.8multi-label classification · 0.5deep learning · 0.5
YearPublicationVenuePosition
2026 APL-LLM: adaptive pseudo-labeling with large language models for few-shot node classification
Junyi Li 0001, Chenweinan Jiang, Daixin Wang, Guo Ye, Libang Zhang, Huimei He, Binbin Hu, Zhiqiang Zhang 0012, Fuzhen Zhuang
Frontiers Comput. Sci.5
2025 Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptation
abstract
Unsupervised Graph Domain Adaptation (UGDA) seeks to bridge distribution shifts between domains by transferring knowledge from labeled source graphs to given unlabeled target graphs. Existing UGDA methods primarily focus on aligning features in the latent space learned by graph neural networks (GNNs) across domains, often overlooking structural shifts, resulting in limited effectiveness when addressing structurally complex transfer scenarios. Given the sensitivity of GNNs to local structural features, even slight discrepancies between source and target graphs could lead to significant shifts in node embeddings, thereby reducing the effectiveness of knowledge transfer. To address this issue, we introduce a novel approach for UGDA called Target-Domain Structural Smoothing (TDSS). TDSS is a simple and effective method designed to perform structural smoothing directly on the target graph, thereby mitigating structural distribution shifts and ensuring the consistency of node representations. Specifically, by integrating smoothing techniques with neighbor- hood sampling, TDSS maintains the structural coherence of the target graph while mitigating the risk of over-smoothing. Our theoretical analysis shows that TDSS effectively reduces target risk by improving model smoothness. Empirical results on three real-world datasets demonstrate that TDSS outperforms recent state-of-the-art baselines, achieving significant improvements across six transfer scenarios.
Wei Chen 0061, Guo Ye, Yakun Wang 0001, Zhao Zhang 0011, Libang Zhang, Daixin Wang, Zhiqiang Zhang 0012, Fuzhen Zhuang
AAAI5
2024 Collaborative Refining for Learning from Inaccurate Labels
abstract
This paper considers the problem of learning from multiple sets of inaccurate labels, which can be easily obtained from low-cost annotators, such as rule-based annotators. Previous works typically concentrate on aggregating information from all the annotators, overlooking the significance of data refinement. This paper presents a collaborative refining approach for learning from inaccurate labels. To refine the data, we introduce the annotator agreement as an instrument, which refers to whether multiple annotators agree or disagree on the labels for a given sample. For samples where some annotators disagree, a comparative strategy is proposed to filter noise. Through theoretical analysis, the connections among multiple sets of labels, the respective models trained on them, and the true labels are uncovered to identify relatively reliable labels. For samples where all annotators agree, an aggregating strategy is designed to mitigate potential noise. Guided by theoretical bounds on loss values, a sample selection criterion is introduced and modified to be more robust against potentially problematic values. Through these two methods, all the samples are refined during training, and these refined samples are used to train a lightweight model simultaneously. Extensive experiments are conducted on benchmark and real-world datasets to demonstrate the superiority of our methods.
Yixuan Sun, Ya-Lin Zhang 0001, Libang Zhang, Jun Zhou 0011, Guo Ye, Huimei He
NeurIPS4
2021 Multilabel Deep Learning-Based Side-Channel Attack
abstract
In recent years, deep learning methods make a big difference in side-channel attack (SCA) community especially in the profiled scenario. Multiclass classification method is the common way to complete such classification task. In this article, we propose a novel SCA method utilizing multilabel classification from bit-to-byte view. Accordingly, each leakage trace has eight labels when considering a byte. The experimental results on several datasets show that our multilabel classification method is efficient and even performs better in some situations compared with the original multiclass classification model while model complexity is much reduced. Besides, our multilabel model can be seen as ensemble of monobit models and we verify the ensemble effect experimentally.
Libang Zhang, Xinpeng Xing, Junfeng Fan, Zongyue Wang, Suying Wang
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2020 Energy Efficient Mode Selection, Base Station Selection and Resource Allocation Algorithm in D2D Heterogeneous Networks
Zhufang Kuang, Gongqiang Li, Libang Zhang, Huibin Zhou, Anfeng Liu
Peer-to-Peer Netw. Appl.3
2009 Stress Distributions on the Slider with Different Accommodation Coefficients
abstract
Recently the influence of accommodation coefficient, which determines the behaviors of the reflected molecules at the boundary walls, was studied a lot for exploring the flying characteristics of head-disk interface. However, all of the researches are based on the slider with unique accommodation coefficient. In this paper, the different correction models of Reynolds equation, the free molecular gas film lubrication (MGL) equation and direct simulation Monte Carlo (DSMC) method are compared. Stress distributions on the slider with different accommodation coefficients were calculated by using the free molecular MGL equation and DSMC method respectively. The results show that the shear stress is different with the slider with different accommodation coefficients, and hence the shear stress can be controlled by giving the slider proper accommodation coefficients, without influencing the pressure. This provides a theory basis for the design of slider of HDD with high stability.
Jincai Chen, Gongye Zhou, Libang Zhang
NAS4