Zhen Fang

Zhen Fang

Auto-generated profile, based on publicly available information

Zhen Fang

University of Technology Sydney

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
3 September 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZFZhen Fang
Zhen Fang
JLJie Lu
Jie Lu
FLFeng Liu
Feng Liu
JXJunyu Xuan
Junyu Xuan
GZGuangquan Zhang
Guangquan Zhang
The aim of unsupervised domain adaptation is to leverage the knowledge in a labeled (source) domain to improve a model's learning performance with an unlabeled (target) domain--the basic strategy being to mitigate the effects of discrepancies between the two distributions. Most existing algorithms can only handle unsupervised closed set domain adaptation (UCSDA), i.e., where the source and target domains are assumed to share the same label set. In this article, we target a more challenging but realistic setting: unsupervised open set domain adaptation (UOSDA), where the target domain has unknown classes that are not found in the source domain. This is the first study to provide learning bound for open set domain adaptation, which we do by theoretically investigating the risk of the target classifier on unknown classes. The proposed learning bound has a special term, namely, open set difference, which reflects the risk of the target classifier on unknown classes. Furthermore, we present a novel and theoretically guided unsupervised algorithm for open set domain adaptation, called distribution alignment with open difference (DAOD), which is based on regularizing this open set difference bound. The experiments on several benchmark data sets show the superior performance of the proposed UOSDA method compared with the state-of-the-art methods in the literature.

16 November 2021 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
JDJiahua Dong
Jiahua Dong
YCYang Cong
Yang Cong
Gan SunGan Sun
Gan Sun
ZFZhen Fang
Zhen Fang
Zhengming DingZhengming Ding
Zhengming Ding
Unsupervised domain adaptation without accessing expensive annotation processes of target data has achieved remarkable successes in semantic segmentation. However, most existing state-of-the-art methods cannot explore whether semantic representations across domains are transferable or not, which may result in the negative transfer brought by irrelevant knowledge. To tackle this challenge, in this paper, we develop a novel K nowledge A ggregation-induced T ransferability P erception (KATP) module for unsupervised domain adaptation, which is a pioneering attempt to distinguish transferable or untransferable knowledge across domains. Specifically, the KATP module is designed to quantify which semantic knowledge across domains is transferable, by incorporating the transferability information propagation from constructed global category-wise prototypes. Based on KATP, we design a novel KATP Adaptation Network (KATPAN) to determine where and how to transfer. The KATPAN contains a transferable appearance translation module $\mathcal {T}_A(\cdot)$ and a transferable representation augmentation module $\mathcal {T}_R(\cdot)$ , where both modules construct a virtuous circle of performance promotion. $\mathcal {T}_A(\cdot)$ develops a transferability-aware information bottleneck to highlight where to adapt transferable visual characterizations and modality information; $\mathcal {T}_R(\cdot)$ explores how to augment transferable representations while abandoning untransferable information, and promotes the translation performance of $\mathcal {T}_A(\cdot)$ in return. Comprehensive experiments on several representative benchmark datasets and a medical dataset support the state-of-the-art performance of our model.

27 January 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Open access
ZFZhen Fang
Zhen Fang
JLJie Lu
Jie Lu
FLFeng Liu
Feng Liu
GZGuangquan Zhang
Guangquan Zhang
Semi-supervised heterogeneous domain adaptation (SsHeDA) aims to train a classifier for the target domain, in which only unlabeled and a small number of labeled data are available. This is done by leveraging knowledge acquired from a heterogeneous source domain. From algorithmic perspectives, several methods have been proposed to solve the SsHeDA problem; yet there is still no theoretical foundation to explain the nature of the SsHeDA problem or to guide new and better solutions. Motivated by compatibility condition in semi-supervised probably approximately correct (PAC) theory, we explain the SsHeDA problem by proving its generalization error – that is, why labeled heterogeneous source data and unlabeled target data help to reduce the target risk. Guided by our theory, we devise two algorithms as proof of concept. One, kernel heterogeneous domain alignment (KHDA), is a kernel-based algorithm; the other, joint mean embedding alignment (JMEA), is a neural network-based algorithm. When a dataset is small, KHDA’s training time is less than JMEA’s. When a dataset is large, JMEA is more accurate in the target domain. Comprehensive experiments with image/text classification tasks show KHDA to be the most accurate among all non-neural network baselines, and JMEA to be the most accurate among all baselines.

