Goto

Collaborating Authors

 gada


NI-UDA: Graph Adversarial Domain Adaptation from Non-shared-and-Imbalanced Big Data to Small Imbalanced Applications

Xiao, Guangyi, Xiang, Weiwei, Liu, Huan, Chen, Hao, Peng, Shun, Guo, Jingzhi, Gong, Zhiguo

arXiv.org Artificial Intelligence

We propose a new general Graph Adversarial Domain Adaptation (GADA) based on semantic knowledge reasoning of class structure for solving the problem of unsupervised domain adaptation (UDA) from the big data with non-shared and imbalanced classes to specified small and imbalanced applications (NI-UDA), where non-shared classes mean the label space out of the target domain. Our goal is to leverage priori hierarchy knowledge to enhance domain adversarial aligned feature representation with graph reasoning. In this paper, to address two challenges in NI-UDA, we equip adversarial domain adaptation with Hierarchy Graph Reasoning (HGR) layer and the Source Classifier Filter (SCF). For sparse classes transfer challenge, our HGR layer can aggregate local feature to hierarchy graph nodes by node prediction and enhance domain adversarial aligned feature with hierarchy graph reasoning for sparse classes. Our HGR contributes to learn direct semantic patterns for sparse classes by hierarchy attention in self-attention, non-linear mapping and graph normalization. our SCF is proposed for the challenge of knowledge sharing from non-shared data without negative transfer effect by filtering low-confidence non-shared data in HGR layer. Experiments on two benchmark datasets show our GADA methods consistently improve the state-of-the-art adversarial UDA algorithms, e.g. GADA(HGR) can greatly improve f1 of the MDD by \textbf{7.19\%} and GVB-GD by \textbf{7.89\%} respectively on imbalanced source task in Meal300 dataset. The code is available at https://gadatransfer.wixsite.com/gada.


Enlarging Discriminative Power by Adding an Extra Class in Unsupervised Domain Adaptation

Tran, Hai H., Ahn, Sumyeong, Lee, Taeyoung, Yi, Yung

arXiv.org Machine Learning

In this paper, we study the problem of unsupervised domain adaptation that aims at obtaining a prediction model for the target domain using labeled data from the source domain and unlabeled data from the target domain. There exists an array of recent research based on the idea of extracting features that are not only invariant for both domains but also provide high discriminative power for the target domain. In this paper, we propose an idea of empowering the discriminativeness: Adding a new, artificial class and training the model on the data together with the GAN-generated samples of the new class. The trained model based on the new class samples is capable of extracting the features that are more discriminative by repositioning data of current classes in the target domain and therefore drawing the decision boundaries more effectively. Our idea is highly generic so that it is compatible with many existing methods such as DANN, VADA, and DIRT-T. We conduct various experiments for the standard data commonly used for the evaluation of unsupervised domain adaptations and demonstrate that our algorithm achieves the SOTA performance for many scenarios.


Tax robots and Universal Basic Income

#artificialintelligence

Technological innovation is moving at an ever-accelerating pace, and this comes with vast benefits and inevitable changes to our way of life. One downside is that machine learning and automation are already replacing jobs, and this will increase rapidly. It also has the potential to replace much of that income with Universal Basic Income (UBI), or government cash handouts to all adult citizens, perhaps starting with covering some element of taxes and rising in the range of $100,000/year per citizen within the next 20 years. Proponents of UBI include well-known figures such as Mark Zuckerberg, Richard Branson and Elon Musk. Musk stated last year that he believed job loss would be so severe due to automation that some form of UBI will be necessary to support our society.