Yayu Zhang

dblp:262/7561 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
6since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 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
Learning paradigms · 50% Representation and self-supervised learning · 33% Efficient and distributed learning · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › shared representation
feature sharing
0.812024
Learning Multi-Task Sparse Representation Based on Fisher Information · AAAI 2024
Machine learning › Learning paradigms › supervised learning
multimodal classification
0.812024
Core-Structures-Guided Multi-Modal Classification Neural Architecture Search · IJCAI 2024
Machine learning › Learning paradigms
multi-task learning
0.812024
Learning Multi-Task Sparse Representation Based on Fisher Information · AAAI 2024
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search
0.812024
Core-Structures-Guided Multi-Modal Classification Neural Architecture Search · IJCAI 2024
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
sparse coding
0.812024
Learning Multi-Task Sparse Representation Based on Fisher Information · AAAI 2024
Machine learning › Learning paradigms › multi-task learning
sparse multi-task learning
0.812024
Learning Multi-Task Sparse Representation Based on Fisher Information · AAAI 2024

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

fisher information · 0.8alternating optimization · 0.8
YearPublicationVenuePosition
2026 Co-speech holistic 3D motion generation with style from video
abstract
Speech-driven 3D motion generation has garnered increasing research attention. However, it faces significant challenges in achieving style controllability, primarily due to the scarcity of motion style annotations. To address this, we propose a novel diffusion-based framework for co-speech holistic motion generation that enables example-based style control from videos. Our approach integrates hierarchical speech encoding with rhythm-aware denoising to produce natural and synchronized gestures and expressions. For effective style guidance, we introduce a contrastive style encoder that captures discriminative style representations from reference clips without explicit labeling, enabling generalization to motion styles unseen during training. Furthermore, we design a neural mapper that aligns 2D and 3D gesture features in a shared embedding space, facilitating direct style extraction from in-the-wild videos and seamless transfer to 3D motion. Extensive experiments and user studies show that our proposed approach achieves state-of-the-art performance in both qualitative and quantitative evaluations, offering a flexible solution for controllable motion generation.
Yayu Zhang, Yu-Hui Wen, Liping Jing, Jian Yu 0001
Graph. Model.1
2026 A simple deep multi-task sparse modeling method via group sparsity regularization
Yayu Zhang, Xinyan Liang, Jieting Wang, Liyun Xu, Honghong Cheng
Pattern Recognit.1
2025 Multi-Scale Features Are Effective for Multi-Modal Classification: An Architecture Search Viewpoint
abstract
Multi-modal neural architecture search (MNAS) is an effective approach to obtain task-adaptive multi-modal classification models. Deep neural networks, as currently main-stream feature extractors, can provide hierarchical features for each modality. Existing MNAS methods face difficulty in exploiting such hierarchical features due to their different form coexistence such as tensorial multi-scale features and vectorized penultimate features. Moreover, existing methods always focus on the evolution of fusion operators or vectorized features of all modalities, constraining search space. In this paper, a novel two-stage method called multi-modal multi-scale evolutionary neural architecture search (MM-ENAS) is proposed. The first stage unifies the representation form of hierarchical features by the proposed evolutionary statistics strategy. The second stage identifies the optimal combination of basic fusion operations for all unified hierarchical features by the evolutionary algorithm. MM-ENAS increases search space by simultaneously searching for feature statistical extraction methods, basic fusion operators and feature representation set consisting of tensorial multi-scale features and vectorized penultimate features. Experimental results on three multi-modal tasks demonstrate that the proposed method achieves competitive performance in terms of accuracy, search time, and number of parameters compared to existing representative MNAS methods. Additionally, the method exhibits fast adaptation to various multi-modal tasks.
Pinhan Fu, Xinyan Liang, Qian Guo 0005, Yayu Zhang, Qin Huang 0005, Ke Tang 0001
IEEE Trans. Circuits Syst. Video Technol.5
2024 Learning Multi-Task Sparse Representation Based on Fisher Information
abstract
Multi-task learning deals with multiple related tasks simultaneously by sharing knowledge. In a typical deep multi-task learning model, all tasks use the same feature space and share the latent knowledge. If the tasks are weakly correlated or some features are negatively correlated, sharing all knowledge often leads to negative knowledge transfer among. To overcome this issue, this paper proposes a Fisher sparse multi-task learning method. It can obtain a sparse sharing representation for each task. In such a way, tasks share features on a sparse subspace. Our method can ensure that the knowledge transferred among tasks is beneficial. Specifically, we first propose a sparse deep multi-task learning model, and then introduce Fisher sparse module into traditional deep multi-task learning to learn the sparse variables of task. By alternately updating the neural network parameters and sparse variables, a sparse sharing representation can be learned for each task. In addition, in order to reduce the computational overhead, an heuristic method is used to estimate the Fisher information of neural network parameters. Experimental results show that, comparing with other methods, our proposed method can improve the performance for all tasks, and has high sparsity in multi-task learning.
Yayu Zhang, Guoshuai Ma, Keyin Zheng, Guoqing Liu 0001, Qingfu Zhang 0001
AAAI1
2024 Core-Structures-Guided Multi-Modal Classification Neural Architecture Search
Pinhan Fu, Xinyan Liang, Tingjin Luo, Qian Guo 0005, Yayu Zhang
IJCAI5
2024 ESSR: Evolving Sparse Sharing Representation for Multitask Learning
abstract
Multi-task learning uses knowledge transfer among tasks to improve the generalization performance of all tasks. For deep multi-task learning, knowledge transfer is often implemented via sharing all hidden features of tasks. A major shortcoming is that it can lead to negative knowledge transfer across tasks when task correlation is weak. To overcome it, this paper proposes an evolutionary method to learn sparse sharing representations adaptively. By embedding the neural network optimization into evolutionary multitasking, our proposed method finds an optimal combination of tasks and sharing features. It can identify negative correlation and redundant features and then remove them from the hidden feature set. Thus, an optimal sparse sharing subnetwork can be produced for each task. Experiment results show that the proposed method achieve better learning performance with a smaller inference model than other related methods.
Yayu Zhang, Guoshuai Ma, Xinyan Liang, Guoqing Liu 0001, Qingfu Zhang 0001, Ke Tang 0001
IEEE Trans. Evol. Comput.1