Cited by 619Domain Adaptation and Few-Shot LearningAdvanced Neural Network ApplicationsMachine Learning and Algorithms

Expert Gate: Lifelong Learning with a Network of Experts

Aljundi, Rahaf, Chakravarty, Punarjay, Tuytelaars, Tinne·2017·2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

Abstract

In this paper we introduce a model of lifelong learning, based on a Network of Experts. New tasks / experts are learned and added to the model sequentially, building on what was learned before. To ensure scalability of this process, data from previous tasks cannot be stored and hence is not available when learning a new task. A critical issue in such context, not addressed in the literature so far, relates to the decision which expert to deploy at test time. We introduce a set of gating autoencoders that learn a representation for the task at hand, and, at test time, automatically forward the test sample to the relevant expert. This also brings memory efficiency as only one expert network has to be loaded into memory at any given time. Further, the autoencoders inherently capture the relatedness of one task to another, based on which the most relevant prior model to be used for training a new expert, with fine-tuning or learning-without-forgetting, can be selected. We evaluate our method on image classification and video prediction problems.

Integrity signals

Registry

Crossref · 10.1109/cvpr.2017.753

Cites

42 of 42 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The standard LLL setup consists of a sequence of disjoint tasks learned one after the other, where tasks may correspond to different datasets or different splits of a dataset without overlap in category labels.

    “It focuses on image classification and consists of a sequence of disjoint tasks , which are learned one after the other. Tasks may correspond to different datasets, or different splits of a dataset, without overlap in category labels.”

    From Memory Aware Synapses: Learning What (not) to Forget (2018) · cites this paper as [1]

  • Data-based approaches use data from the new task to approximate the performance of the previous tasks, and this works best if the data distribution mismatch between tasks is limited.

    “Data-based approaches [1,17,28,34] use data from the new task to approximate the performance of the previous tasks. This works best if the data distribution mismatch between tasks is limited.”

    From Memory Aware Synapses: Learning What (not) to Forget (2018) · cites this paper as [1]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Aljundi, R., Chakravarty, P., & Tuytelaars, T.
Affiliations
IMEC (BE)
Venue
2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Publisher
IEEE
Published
2017-07
Pages
7120-7129
ISSN
1063-6919 (ISSN-L)
OpenAlex
W2554616628
Cited by
619
References
42
Citations by year
2026: 47 · 2025: 81 · 2024: 108 · 2023: 117 · 2022: 84 · 2021: 73 · 2020: 56 · 2019: 35 · 2018: 17 · 2017: 1
FWCI
13.60
Type
conference paper
Language
en
Open access
closed
Locations
  • IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings (publishedVersion)
  • Lirias (KU Leuven) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
Keywords
lifelong learning, memory efficiency, learning without forgetting, fine-tuning, task relatedness, image classification, video prediction

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review