VLDB 2026 Research / reviewers in the wild / expert
Shimao Zhang
dblp:352/9106
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 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 |
Language models and text generation · 39% Representation and self-supervised learning · 22% Trustworthy machine learning · 22% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 80% Distributed computing theory · 20% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
multilingual language models |
1.8 | 2 | 2026 | How Does Alignment Enhance LLMs' Multilingual Capabilities? A Language Neurons Perspective · AAAI 2026 Getting More from Less: Large Language Models are Good Spontaneous Multilingual Learners · EMNLP 2024 |
Machine learning › Representation and self-supervised learning › representation matching › feature alignment › embedding alignment
cross-lingual alignment |
1.0 | 1 | 2026 | How Does Alignment Enhance LLMs' Multilingual Capabilities? A Language Neurons Perspective · AAAI 2026 |
Machine learning › Trustworthy machine learning
interpretability |
1.0 | 1 | 2026 | How Does Alignment Enhance LLMs' Multilingual Capabilities? A Language Neurons Perspective · AAAI 2026 |
Machine learning › Transfer learning and domain adaptation
cross-lingual transfer |
0.8 | 1 | 2024 | Getting More from Less: Large Language Models are Good Spontaneous Multilingual Learners · EMNLP 2024 |
Distributed computing theory › distributed learning
decentralized online learning |
0.7 | 1 | 2023 | Distributed Projection-Free Online Learning for Smooth and Convex Losses · AAAI 2023 |
Mathematical optimization › distributed optimization
distributed online optimization |
0.7 | 1 | 2023 | Distributed Projection-Free Online Learning for Smooth and Convex Losses · AAAI 2023 |
Mathematical optimization › online optimization
online convex optimization |
0.7 | 1 | 2023 | Distributed Projection-Free Online Learning for Smooth and Convex Losses · AAAI 2023 |
Mathematical optimization › online optimization
projection-free online learning |
0.7 | 1 | 2023 | Distributed Projection-Free Online Learning for Smooth and Convex Losses · AAAI 2023 |
Mathematical optimization › online optimization
regret bounds |
0.7 | 1 | 2023 | Distributed Projection-Free Online Learning for Smooth and Convex Losses · AAAI 2023 |
Methods — techniques the papers use, named apart from their topics
ternary classification · 1.0neuron classification · 1.0sampling · 0.7follow-the-perturbed-leader · 0.7blocking · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | How Does Alignment Enhance LLMs' Multilingual Capabilities? A Language Neurons PerspectiveabstractMultilingual Alignment is an effective and representative paradigm to enhance LLMs' multilingual capabilities, which transfers the capabilities from the high-resource languages to the low-resource languages. Meanwhile, some research on language-specific neurons provides a new perspective to analyze and understand LLMs' mechanisms. However, we find that there are many neurons that are shared by multiple but not all languages and cannot be correctly classified. In this work, we propose a ternary classification methodology that categorizes neurons into three types, including language-specific neurons, language-related neurons, and general neurons. And we propose a corresponding identification algorithm to distinguish these different types of neurons. Furthermore, based on the distributional characteristics of different types of neurons, we divide the LLMs' internal process for multilingual inference into four parts: (1) multilingual understanding, (2) shared semantic space reasoning, (3) multilingual output space transformation, and (4) vocabulary space outputting. Additionally, we systematically analyze the models before and after alignment with a focus on different types of neurons. We also analyze the phenomenon of ''Spontaneous Multilingual Alignment''. Overall, our work conducts a comprehensive investigation based on different types of neurons, providing empirical results and valuable insights to better understand multilingual alignment and multilingual capabilities of LLMs. Shimao Zhang, Zhejian Lai, Xiang Liu 0023, Shuaijie She, Yeyun Gong, Shujian Huang, Jiajun Chen 0001 |
AAAI | 1 |
| 2025 | MPDRM: A Multi-Scale Personalized Depression Recognition Model via facial movements
Zhenyu Liu 0006, Bailin Chen, Shimao Zhang, Jiaqian Yuan, Yang Wu 0011, Hanshu Cai, Yimiao Zhao, Huan Mei, Jiahui Deng, Yanping Bao, Bin Hu 0001 |
Neurocomputing | 3 |
| 2025 | Stimulus-Response Pattern: The Core of Robust Cross-Stimulus Facial Depression RecognitionabstractFacial depression recognition is one of the current hot topics. Mainstream methods mainly focus on how to design deep models to effectively extract the difference in facial movements between depressed patients and healthy people. However, this difference changes when the stimulus source to which the subjects are exposed changes. This leads to the performance degradation in cross-stimulus situation and limits the practical application of this technology. We hold the opinion that why depressed patients show behavioral characteristics different from healthy people is that they have a specific stable pattern of responding to stimulus. Therefore, we incorporate stimuli into the modeling process for the first time and employ deep networks to learn stable representations between stimulus and response to achieve stable and effective modeling. Specifically, we propose a deep modeling framework to learn the stimulus-response pattern of the subject through the interaction relationship between the stimulus videos and the subject’s facial movements. We constructed a balanced depression dataset of 364 individuals with three different stimulus videos to verify the effectiveness of our method. The results show that our method achieves state-of-the-art and the best generalization performance in depression recognition. This stimulus-response pattern modeling provides a new perspective for recognizing depression. Zhenyu Liu 0006, Shimao Zhang, Bailin Chen, Qiongqiong Chen, Zhijie Ding, Xin Zhang 0034, Bin Hu 0001 |
IEEE Trans. Affect. Comput. | 2 |
| 2024 | Getting More from Less: Large Language Models are Good Spontaneous Multilingual LearnersabstractShimao Zhang, Changjiang Gao, Wenhao Zhu, Jiajun Chen, Xin Huang, Xue Han, Junlan Feng, Chao Deng, Shujian Huang. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024. Shimao Zhang, Changjiang Gao, Jiajun Chen 0001, Xue Han 0018, Junlan Feng, Chao Deng 0002, Shujian Huang |
EMNLP | 1 |
| 2023 | Distributed Projection-Free Online Learning for Smooth and Convex LossesabstractWe investigate the problem of distributed online convex optimization with complicated constraints, in which the projection operation could be the computational bottleneck. To avoid projections, distributed online projection-free methods have been proposed and attain an O(T^{3/4}) regret bound for general convex losses. However, they cannot utilize the smoothness condition, which has been exploited in the centralized setting to improve the regret. In this paper, we propose a new distributed online projection-free method with a tighter regret bound of O(T^{2/3}) for smooth and convex losses. Specifically, we first provide a distributed extension of Follow-the-Perturbed-Leader so that the smoothness can be utilized in the distributed setting. Then, we reduce the computational cost via sampling and blocking techniques. In this way, our method only needs to solve one linear optimization per round on average. Finally, we conduct experiments on benchmark datasets to verify the effectiveness of our proposed method. Yibo Wang 0005, Yuanyu Wan, Shimao Zhang, Lijun Zhang 0005 |
AAAI | 3 |