Hierarchically Gated Experts for Efficient Online Continual Learning
원문 초록
Continual Learning models aim to learn a set of tasks under the constraint that the tasks arrive sequentially with no way to access data from previous tasks. The Online Continual Learning framework poses a further challenge where the tasks are unknown and instead the data arrives as a single stream. Building on existing work, we propose a method for identifying these underlying tasks: the Gated Experts (GE) algorithm, where a dynamically growing set of experts allows for new knowledge to be acquired without catastrophic forgetting. Furthermore, we extend GE to Hierarchically Gated Experts (HGE), a method which is able to efficiently select the best expert for each data sample by organising the experts into a hierarchical structure. On standard Continual Learning benchmarks, GE and HGE are able to achieve results comparable with current methods, with HGE doing so more efficiently.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Questioning Representational Optimism in Deep Learning: The Fractured Entangled Representation Hypothesis
LifelongPR: Lifelong knowledge fusion for point cloud place recognition based on replay and prompt learning
Rethinking Query-based Transformer for Continual Image Segmentation
Addressing Imbalanced Domain-Incremental Learning through Dual-Balance Collaborative Experts
PSAT: Pediatric Segmentation Approaches via Adult Augmentations and Transfer Learning
Remember Past, Anticipate Future: Learning Continual Multimodal Misinformation Detectors
토론
이 논문과 연결된 포럼 글이 아직 없습니다.