29 October 2021 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
LZLi Zhong
Li Zhong
ZFZhen Fang
Zhen Fang
FLFeng Liu
Feng Liu
BYBo Yuan
Bo Yuan
GZGuangquan Zhang
Guangquan Zhang
JLJie Lu
Jie Lu
In the unsupervised open set domain adaptation (UOSDA), the target domain contains unknown classes that are not observed in the source domain. Researchers in this area aim to train a classifier to accurately: 1) recognize unknown target data (data with unknown classes) and 2) classify other target data. To achieve this aim, a previous study has proven an upper bound of the target-domain risk, and the open set difference, as an important term in the upper bound, is used to measure the risk on unknown target data. By minimizing the upper bound, a shallow classifier can be trained to achieve the aim. However, if the classifier is very flexible [e.g., deep neural networks (DNNs)], the open set difference will converge to a negative value when minimizing the upper bound, which causes an issue where most target data are recognized as unknown data. To address this issue, we propose a new upper bound of target-domain risk for UOSDA, which includes four terms: source-domain risk, ε-open set difference ( $Δ_ε $ ), distributional discrepancy between domains, and a constant. Compared with the open set difference, $Δ_ε $ is more robust against the issue when it is being minimized, and thus we are able to use very flexible classifiers (i.e., DNNs). Then, we propose a new principle-guided deep UOSDA method that trains DNNs via minimizing the new upper bound. Specifically, source-domain risk and $Δ_ε $ are minimized by gradient descent, and the distributional discrepancy is minimized via a novel open set conditional adversarial training strategy. Finally, compared with the existing shallow and deep UOSDA methods, our method shows the state-of-the-art performance on several benchmark datasets, including digit recognition [modified National Institute of Standards and Technology database (MNIST), the Street View House Number (SVHN), U.S. Postal Service (USPS)], object recognition (Office-31, Office-Home), and face recognition [pose, illumination, and expression (PIE)].

17 June 2021 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YZYiyang Zhang
Yiyang Zhang
FLFeng Liu
Feng Liu
ZFZhen Fang
Zhen Fang
BYBo Yuan
Bo Yuan
GZGuangquan Zhang
Guangquan Zhang
JLJie Lu
Jie Lu
In unsupervised domain adaptation (UDA), a classifier for the target domain is trained with massive true-label data from the source domain and unlabeled data from the target domain. However, collecting true-label data in the source domain can be expensive and sometimes impractical. Compared to the true label (TL), a complementary label (CL) specifies a class that a pattern does not belong to, and hence, collecting CLs would be less laborious than collecting TLs. In this article, we propose a novel setting where the source domain is composed of complementary-label data, and a theoretical bound of this setting is provided. We consider two cases of this setting: one is that the source domain only contains complementary-label data [completely complementary UDA (CC-UDA)] and the other is that the source domain has plenty of complementary-label data and a small amount of true-label data [partly complementary UDA (PC-UDA)]. To this end, a complementary label adversarial network (CLARINET) is proposed to solve CC-UDA and PC-UDA problems. CLARINET maintains two deep networks simultaneously, with one focusing on classifying the complementary-label source data and the other taking care of the source-to-target distributional adaptation. Experiments show that CLARINET significantly outperforms a series of competent baselines on handwritten digit-recognition and object-recognition tasks.

16 April 2024 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
KSKuo Shi
Kuo Shi
JLJie Lu
Jie Lu
ZFZhen Fang
Zhen Fang
GZGuangquan Zhang
Guangquan Zhang
Unsupervised Domain Adaptation (UDA) addresses the challenge of distribution shift between a labeled source domain and an unlabeled target domain by utilizing knowledge from the source. Traditional UDA methods mainly focus on single-modal scenarios, either vision or language, thus not fully exploring the advantages of multi-modal representations. Vision-Language models utilize multi-modal information, applying prompt learning techniques for addressing target domain tasks. Motivated by the recent advancements in pre-trained Vision-Language models, this paper expands the UDA framework to incorporate multi-modal approaches using fuzzy techniques. The adoption of fuzzy techniques, preferred over conventional domain adaptation methods, is based on two key aspects: the nature of prompt learning is intrinsically linked to fuzzy logic, and the superior capability of fuzzy techniques in processing soft information and effectively utilizing inherent relationships both within and across domains. To this end, we propose UDA enhanced by Fuzz y Prompt Le arning (FUZZLE), a simple and effective method for aligning the source and target domains via domain-specific prompt learning. Specifically, we introduce a novel technique to enhance prompt learning in the target domain. This method integrates fuzzy C-means clustering and a novel instance-level fuzzy vector into the prompt learning loss function, minimizing the distance between prompt cluster centers and instance prompts, thereby enhancing the prompt learning process. In addition, we propose a Kullback-Leibler (KL) divergence-based loss function with a fuzzification factor. This function is designed to minimize the distribution discrepancy in the classification of similar cross-domain data, aligning domain-specific prompts during the training process. We contribute an in-depth analysis to understand the effectiveness of Extensive experiments demonstrate that our method achieves superior performance on standard UDA benchmarks.