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

Pinlong Zhao

dblp:222/2086 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
6since 2021 · last 2027
0000-0002-3161-5003ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 2 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
3 papers
Language models and text generation · 33% Trustworthy machine learning · 33% Optimization for machine learning · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
1.012026
Unequal Vulnerability: The Differential Impact of Label Flipping Attacks Across Classes · WWW 2026
Natural language and speech › Language models and text generation › preference optimization
direct preference optimization
1.012026
What Do LLMs Learn First? Asymmetric Learning Dynamics of Input Complexity and Output Ambiguity in Preference Alignment · ACL (1) 2026
Machine learning › Trustworthy machine learning › robustness › data poisoning
label-flipping attack
1.012026
Unequal Vulnerability: The Differential Impact of Label Flipping Attacks Across Classes · WWW 2026
Machine learning › Optimization for machine learning
learning curve extrapolation
1.012026
Difficulty-Aware Learning Curve Extrapolation · AAAI 2026
Natural language and speech › Language models and text generation › alignment
preference alignment
1.012026
What Do LLMs Learn First? Asymmetric Learning Dynamics of Input Complexity and Output Ambiguity in Preference Alignment · ACL (1) 2026
Machine learning › Deep learning architectures and training
training dynamics
1.012026
What Do LLMs Learn First? Asymmetric Learning Dynamics of Input Complexity and Output Ambiguity in Preference Alignment · ACL (1) 2026

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

theoretical analysis · 1.0learning curve extrapolation · 1.0direct preference optimization · 1.0curriculum learning · 1.0contrastive learning · 1.0
YearPublicationVenuePosition
2027 Regime-aware residual graph learning for multivariate time series forecasting
Pengfei Jiao, Tianpeng Li, Pinlong Zhao, Fengjun Xiao
Expert Syst. Appl.4
2026 Difficulty-Aware Learning Curve Extrapolation
Mengyang Li 0001, Pinlong Zhao
AAAI2
2026 What Do LLMs Learn First? Asymmetric Learning Dynamics of Input Complexity and Output Ambiguity in Preference Alignment
abstract
Direct Preference Optimization (DPO) has become a standard approach for aligning large language models with human preferences, yet existing methods treat all preference pairs uniformly during training.We identify two distinct sources of learning difficulty: Input Complexity (IC), capturing prompt understanding challenges, and Output Ambiguity (OA), measuring preference discrimination difficulty.Through systematic analysis, we demonstrate that these dimensions induce asymmetric learning dynamics, with IC-related competencies developing rapidly in early training while OA-related competencies emerge more gradually.Building on this observation, we propose DECOPO, a training framework that maintains separate, adaptive pacing schedules for each dimension.Experiments on UltraFeedback show that DE-COPO achieves 42.3% length-controlled win rate on AlpacaEval 2.0 and 7.66 on MT-Bench, outperforming curriculum baselines by 2.1% and 0.21 points respectively, while matching full-data baseline performance with only 75% of training samples.
Mengyang Li 0001, Pinlong Zhao
ACL (1)3
2026 Graph Reinforcement Learning based Resource Allocation Method in RIS-aided Heterogeneous IoV
Huijun Tang, Pinlong Zhao, Pengfei Jiao, Huaifeng Shi, Huaming Wu, Hongjian Sun 0001
ICC3
2026 Unequal Vulnerability: The Differential Impact of Label Flipping Attacks Across Classes
abstract
Label flipping attacks stand as a potent and practical threat to the integrity of machine learning models. While extensive research has focused on designing sophisticated attack and defense mechanisms, the underlying factors that govern a model's susceptibility remain underexplored. This paper reveals a critical phenomenon: the impact of label flipping attacks is highly differential across classes, strongly correlated with the intrinsic confusability between the source and target classes. We provide a rigorous theoretical analysis, demonstrating that a lower standardized separation between classes fundamentally leads to greater vulnerability. Grounded in this insight, we propose Confusability-Aware Contrastive Learning (CACL), a targeted defense that maximizes the feature-space separation for the most vulnerable class pairs. Extensive experiments validate the strong link between class separability and vulnerability, and show that CACL significantly mitigates the attack's impact while providing superior protection for the most susceptible classes. Our code is available at https://github.com/Pinlong-Zhao/Unequal-Vulnerability.
Pinlong Zhao, Mengyang Li 0001, Pengfei Jiao, Huijun Tang, Ou Wu 0001
WWW1
2025 RIS-Assisted Beamforming Optimization Based on DNN in the UAV-ISAC System
Jieling Zhang, Bin Yang 0034, Pinlong Zhao, Pengfei Jiao, Zhidong Zhao, Huaming Wu
ICA3PP (5)4
2020 Sentiment analysis via dually-born-again network and sample selection
abstract
Text sentiment analysis is an important natural language processing (NLP) task and has received considerable attention in recent years. Numerous deep-learning based methods have been proposed in previous literature in terms of new deep neural networks (DNN) including new embedding strategies, new attention mechanisms, and new encoding layers. In this study, an alternative technical path is investigated to further improve the state-of-the-art performance of text sentiment analysis. An new effective learning framework is proposed that combines knowledge distillation and sample selection. A dually-born-again network (DBAN) is presented in which the teacher network and the student network are simultaneously trained through an iterative approach. A selection gate is defined to deal with training samples which are useless or even harmful for model training. Moreover, both the DBAN and sample selection are further improved by ensemble. The proposed framework can improve the existing state-of-the-art DNN models in sentiment analysis. Experimental results indicate that the proposed framework enhances the performances of existing networks. In addition, DBAN outperforms existing born-again network.
Pinlong Zhao, Zefeng Han, Qing Yin, Shuxiao Li, Ou Wu 0001
Intell. Data Anal.1
2020 Modeling sentiment dependencies with graph convolutional networks for aspect-level sentiment classification
Pinlong Zhao, Linlin Hou, Ou Wu 0001
Knowl. Based Syst.1