Generalized Category Discovery with Decoupled Prototypical Network

نویسندگان

چکیده

Generalized Category Discovery (GCD) aims to recognize both known and novel categories from a set of unlabeled data, based on another dataset labeled with only categories. Without considering differences between categories, current methods learn about them in coupled manner, which can hurt model's generalization discriminative ability. Furthermore, the training approach prevents these models transferring category-specific knowledge explicitly data lose high-level semantic information impair model performance. To mitigate above limitations, we present called Decoupled Prototypical Network (DPN). By formulating bipartite matching problem for category prototypes, DPN not decouple achieve different targets effectively, but also align transfer capture semantics. more features through our proposed Semantic-aware Learning (SPL). Besides capturing meaningful information, SPL alleviate noise hard pseudo labels semantic-weighted soft assignment. Extensive experiments show that outperforms state-of-the-art by large margin all evaluation metrics across multiple benchmark datasets. Code are available at https://github.com/Lackel/DPN.

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

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

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

منابع مشابه

Prototypical category learning in high-functioning autism.

An ongoing debate in developmental cognitive neuroscience is whether individuals with autism are able to learn prototypical category representations from multiple exemplars. Prototype learning and memory were examined in a group of high-functioning autistic boys and young men, using a classic paradigm in which participants learned to classify novel dot patterns into one of two categories. Parti...

متن کامل

The category of generalized crossed modules

In the definition of a crossed module $(T,G,rho)$, the actions of the group $T$ and $G$ on themselves are given by conjugation. In this paper, we consider these actions to be arbitrary and thus generalize the concept of ordinary crossed module. Therefore, we get the category ${bf GCM}$, of all generalized crossed modules and generalized crossed module morphisms between them, and investigate som...

متن کامل

Network Discovery by Generalized Random Walks

We investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition probabilities (STP), for the average number of discovered edges as function of time. We show that for STP walks site and edge exploration obey the same scaling∼ n as f...

متن کامل

Fuzzy Prototypical Knowledge Discovery to predict information systems maintainability

This contribution presents a new approach, based on Fuzzy Prototypical Knowledge Discovery, to predict the maintainability of class diagrams done using the Unified Modelling Language (UML), which has great importance on the final quality of object-oriented information systems (OOIS). The prediction model is built from metrics values obtained at the early phases of OOIS life-cycle. We will start...

متن کامل

Network discovery with DCM

This paper is about inferring or discovering the functional architecture of distributed systems using Dynamic Causal Modelling (DCM). We describe a scheme that recovers the (dynamic) Bayesian dependency graph (connections in a network) using observed network activity. This network discovery uses Bayesian model selection to identify the sparsity structure (absence of edges or connections) in a g...

متن کامل

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


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

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i11.26475