Adaprompt: Prompt Tuning with Adaptive Neighbours for Generalized Category Discovery

In this work, we address the challenging task of generalized category discovery, where the goal is to correctly classify unlabelled objects from previously seen classes, while also categorizing instances of completely new, unseen classes. Inspired by the remarkable success of prompt tuning of Vision Transformer models for this task, we propose two novel modifications to further improve their effectiveness. First, we propose to simultaneously perform parametric classification and representation learning with prompt tuning in an end-to-end learning framework, instead of a two-stage process of representation learning followed by clustering. Second, we introduce an adaptive neighborhood strategy for positive mining and contrastive learning, eliminating the need for large memory banks for affinity learning. We demonstrate the effectiveness and efficiency of our approach in comparison with the state-of-the-art methods on four benchmark datasets.

Authors

Institutions

Publication Details

Published
2024-09-27
DOI
https://doi.org/10.1109/icip51287.2024.10648034
Citations
1
Primary Topic
AI-based Problem Solving and Planning
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaprompt: Prompt Tuning with Adaptive Neighbours for Generalized Category Discovery

Soma Biswas, Anwesha Banerjee, Liyana Sahir
1 citations
AI-based Problem Solving and Planning
0.35
article

Adaprompt: Prompt Tuning with Adaptive Neighbours for Generalized Category Discovery

Soma Biswas, Anwesha Banerjee, Liyana Sahir
article en
1 citations

Abstract

In this work, we address the challenging task of generalized category discovery, where the goal is to correctly classify unlabelled objects from previously seen classes, while also categorizing instances of completely new, unseen classes. Inspired by the remarkable success of prompt tuning of Vision Transformer models for this task, we propose two novel modifications to further improve their effectiveness. First, we propose to simultaneously perform parametric classification and representation learning with prompt tuning in an end-to-end learning framework, instead of a two-stage process of representation learning followed by clustering. Second, we introduce an adaptive neighborhood strategy for positive mining and contrastive learning, eliminating the need for large memory banks for affinity learning. We demonstrate the effectiveness and efficiency of our approach in comparison with the state-of-the-art methods on four benchmark datasets.

Indian Institute of Science Bangalore (IN)
Openalex Percentile: Top 33%
AI-based Problem Solving and Planning
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.