paper-with-me

홈 › Papers

Neighborhood Commonality-aware Evolution Network for Continuous Generalized Category Discovery

2024-12-07 · Ye Wang, Yaxiong Wang, Guoshuai Zhao, Xueming Qian

Continuous Generalized Category Discovery (C-GCD) aims to continually discover novel classes from unlabelled image sets while maintaining performance on old classes. In this paper, we propose a novel learning framework, dubbed Neighborhood Commonality-aware Evolution Network (NCENet) that conquers this task from the perspective of representation learning. Concretely, to learn discriminative representations for novel classes, a Neighborhood Commonality-aware Representation Learning (NCRL) is designed, which exploits local commonalities derived neighborhoods to guide the learning of representational differences between instances of different classes. To maintain the representation ability for old classes, a Bi-level Contrastive Knowledge Distillation (BCKD) module is designed, which leverages contrastive learning to perceive the learning and learned knowledge and conducts knowledge distillation. Extensive experiments conducted on CIFAR10, CIFAR100, and Tiny-ImageNet demonstrate the superior performance of NCENet compared to the previous state-of-the-art method. Particularly, in the last incremental learning session on CIFAR100, the clustering accuracy of NCENet outperforms the second-best method by a margin of 3.09\% on old classes and by a margin of 6.32\% on new classes. Our code will be publicly available at \href{https://github.com/xjtuYW/NCENet.git}{https://github.com/xjtuYW/NCENet.git}. \end{abstract}

📄 PDF Abstract BibTeX arXiv:2412.05573

Code (0)

등록된 구현이 없습니다.

Tasks

Contrastive LearningIncremental LearningKnowledge DistillationRepresentation Learning

Methods 이 논문이 사용한 방법론

Contrastive Learning 설명 없음
Knowledge Distillation A very simple way to improve the performance of almost any machine learning algorithm is to train many different models on the same data and then to average their predictions.…

Similar Papers 제목 키워드 기반

Generalized Filippov solutions for systems with prescribed-time convergence

2023-03-06 · Richard Seeber

Dynamical systems with prescribed-time convergence sometimes feature a right-hand side exhibiting a singularity at the prescribed convergence time instant. In an open neighborhood of this singularity, classical absolutel…

Commonality in Few: Few-Shot Multimodal Anomaly Detection via Hypergraph-Enhanced Memory

2025-11-08 · Yuxuan Lin, Hanjing Yan, Xuan Tong, Yang Chang 외 arxiv

Few-shot multimodal industrial anomaly detection is a critical yet underexplored task, offering the ability to quickly adapt to complex industrial scenarios. In few-shot settings, insufficient training samples often fail…

Anomaly Detection

The Agent's First Day: Benchmarking Learning, Exploration, and Scheduling in the Workplace Scenarios

2026-01-13 · Daocheng Fu, Jianbiao Mei, Rong Wu, Xuemeng Yang 외 arxiv

The rapid evolution of Multi-modal Large Language Models (MLLMs) has advanced workflow automation; however, existing research mainly targets performance upper bounds in static environments, overlooking robustness for sto…

Continual Learning

Generalized Category Discovery in Federated Graph Learning

2026-05-05 · Zhongzheng Yuan, Lianshuai Guo, Xunkai Li, Wenyu Wang 외 arxiv

Federated Graph Learning (FGL) enables collaborative learning over distributed graph data, yet existing approaches largely rely on a closed-world assumption, limiting their applicability in dynamic environments where nov…

Graph Learning

Rigged Dynamic Mode Decomposition: Data-Driven Generalized Eigenfunction Decompositions for Koopman Operators

2024-05-01 · Matthew J. Colbrook, Catherine Drysdale, Andrew Horning

We introduce the Rigged Dynamic Mode Decomposition (Rigged DMD) algorithm, which computes generalized eigenfunction decompositions of Koopman operators. By considering the evolution of observables, Koopman operators tran…