Yongchun Zhu

Yongchun Zhu

Auto-generated profile, based on publicly available information

Yongchun Zhu

Bytedance, Beijing, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 May 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YZYongchun Zhu
Yongchun Zhu
FZFuzhen Zhuang
Fuzhen Zhuang
JWJindong Wang
Jindong Wang
GKGuolin Ke
Guolin Ke
JCJingwu Chen
Jingwu Chen
QHQing He
Qing He
For a target task where the labeled data are unavailable, domain adaptation can transfer a learner from a different source domain. Previous deep domain adaptation methods mainly learn a global domain shift, i.e., align the global source and target distributions without considering the relationships between two subdomains within the same category of different domains, leading to unsatisfying transfer learning performance without capturing the fine-grained information. Recently, more and more researchers pay attention to subdomain adaptation that focuses on accurately aligning the distributions of the relevant subdomains. However, most of them are adversarial methods that contain several loss functions and converge slowly. Based on this, we present a deep subdomain adaptation network (DSAN) that learns a transfer network by aligning the relevant subdomain distributions of domain-specific layer activations across different domains based on a local maximum mean discrepancy (LMMD). Our DSAN is very simple but effective, which does not need adversarial training and converges fast. The adaptation can be achieved easily with most feedforward network models by extending them with LMMD loss, which can be trained efficiently via backpropagation. Experiments demonstrate that DSAN can achieve remarkable results on both object recognition tasks and digit classification tasks. Our code will be available at https://github.com/easezyc/deep-transfer-learning.

1 November 2019 in Neural Networks
Verified
Journal Article
Closed access
YZYongchun Zhu
Yongchun Zhu
FZFuzhen Zhuang
Fuzhen Zhuang
JWJindong Wang
Jindong Wang
JCJingwu Chen
Jingwu Chen
ZSZhiping Shi
Zhiping Shi
QHQing He
Qing He

21 June 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YZYongchun Zhu
Yongchun Zhu
QSQiang Sheng
Qiang Sheng
JCJuan Cao
Juan Cao
QNQiong Nan
Qiong Nan
KSKai Shu
Kai Shu
FZFuzhen Zhuang
Fuzhen Zhuang
The wide spread of fake news is increasingly threatening both individuals and society. Great efforts have been made for automatic fake news detection on a single domain (e.g., politics). However, correlations exist commonly across multiple news domains, and thus it is promising to simultaneously detect fake news of multiple domains. Based on our analysis, we pose two challenges in multi-domain fake news detection: 1) domain shift, caused by the discrepancy among domains in terms of words, emotions, styles, etc. 2) domain labeling incompleteness, stemming from the real-world categorization that only outputs one single domain label, regardless of topic diversity of a news piece. In this paper, we propose a Memory-guided Multi-view Multi-domain Fake News Detection Framework (M $^{3}$ FEND) to address these two challenges. We model news pieces from a multi-view perspective, including semantics, emotion, and style. Specifically, we propose a Domain Memory Bank to enrich domain information which could discover potential domain labels based on seen news pieces and model domain characteristics. Then, with enriched domain information as input, a Domain Adapter could adaptively aggregate discriminative information from multiple views for news in various domains. Extensive offline experiments on English and Chinese datasets demonstrate the effectiveness of M $^{3}$ FEND, and online tests verify its superiority in practice. Our code is available at https://github.com/ICTMCG/M3FEND.

8 April 2022
Verified
Book Chapter
Closed access
PDF file
YWYiqing Wu
Yiqing Wu
RXRuobing Xie
Ruobing Xie
YZYongchun Zhu
Yongchun Zhu
XAXiang Ao
Xiang Ao
XCXin Chen
Xin Chen
QHQing He
Qing He

23 January 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YWYiqing Wu
Yiqing Wu
RXRuobing Xie
Ruobing Xie
YZYongchun Zhu
Yongchun Zhu
FZFuzhen Zhuang
Fuzhen Zhuang
XZXu Zhang
Xu Zhang
QHQing He
Qing He
Pre-training models have shown their power in sequential recommendation. Recently, prompt has been widely explored and verified for tuning after pre-training in NLP, which helps to more effectively and parameter-efficiently extract useful knowledge from pre-training models for downstream tasks, especially in cold-start scenarios. However, it is challenging to bring prompt-tuning from NLP to recommendation, since the tokens of recommendation (i.e., items) are million-level and do not have concrete explainable semantics, and the sequence modeling in recommendation should be personalized. In this work, we first introduce prompt to recommendation models and propose a novel Personalized prompt-based recommendation (PPR) framework for cold-start recommendation. Specifically, we build personalized soft prompt via a prompt generator based on user profiles, and enable a sufficient training on prompts via a new prompt-oriented contrastive learning. PPR is effective, parameter-efficient, and universal in various tasks. In both few-shot and zero-shot recommendation tasks, PPR models achieve significant improvements over baselines in three large-scale datasets. We also verify PPR's universality in adopting different recommendation models as the backbone. Finally, we explore and confirm the capability of PPR on other tasks such as cross-domain recommendation and user profile prediction, shedding lights on the promising future directions of better using large-scale pre-trained recommendation models.

4 August 2023
Verified
Conference Paper
Open access
XQXin Qin
Xin Qin
JWJindong Wang
Jindong Wang
SMShuo Ma
Shuo Ma
WLWang Lu
Wang Lu
YZYongchun Zhu
Yongchun Zhu
YCYiqiang Chen
Yiqiang Chen
Human activity recognition (HAR) is a time series classification task that focuses on identifying the motion patterns from human sensor readings. Adequate data is essential but a major bottleneck for training a generalizable HAR model, which assists customization and optimization of online web applications. However, it is costly in time and economy to collect large-scale labeled data in reality, i.e., the low-resource challenge. Meanwhile, data collected from different persons have distribution shifts due to different living habits, body shapes, age groups, etc. The low-resource and distribution shift challenges are detrimental to HAR when applying the trained model to new unseen subjects. In this paper, we propose a novel approach called Diverse and Discriminative representation Learning (DDLearn) for generalizable low-resource HAR. DDLearn simultaneously considers diversity and discrimination learning. With the constructed self-supervised learning task, DDLearn enlarges the data diversity and explores the latent activity properties. Then, we propose a diversity preservation module to preserve the diversity of learned features by enlarging the distribution divergence between the original and augmented domains. Meanwhile, DDLearn also enhances semantic discrimination by learning discriminative representations with supervised contrastive learning. Extensive experiments on three public HAR datasets demonstrate that our method significantly outperforms state-of-art methods by an average accuracy improvement of 9.5% under the low-resource distribution shift scenarios, while being a generic, explainable, and flexible framework. Code is available at: https://github.com/microsoft/robustlearn.