Pengfei Wei

Pengfei Wei

Auto-generated profile, based on publicly available information

Pengfei Wei

ByteDance AI Lab

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
12 January 2024 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
RCRuichu Cai
Ruichu Cai
FWFengzhu Wu
Fengzhu Wu
ZLZijian Li
Zijian Li
PWPengfei Wei
Pengfei Wei
LYLingling Yi
Lingling Yi
KZKun Zhang
Kun Zhang
Recent years have witnessed tremendous interest in deep learning on graph-structured data. Due to the high cost of collecting labeled graph-structured data, domain adaptation is important to supervised graph learning tasks with limited samples. However, current graph domain adaptation methods are generally adopted from traditional domain adaptation tasks, and the properties of graph-structured data are not well utilized. For example, the observed social networks on different platforms are controlled not only by the different crowds or communities but also by domain-specific policies and background noise. Based on these properties in graph-structured data, we first assume that the graph-structured data generation process is controlled by three independent types of latent variables, i.e., the semantic latent variables, the domain latent variables, and the random latent variables. Based on this assumption, we propose a disentanglement-based unsupervised domain adaptation method for the graph-structured data, which applies variational graph auto-encoders to recover these latent variables and disentangles them via three supervised learning modules. Extensive experimental results on two real-world datasets in the graph classification task reveal that our method not only significantly outperforms the traditional domain adaptation methods and the disentangled-based domain adaptation methods but also outperforms the state-of-the-art graph domain adaptation algorithms. The code is available at https://github.com/rynewu224/GraphDA .

10 August 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
PWPengfei Wei
Pengfei Wei
YKYiping Ke
Yiping Ke
CGChi Keong Goh
Chi Keong Goh
Heterogeneous domain adaptation needs supplementary information to link up different domains. However, such supplementary information may not always be available in real cases. In this paper, a new problem setting called hybrid domain adaptation is investigated. It is a special case of heterogeneous domain adaptation, in which different domains share some common features, but also have their own domain specific features. We leverage upon common features instead of supplementary information to achieve effective adaptation. We propose a general domain specific feature transfer framework, which can link up different domains using common features and simultaneously reduce domain divergences. Specifically, we first learn the translations between the common features and the domain specific features. Then we cross-use the learned translations to transfer the domain specific features of one domain to another domain. Finally, we compose a homogeneous space in which the domain divergences are minimized. We instantiate the general framework to a linear case and a nonlinear case. Extensive experiments verify the effectiveness of the two cases.

27 September 2018 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
PWPengfei Wei
Pengfei Wei
YKYiping Ke
Yiping Ke
CGChi Keong Goh
Chi Keong Goh
Marginalized stacked denoising autoencoder (mSDA), has recently emerged with demonstrated effectiveness in domain adaptation. In this paper, we investigate the rationale for why mSDA benefits domain adaptation tasks from the perspective of adaptive regularization. Our investigations focus on two types of feature corruption noise: Gaussian noise (mSDAg) and Bernoulli dropout noise (mSDAbd). Both theoretical and empirical results demonstrate that mSDAbd successfully boosts the adaptation performance but mSDAg fails to do so. We then propose a new mSDA with data-dependent multinomial dropout noise (mSDAmd) that overcomes the limitations of mSDAbd and further improves the adaptation performance. Our mSDAmd is based on a more realistic assumption: different features are correlated and, thus, should be corrupted with different probabilities. Experimental results demonstrate the superiority of mSDAmd to mSDAbd on the adaptation performance and the convergence speed. Finally, we propose a deep transferable feature coding (DTFC) framework for unsupervised domain adaptation. The motivation of DTFC is that mSDA fails to consider the distribution discrepancy across different domains in the feature learning process. We introduce a new element to mSDA: domain divergence minimization by maximum mean discrepancy. This element is essential for domain adaptation as it ensures the extracted deep features to have a small distribution discrepancy. The effectiveness of DTFC is verified by extensive experiments on three benchmark data sets for both Bernoulli dropout noise and multinomial dropout noise.

13 May 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
PWPengfei Wei
Pengfei Wei
YKYiping Ke
Yiping Ke
XQXinghua Qu
Xinghua Qu
TLTze-Yun Leong
Tze-Yun Leong
Reducing domain divergence is a key step in transfer learning. Existing works focus on the minimization of global domain divergence. However, two domains may consist of several shared subdomains, and differ from each other in each subdomain. In this article, we take the local divergence of subdomains into account in transfer. Specifically, we propose to use the low-dimensional manifold to represent the subdomain, and align the local data distribution discrepancy in each manifold across domains. A manifold maximum mean discrepancy (M3D) is developed to measure the local distribution discrepancy in each manifold. We then propose a general framework, called transfer with manifolds discrepancy alignment (TMDA), to couple the discovery of data manifolds with the minimization of M3D. We instantiate TMDA in the subspace learning case considering both the linear and nonlinear mappings. We also instantiate TMDA in the deep learning framework. Experimental studies show that TMDA is a promising method for various transfer learning tasks.

1 November 2019 in Neural Networks
Verified
Journal Article
Closed access
XXXiurui Xie
Xiurui Xie
GLGuisong Liu
Guisong Liu
QCQing Cai
Qing Cai
PWPengfei Wei
Pengfei Wei
HQHong Qu
Hong Qu

3 November 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
PWPengfei Wei
Pengfei Wei
YKYiping Ke
Yiping Ke
YOYew-Soon Ong
Yew-Soon Ong
ZMZejun Ma
Zejun Ma
Transfer regression is a practical and challenging problem with important applications in various domains, such as engineering design and localization. Capturing the relatedness of different domains is the key of adaptive knowledge transfer. In this paper, we investigate an effective way of explicitly modelling domain relatedness through transfer kernel, a transfer-specified kernel that considers domain information in the covariance calculation. Specifically, we first give the formal definition of transfer kernel, and introduce three basic general forms that well cover existing related works. To cope with the limitations of the basic forms in handling complex real-world data, we further propose two advanced forms. Corresponding instantiations of the two forms are developed, namely ${Trk}_{\alpha \beta }$ and ${Trk}_{\omega }$ based on multiple kernel learning and neural networks, respectively. For each instantiation, we present a condition with which the positive semi-definiteness is guaranteed and a semantic meaning is interpreted to the learned domain relatedness. Moreover, the condition can be easily used in the learning of TrGP $_{\alpha \beta }$ and TrGP $_{\omega }$ that are the Gaussian process models with the transfer kernels ${Trk}_{\alpha \beta }$ and ${Trk}_{\omega }$ respectively. Extensive empirical studies show the effectiveness of TrGP $_{\alpha \beta }$ and TrGP $_{\omega }$ on domain relatedness modelling and transfer adaptiveness.