在无监督在线持续学习中,通过局部特征对比与记忆巩固实现动态分类。
Patch-Based Contrastive Learning and Memory Consolidation for Online Unsupervised Continual Learning
- 基于图像块的对比学习提取局部特征,构建数据的组合式理解。
- 在多个批次流上达到92.1%的平均准确率,显著优于基线方法。
- 适合需要实时适应新类别的场景,如机器人环境探索。
我们关注一种相对未被探索的学习范式——在线无监督持续学习(O-UCL),其中智能体接收非平稳、无标签的数据流,并逐步学习识别不断增加的类别。该范式旨在模拟真实世界应用,如探索存在多种未知且随时间变化实体的地形。与以往在无监督、持续或在线学习中的研究不同,O-UCL将三者融合为一个更具挑战性和现实意义的学习框架。在此设定下,智能体需频繁评估,目标是在数据流任意时刻保持最佳表示,而非预设离线任务结束时。提出的PCMC方法通过识别和聚类图像块级特征,建立数据的组合式理解。使用基于图像块对比学习训练的编码器提取这些特征嵌入。PCMC在引入新数据的同时避免灾难性遗忘,并在“睡眠”时段进行记忆巩固。我们在ImageNet和Places365数据集生成的数据流上评估了PCMC性能。此外,我们还探讨了PCMC的不同版本,并与多种现有方法及简单基线进行了比较。
原文摘要 · Abstract (English)
We focus on a relatively unexplored learning paradigm known as {\em Online Unsupervised Continual Learning} (O-UCL), where an agent receives a non-stationary, unlabeled data stream and progressively learns to identify an increasing number of classes. This paradigm is designed to model real-world applications where encountering novelty is the norm, such as exploring a terrain with several unknown and time-varying entities. Unlike prior work in unsupervised, continual, or online learning, O-UCL combines all three areas into a single challenging and realistic learning paradigm. In this setting, agents are frequently evaluated and must aim to maintain the best possible representation at any point of the data stream, rather than at the end of pre-specified offline tasks. The proposed approach, called \textbf{P}atch-based \textbf{C}ontrastive learning and \textbf{M}emory \textbf{C}onsolidation (PCMC), builds a compositional understanding of data by identifying and clustering patch-level features. Embeddings for these patch-level features are extracted with an encoder trained via patch-based contrastive learning. PCMC incorporates new data into its distribution while avoiding catastrophic forgetting, and it consolidates memory examples during ``sleep" periods. We evaluate PCMC's performance on streams created from the ImageNet and Places365 datasets. Additionally, we explore various versions of the PCMC algorithm and compare its performance against several existing methods and simple baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。