提出动态标签层级下的在线持续学习新框架,解决层次结构演化带来的遗忘问题。
Online Continual Learning with Dynamic Label Hierarchies

- 基于可学习的分层原型自适应融合多头分类器
- 在多个基准上实现更高层次准确率与更少错误严重性
- 适合处理标签体系随时间演化的实际场景
在线持续学习(OCL)旨在从不断变化的数据流中持续学习,但现有方法多假设标签空间为扁平结构,忽略了真实世界概念中水平(兄弟类别)和垂直(粗粒度或细粒度类别)演化的层次组织。为此,我们提出新问题设定DHOCL(动态层次中的在线持续学习),其中分类体系在粒度上动态演变,且每个样本仅在单一层次提供监督信号。在此设定下,我们发现两个根本问题:(i) 混合粒度下的部分监督仅提供路径上的点状信号,限制了模型可塑性并破坏跨层次语义一致性;(ii) 动态演化的层次结构引发粒度相关干扰,破坏主流重放与正则化机制,加剧灾难性遗忘。为此,我们提出HALO(分层自适应学习与组织原型),通过可学习的分层原型正则化,自适应融合互补分类头,实现快速适应、层次一致性与结构化知识巩固。大量实验表明,HALO在多个基准上持续优于现有方法,显著提升层次准确率、降低错误严重性并改善持续性能。
原文摘要 · Abstract (English)
Online Continual Learning (OCL) aims to learn from endless non\text{-}stationary data streams, yet most existing methods assume a flat label space and overlook the hierarchical organization of real\text{-}world concepts that evolves both horizontally (sibling classes) and vertically (coarse or fine categories). To better reflect this context, we introduce a new problem setting, DHOCL (Online Continual Learning from Dynamic Hierarchies), where taxonomies evolve across granularities and each sample provides supervision at a single hierarchical level. In this setting, we find two fundamental issues: (i) partial supervision under mixed granularities provides only point-wise signals over an evolving path-wise hierarchy, which constrains plasticity and undermines cross-level semantic consistency, and (ii) the dynamically evolving hierarchies induce granularity-dependent interference, destabilizing popular replay and regularization mechanisms and thereby exacerbating catastrophic forgetting. To tackle these issues, we propose HALO (Hierarchical Adaptive Learning with Organized Prototypes), which adaptively combines complementary classification heads, regularized by organized learnable hierarchical prototypes, enabling rapid adaptation, hierarchical consistency, and structured knowledge consolidation as the taxonomy evolves. Extensive experiments on multiple benchmarks demonstrate that HALO consistently outperforms existing methods across hierarchical accuracy, mistake severity, and continual performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。