Learning From a Complementary-Label Source Domain: Theory and Algorithms

نویسندگان

چکیده

In unsupervised domain adaptation (UDA), a classifier for the target is trained with massive true-label data from source and unlabeled domain. However, collecting in can be expensive sometimes impractical. Compared to true label (TL), complementary (CL) specifies class that pattern does not belong to, hence, CLs would less laborious than TLs. this article, we propose novel setting where composed of complementary-label data, theoretical bound provided. We consider two cases setting: one only contains [completely UDA (CC-UDA)] other has plenty small amount [partly (PC-UDA)]. To end, c omplementary xmlns:xlink="http://www.w3.org/1999/xlink">l abel advers xmlns:xlink="http://www.w3.org/1999/xlink">aria l xmlns:xlink="http://www.w3.org/1999/xlink">net work (CLARINET) proposed solve CC-UDA PC-UDA problems. CLARINET maintains deep networks simultaneously, focusing on classifying taking care source-to-target distributional adaptation. Experiments show significantly outperforms series competent baselines handwritten digit-recognition object-recognition tasks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transition from Kinetic Theory to Macroscopic Fluid Equations: a Problem for Domain Decomposition and a Source for New Algorithms

In the paper we discuss the transition from kinetic theory to macroscopic uid equations, where the macroscopic equations are deened as asymptotic limits of a kinetic equation. This relation can be used to derive computationally eecient domain decomposition schemes for the simulation of rareeed gas ows close to the continuum limit. Moreover, we present some basic ideas for the derivation of kine...

متن کامل

Domain Adaptation for Learning from Label Proportions Using Self-Training

Learning from Label Proportions (LLP) is a machine learning problem in which the training data consist of bags of instances, and only the class label distribution for each bag is known. In some domains label proportions are readily available; for example, by grouping social media users by location, one can use census statistics to build a classifier for user demographics. However, label proport...

متن کامل

Active Learning Algorithms for Multi-label Data

The iterative supervised learning setting, in which learning algorithms can actively query an oracle for labels, e.g. a human annotator that understands the nature of the problem, is called active learning. As the learner is allowed to interactively choose the data from which it learns, it is expected that the learner would perform better with less training. The active learning approach is appr...

متن کامل

Learning from Complementary Labels

Collecting labeled data is costly and thus is a critical bottleneck in real-world classification tasks. To mitigate the problem, we consider a complementary label, which specifies a class that a pattern does not belong to. Collecting complementary labels would be less laborious than ordinary labels since users do not have to carefully choose the correct class from many candidate classes. Howeve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on neural networks and learning systems

سال: 2022

ISSN: ['2162-237X', '2162-2388']

DOI: https://doi.org/10.1109/tnnls.2021.3086093