The DOI matches its Crossref record; 36 of the 37 references it cites were found in a registry or an index; none of the 28 sources its claims cite is checked for support yet.
Memory Aware Synapses: Learning What (not) to Forget
Open accessAbstract
Humans can learn in a continuous manner. Old rarely utilized knowledge can be overwritten by new incoming information while important, frequently used knowledge is prevented from being erased. In artificial learning systems, lifelong learning so far has focused mainly on accumulating knowledge over tasks and overcoming catastrophic forgetting. In this paper, we argue that, given the limited model capacity and the unlimited new information to be learned, knowledge has to be preserved or erased selectively. Inspired by neuroplasticity, we propose a novel approach for lifelong learning, coined Memory Aware Synapses (MAS). It computes the importance of the parameters of a neural network in an unsupervised and online manner. Given a new sample which is fed to the network, MAS accumulates an importance measure for each parameter of the network, based on how sensitive the predicted output function is to a change in this parameter. When learning a new task, changes to important parameters can then be penalized, effectively preventing important knowledge related to previous tasks from being overwritten. Further, we show an interesting connection between a local version of our method and Hebb's rule,which is a model for the learning process in the brain. We test our method on a sequence of object recognition tasks and on the challenging problem of learning an embedding for predicting $ $ triplets. We show state-of-the-art performance and, for the first time, the ability to adapt the importance of the parameters based on unlabeled data towards what the network needs (not) to forget, which may vary depending on test conditions.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
Memory Aware Synapses (MAS) estimates each network parameter’s importance from the sensitivity of the learned function’s output, not the loss, so importance can be computed online and unsupervised on labeled or unlabeled data. It penalizes changes to important parameters when learning new tasks and reports state-of-the-art lifelong learning results on object recognition and fact-learning embedding tasks.
Key findings
- MAS reduces catastrophic forgetting in object recognition: in two-task sequences it achieves average forgetting around 1%, while FineTune drops 8–13%; in an 8-task sequence MAS has average forgetting of 0.49% and average accuracy 52.695, compared with SI at 50.49 and Finetune at 32.67.
- In fact learning on the 6DS dataset, MAS reaches overall MAP 0.29 on a 4-task random split versus SI 0.25 and Finetune 0.18; using both training and test data for importance further improves MAS to 0.30.
- MAS can adapt importance to unlabeled test conditions: for the Krishna Kamal flower subset, forgetting was 2% versus 8% on the whole Flower dataset, and last-task accuracy was 84% instead of 69% without adaptation; on a sports-fact subset, MAS reached 0.50 MAP while Finetune and SI were close to 0.20.
- A local variant, l-MAS, is linked to Hebbian learning and computes importance from neuron activation correlations; it is faster but less accurate, with average forgetting of 3% versus 1% for global MAS.
Methods
- MAS is a model-based lifelong learning method: after convergence, it accumulates an importance weight Ω_ij for each parameter by measuring how sensitive the squared ℓ2 norm of the learned function output is to parameter changes over available data points.
- When learning a new task, it adds a regularizer that penalizes changes to parameters with high Ω_ij, allowing low-importance parameters to adapt; Ω can be updated online and computed on training, validation, or unlabeled test data.
- Experiments use AlexNet pretrained on ImageNet for sequences of object recognition datasets (MIT Scenes, Caltech-UCSD Birds, Oxford Flowers, Stanford Cars, FGVCAircraft, VOC Actions, Letters, SVHN) and a VGG-16-based embedding model on the 6DS fact-learning dataset, reporting classification accuracy and mean average precision (MAP).
Limitations
- The paper states that l-MAS is faster but less accurate than global MAS, with average forgetting of 3% versus 1%.
- The paper states that λ was set to 1 in object recognition experiments without tuning, because it assumes no access to previous task data.
- Not explicitly stated as a limitation, but evident from the text: the object recognition setup assumes an oracle at test time to select the task-specific classification head, and separate unshared heads per task.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
34 Own interpretation · 28 Own result · 15 Not checked yet · 12 No basis given · 1 Own method
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, here, our method differentiates itself clearly, showing 6 % better MAP on the first two tasks compared to SI .”
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“SI [39] followed by EWC [12] has the least forgetting among our methods competitors.”
What the sources say
- Not checked yetcites [39] Zenke, F., Poole, B., Ganguli, S.: Improved multitask learning through synaptic intelligence. In: Proceedings of the International Conference on Machine Learning (ICML) (2017)
- Not checked yetcites [12] Kirkpatrick, J., et al.: Overcoming catastrophic forgetting in neural networks. arXiv preprint arXiv:1612.00796 (2016)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We observe no significant difference on forgetting over 3 random trials where we get a mean, over 6 numbers, of 0 . 51% ± 0 . 18 for the drop on the first task in the vector output case compared to 0 . 50% ± 0 . 19 for the ℓ 2 2 norm case.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Table 3 shows, independent from the set used for computing the importance of the weights, for both l-MAS and MAS the preservation of the previous task and the performance on the current task are quite similar.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“At the end of the sequence, we observe a minimal forgetting on that subset of 2% compared to 8% forgetting on the Flower dataset as a whole.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“for the first time, the ability to adapt the importance of the parameters based on unlabeled data towards what the network needs (not) to forget, which may vary depending on test conditions.”
- Also stated in: § 1 Introduction · p. 2 · plain
“our LLL method can learn what parts of the model are important using unlabelled data . This allows for adaptation to specific test conditions and continuous updating of importance weights.”
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § 1 Introduction · p. 2 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“MAS , our method, shows a minimal or no forgetting on the different tasks in the sequence with an average forgetting of 0 . 49% .”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“After Finetune that doesn't treat forgetting, our method has the least amount of memory consumption.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, looking at existing LLL solutions, we observe that none of them satisfies all the characteristics one would expect or desire from a lifelong learning approach (see Table 1).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As shown in Table 2, FineTune clearly suffers from catastrophic forgetting with a drop in performance from 8% to 13% .”
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- It may state two separate claims as one. 39
- Probably not a substantial claim. 19
None of the sources cited for this claim have been checked yet.
In the paper
“LwF [17] suffers from a buildup of errors when facing a long sequence while EBLL [28] reduces slightly this effect.”
What the sources say
- Not checked yetcites [17] Li, Z., Hoiem, D.: Learning without forgetting. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9908, pp. 614–629. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46493-0_37 source
- Not checked yetcites [28] Rannen, A., Aljundi, R., Blaschko, M.B., Tuytelaars, T.: Encoder based lifelong learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1320–1328 (2017) source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Note that IMM grows linearly in storage, but at inference time it only uses the obtained model.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Overall, MAS achieves a MAP of 0 . 29 compared to 0 . 25 by SI and only 0 . 18 by Finetune .”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We test our method on a sequence of object recognition tasks and on the challenging problem of learning an embedding for predicting < subject, predicate, object > triplets. We show state-of-the-art performance”
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“On average, our method method achieves the lowest forgetting rates (around 1% ) while performance on the new task is almost similar ( 0 -3% lower).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Our method requires a constant amount of memory and enjoys the main desired characteristics of lifelong learning we listed above while achieving stateof-the-art performance.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Further, computing the gradients locally at each layer for l-MAS allows for faster computations but less accurate estimations. As such, l-MAS shows an average forgetting of 3% compared to 1% by MAS .”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“IMM [16] merges the models at the end of the sequence and the drop in performance differs between tasks. More importantly, the method performance on the last task is highly affected by the moment matching.”
What the sources say
- Not checked yetcites [16] Lee, S.W., Kim, J.H., Jun, J., Ha, J.W., Zhang, B.T.: Overcoming catastrophic forgetting by incremental moment matching. In: Advances in Neural Information Processing Systems, pp. 4652–4662 (2017)
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Finetuning suffers from a severe forgetting on the previous tasks while being advantageous for the last task, as expected.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our MAS (pink) succeeds to learn that this set is important to preserve and achieves a performance of 0.50 at the end of the sequence, while the performance of finetuning and SI on this set was close to 0.20.”
plainn = 7- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As such, using ℓ 2 2 is n times faster (where n is the length of the output vector) without loss in performance.”
plaindirectn = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This makes our method not only more versatile, but also simpler, more memory-efficient, and, as it turns out, more effective in learning what not to forget, compared to other model-based LLL approaches.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is worth noting that our method's absolute performance on average including the last task is 2% better than SI which indicates our method ability to accurately estimate the importance weights and the new tasks to adjust accordingly.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We see the sensitivity around λ = 1 is very low with low forgetting, although further improvements could be achieved.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Similar to previous experiments, Finetune is only advantageous on the last task while drastically suffering on the previous tasks.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“All the considered methods manage to reduce the forgetting over fine-tuning significantly while having performance close to fine-tuning on the new task.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“SI [39] and MAS (ours) need the same offline storage requirements (importance weights and model parameters). However, at training phase, SI needs additional memory to accumulate the contributions of each parameter to the change in the loss.”
What the sources say
- Not checked yetcites [39] Zenke, F., Poole, B., Ganguli, S.: Improved multitask learning through synaptic intelligence. In: Proceedings of the International Conference on Machine Learning (ICML) (2017)
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“After the third task, as shown in figure F2, the Adaptive projections are closer to the original ones than the Non Adaptive that considers this subset as part of the full task being preserved and tries to prevent forgetting them as well. Finetuning started destroying the learned topology of this subset and lies further apart.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It can be seen that the Adaptive and Non Adaptive variants of our method try to preserve the projections from this subset. The adaptive projections are closer to the original one, if we look closely, while Finetuning projections starts drifting away from where they were.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Finetuning needs no additional memory requirements other than the model and the tasks' heads.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“In spite of the fact that IMM [16] consumes the same amount of memory as Finetuning while training, it requires an offline storage that increases linearly with the number of tasks. That's due to the storage of a Fisher information matrix for each task and previous tasks models.”
What the sources say
- Not checked yetcites [16] Lee, S.W., Kim, J.H., Jun, J., Ha, J.W., Zhang, B.T.: Overcoming catastrophic forgetting by incremental moment matching. In: Advances in Neural Information Processing Systems, pp. 4652–4662 (2017)
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“LwF [17], while training a new task, needs to load the last task model and all the previous heads to get the target predictions. However, LwF has the same offline storage requirements between tasks as Finetuning.”
What the sources say
- Not checked yetcites [17] Li, Z., Hoiem, D.: Learning without forgetting. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9908, pp. 614–629. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46493-0_37 source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Nevertheless, the Adaptive MAS and Non Adaptive MAS still preserve the topology of the learned projections. The Adaptive projections lie closer and look more similar to the originals than the Non Adaptive MAS. Finetune, on the other hand, forgets completely about this subset and all the samples get projected in one point where it becomes quite hard to recognize their corresponding facts.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Model-based approaches [6,12,16,39], like our method, focus on the parameters of the network instead of depending on the task data.”
What the sources say
- Not checked yetcites [6] Fernando, C., et al.: PathNet: evolution channels gradient descent in super neural networks. arXiv preprint arXiv:1701.08734 (2017)
- Not checked yetcites [12] Kirkpatrick, J., et al.: Overcoming catastrophic forgetting in neural networks. arXiv preprint arXiv:1612.00796 (2016)
- Not checked yetcites [16] Lee, S.W., Kim, J.H., Jun, J., Ha, J.W., Zhang, B.T.: Overcoming catastrophic forgetting by incremental moment matching. In: Advances in Neural Information Processing Systems, pp. 4652–4662 (2017)
- Not checked yetcites [39] Zenke, F., Poole, B., Ganguli, S.: Improved multitask learning through synaptic intelligence. In: Proceedings of the International Conference on Machine Learning (ICML) (2017)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Yet in practice, the biggest challenge is to avoid catastrophic forgetting of the old tasks' knowledge (i.e., forgetting how to perform the old tasks well).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This calls for a LLL method that can learn what (not) to forget using unlabeled test data.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In contrast to the above two methods, we propose to look at the sensitivity of the learned function, rather than the loss. This simplifies the setup considerably since, unlike the loss, the learned function is not in a local minimum, so complications with gradients being close to zero are avoided.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Hence, we only need to compute one backward pass and can use the resulting gradients for estimating the parameters importance.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This is achieved by estimating importance weights for the network parameters without relying on the loss, but by looking at the sensitivity of the output function instead. This way, our method not only avoids the need for labeled data, but importantly it also avoids complications due to the loss being in a local minimum, resulting in gradients being close to zero.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Using our method, for regions in the input space that are sampled densely, the function will be preserved and catastrophic forgetting is avoided. However, parameters not affecting those regions will be given low importance weights, and can be used to optimize the function for other tasks, affecting the function over other regions of the input space.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Yet in our case, these importance weights approximate the sensitivity of the learned function to a parameter change rather than a measure of the (inverse of) parameter uncertainty, as in [12], or the sensitivity of the loss to a parameter change, as in [39]”
What the sources say
- Not checked yetcites [12] Kirkpatrick, J., et al.: Overcoming catastrophic forgetting in neural networks. arXiv preprint arXiv:1612.00796 (2016)
- Not checked yetcites [39] Zenke, F., Poole, B., Ganguli, S.: Improved multitask learning through synaptic intelligence. In: Proceedings of the International Conference on Machine Learning (ICML) (2017)
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“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.”
What the sources say
- Not checked yetcites [1] Aljundi, R., Chakravarty, P., Tuytelaars, T.: Expert gate: lifelong learning with a network of experts. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017) source
- Not checked yetcites [17] Li, Z., Hoiem, D.: Learning without forgetting. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9908, pp. 614–629. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46493-0_37 source
- Not checked yetcites [28] Rannen, A., Aljundi, R., Blaschko, M.B., Tuytelaars, T.: Encoder based lifelong learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1320–1328 (2017) source
- Not checked yetcites [34] Shmelkov, K., Schmid, C., Alahari, K.: Incremental learning of object detectors without catastrophic forgetting. In: The IEEE International Conference on Computer Vision (ICCV) (2017) source
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We can conclude that applying Hebb's rule to measure the importance of the parameters in a neural network can be seen as a local variant of our method that considers only one layer at a time instead of the global function learned by the network.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Further, the method can be added after the network is trained. It can be applied on top of any pretrained network and compute the importance on any set of data without the need to have the labels.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The global version needs to compute the gradients of the output function while the local variant (Hebbian based) can be computed locally by multiplying the input with the output of the connecting neurons.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“When the training procedure converges to a local minimum, the model has learned an approximation F of the true function ¯ F .”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As it does not depend on the ground truth labels, our approach allows computing the importance using any available data (unlabeled) which in turn allows for an adaptation to user-specific settings.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“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.”
What the sources say
- Not checked yetcites [1] Aljundi, R., Chakravarty, P., Tuytelaars, T.: Expert gate: lifelong learning with a network of experts. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017) source
- Not checked yetcites [16] Lee, S.W., Kim, J.H., Jun, J., Ha, J.W., Zhang, B.T.: Overcoming catastrophic forgetting by incremental moment matching. In: Advances in Neural Information Processing Systems, pp. 4652–4662 (2017)
- Not checked yetcites [17] Li, Z., Hoiem, D.: Learning without forgetting. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9908, pp. 614–629. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46493-0_37 source
- Not checked yetcites [28] Rannen, A., Aljundi, R., Blaschko, M.B., Tuytelaars, T.: Encoder based lifelong learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1320–1328 (2017) source
- Not checked yetcites [39] Zenke, F., Poole, B., Ganguli, S.: Improved multitask learning through synaptic intelligence. In: Proceedings of the International Conference on Machine Learning (ICML) (2017)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- The authors state this as an assumption: In the standard LLL setup, when training a task, only the data related to that task is accessible.
In the paper
“In the Synaptic Intelligence work [39], importance weights are computed during training in an online manner. To this end, they record how much the loss would change due to a change in a specific parameter and accumulate this information over the training trajectory.”
What the sources say
- Not checked yetcites [39] Zenke, F., Poole, B., Ganguli, S.: Improved multitask learning through synaptic intelligence. In: Proceedings of the International Conference on Machine Learning (ICML) (2017)
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Note that SI can only learn importance weights during training, and therefore cannot adapt to a particular subset.”
What the sources say
- Not checked yetcites [39] Zenke, F., Poole, B., Ganguli, S.: Improved multitask learning through synaptic intelligence. In: Proceedings of the International Conference on Machine Learning (ICML) (2017)
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Data based approaches are mainly designed for a classification scenario and overall, the need of these approaches to have a preprocessing step before each new task, to record the targets for the previous tasks is an additional limitation.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“According to Hebbian theory [10], the process at the basis of this phenomenon is the strengthening of synapses connecting neurons that fire synchronously, compared to those connecting neurons with unrelated firing behavior.”
What the sources say
- Not checked yetcites [10] Hebb, D.: The organization of behavior 1949. New York Wiely 2, 8 (2002)
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our global and local methods both have the advantage of computing the importance of the parameters on any given data point without the need to access the labels or the condition of being computed while training the model.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our proposed method (both the local and global version) resembles an implicit memory included for each parameter of the network. We, therefore, refer to it as Memory Aware Synapses. It keeps updating its value based on the activations of the network when applied to new data points. It can adapt and specialize to a given subset of data points rather than preserving every functionality in the”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Parameters with small importance weights do not affect the output much, and can, therefore, be changed to minimize the loss for subsequent tasks, while parameters with large weights should ideally be left unchanged.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Instead of aiming for no forgetting at all, figuring out what can possibly be forgotten becomes at least as important.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“We use a regularization parameter λ of 1; note that no tuning of λ was performed as we assume no access to previous task data.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- The authors state this as an assumption: No access to previous task data is available.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This is a far more challenging setup than joint learning, as typically used in the multitask learning literature, where all tasks are trained simultaneously.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“In the Elastic Weight Consolidation work [12], this is done based on an approximation of the diagonal of the Fisher information matrix.”
What the sources say
- Not checked yetcites [12] Kirkpatrick, J., et al.: Overcoming catastrophic forgetting in neural networks. arXiv preprint arXiv:1612.00796 (2016)
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, in a true LLL setting with a never-ending list of tasks, the capacity of the model sooner or later reaches its limits and compromises need to be made.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“which is remarkably similar to the Hebbian learning rule as explained in the main paper.”
plaincorrelationaln = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This indicates that our method ( MAS ) will allow changes on most of the parameters that were unused by the first task while penalizing changes to those few crucial parameters that carry meaningful information for the learned task.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- The authors state this as an assumption: A good importance measure would give very low importance values to unused parameters and high values for those that are crucial for the task at hand.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This suggests that the method identifies the important parameters needed for each subset and when those parameters are shared the parameters importance is correlated between the two subsets while when those are different, different parameters receive different importance values based on the used subset.”
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The authors state this as an assumption.
No access to previous task data is available.
“note that no tuning of λ was performed as we assume no access to previous task data.”
The authors state this as an assumption.
In the standard LLL setup, when training a task, only the data related to that task is accessible.
“The assumption of this setup is that, when training a task, only the data related to that task is accessible.”
The authors state this as an assumption.
In the object recognition experiments, different classification layers for each task remain unshared.
“Note that this assumes having different classification layers for each task (different 'heads') that remain unshared.”
The paper relies on this without support.
In the absence of error signals, synapses connecting biological neurons strengthen or weaken based on the concurrence of the connected neurons activations.
“In the absence of error signals, synapses connecting biological neurons strengthen or weaken based on the concurrence of the connected neurons activations.”
The authors state this as an assumption.
A good importance measure would give very low importance values to unused parameters and high values for those that are crucial for the task at hand.
“Ideally, a good importance measure would give very low importance values to the unused parameters and high values for those that are crucial for the task at hand.”
The authors state this as an assumption.
A plot where points are closely lying around a straight line indicates that the parameters from the two Ωs have similar importance values.
“A plot where the points are closely lying around a straight line indicates that the parameters from the two Ω s have similar importance values.”
The authors state this as an assumption.
A plot where points are spread further from such a line and scattered among the plotted area indicates a lower correlation between the Ωs.
“A plot where the points are spread further from such a line and scattered among the plotted area indicates a lower correlation between the Ω s.”
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 cited source doesn’t support the claim as written.
In the citing paper
“However, fixed-representations work well only if the task does not change over time, as it is the case in the evaluated scenarios presented in [2].”
From A Comprehensive Study of Class Incremental Learning Algorithms for Visual Tasks (2020) · cites this paper as [2]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredIn the citing paper
“The MAS method was proposed by Aljundi et al. [49], which was partly similar with SI but it supports the use of unlabeled data to obtain weight sensitivity.”
From An Appraisal of Incremental Learning Methods (2020) · cites this paper as [49]
In the citing paper
“Aljundi et al. [49] compared the classification performance between a multi-head classifier and single-head classifier. It can be seen that a multi-head classifier can achieve higher classification accuracy than a single-head classifier.”
From An Appraisal of Incremental Learning Methods (2020) · cites this paper as [49]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
“| Finetune | 33.98 | 22.57 | 21.48 | 21.48 | 13.32 | 26.64 | 36.18 | 90.33 | 32.67 |”
Reported 32.67 · recomputed 33.2475
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ C2 Details on methods' memory requirements estimation · p. 18
“In the main paper, section 5 . 1 Figure 6, we report an approximation to the memory requirements of each method in the 8 tasks object recognition sequence.”
§ Longer Sequence · p. 12
“Fig. 6: avg. performance, left, and avg. forgetting, right, on permuted mnist sequence.”
Citations
Cites
Very Deep Convolutional Networks for Large-Scale Image Recognition
Simonyan, K., & Zisserman, A. (2014) · arXiv · doi:10.48550/arxiv.1409.1556 · Cited by 114,148
ImageNet Large Scale Visual Recognition Challenge
Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al. (2015) · International Journal of Computer Vision · doi:10.1007/s11263-015-0816-y · Cited by 39,380
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Hebb, D. O. (2005) · doi:10.4324/9781410612403 · Cited by 9,825
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
Finn, C., Abbeel, P., & Levine, S. (2017) · arXiv · doi:10.48550/arxiv.1703.03400 · Cited by 8,512
Overcoming catastrophic forgetting in neural networks
Kirkpatrick, J., Pascanu, R., Rabinowitz, N., Veness, J., Desjardins, G., Rusu, A. A., Milan, K., Quan, J., Ramalho, T., Grabska-Barwinska, A., et al. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1611835114 · Cited by 7,899
McClelland, J. L., McNaughton, B. L., & O'Reilly, R. C. (1995) · Psychological Review · doi:10.1037/0033-295x.102.3.419 · Cited by 5,256
Reading digits in natural images with unsupervised feature learning
Netzer, Y. (2024) · doi:10.57702/e7wwo0zk · Cited by 4,261
iCaRL: Incremental Classifier and Representation Learning
Rebuffi, S.-A., Kolesnikov, A., Sperl, G., & Lampert, C. H. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.587 · Cited by 3,988
Catastrophic Interference in Connectionist Networks: The Sequential Learning Problem
McCloskey, M., & Cohen, N. J. (1989) · Psychology of Learning and Motivation · doi:10.1016/s0079-7421(08)60536-8 · Cited by 3,770
Research works printed but not linked: 5
- Everingham, M., Van Gool, L., Williams, C.K.I., Winn, J., Zisserman, A.: The PASCAL Visual Object Classes Challenge 2012 (VOC2012) Results (2012). http://www.pascal-network.org/challenges/VOC/voc2012/workshop/index.html
- Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. In: Pereira, F., Burges, C.J.C., Bottou, L., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 25, pp. 1097–1105. Curran Associates, Inc. (2012)
- Pentina, A., Lampert, C.H.: Lifelong learning with non-iid tasks. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems 28, pp. 1540–1548 (2015)
- Pentina, A., Lampert, C.H.: Lifelong learning with non-iid tasks. In: Advances in Neural Information Processing Systems, pp. 1540–1548 (2015)
- Quadrianto, N., Petterson, J., Smola, A.J.: Distribution matching for transduction. In: Advances in Neural Information Processing Systems, pp. 1500–1508 (2009)
Cited by
Sorted by citations
Items 501–600 of 1,000
Incremental encrypted traffic classification via contrastive prototype networks
Cai, W., Hou, C., Cui, M.-X., Wang, B., Xiong, G., & Gou, G.-P. (2024) · Comput. Networks · doi:10.1016/j.comnet.2024.110591 · Cited by 14
Learning incremental audio–visual representation for continual multimodal understanding
Zhu, B., Wang, C., Xu, K., Feng, D., Zhou, Z., & Zhu, X. (2024) · Knowledge-Based Systems · doi:10.1016/j.knosys.2024.112513 · Cited by 14
Context-aware feature reconstruction for class-incremental anomaly detection and localization
Pang, J., & Li, C. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106788 · Cited by 17
One-Stage Prompt-Based Continual Learning
Kim, Y., Li, Y., & Panda, P. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-72624-8_10 · Cited by 15
Early Preparation Pays Off: New Classifier Pre-tuning for Class Incremental Semantic Segmentation
Xie, Z., Lu, H., Xiao, J.-W., Wang, E., Zhang, L., & Liu, X. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-73347-5_11 · Cited by 15
Min, Q., Luo, F., Dong, W., Gu, C., & Ding, W. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.113008 · Cited by 14
ILCOC: An Incremental Learning Framework based on Contrastive One-class Classifiers
Sun, W., Zhang, J., Wang, D., Geng, Y., & Li, Q. (2021) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw53098.2021.00397 · Cited by 14
A Laboratory Open-Set Martian Rock Classification Method Based on Spectral Signatures
Yang, J., Kang, Z., Yang, Z., Xie, J., Xue, B., Yang, J., & Tao, J. (2022) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2022.3175996 · Cited by 14
ISM-Net: Mining incremental semantics for class incremental learning
Qiu, Z., Xu, L., Wang, Z., Wu, Q., Meng, F., & Li, H. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.12.029 · Cited by 14
DIODE: Dilatable Incremental Object Detection
Peng, C., Zhao, K., Maksoud, S., Wang, T., & Lovell, B. C. (2022) · Pattern Recognition · doi:10.1016/j.patcog.2022.109244 · Cited by 14
Incremental Task Learning with Incremental Rank Updates
Hyder, R., Shao, K., Hou, B., Markopoulos, P. P., Prater-Bennette, A., & Asif, M. S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20050-2_33 · Cited by 15
Pezze, D. D., Deronjic, D., Masiero, C., Tosato, D., Beghi, A., & Susto, G. A. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2023.106610 · Cited by 15
Continual Class Incremental Learning for CT Thoracic Segmentation
Elskhawy, A., Lisowska, A., Keicher, M., Henry, J., Thomson, P., & Navab, N. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-60548-3_11 · Cited by 14
Few-Shot Class-Incremental LearningPreprint
Tao, X., Hong, X., Chang, X., Dong, S., Wei, X., & Gong, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.10956 · Cited by 14
Aslam, S., Rasool, A., Li, X., & Wu, H. (2025) · Interdisciplinary Sciences: Computational Life Sciences · doi:10.1007/s12539-024-00675-2 · Cited by 23
Rehearsal-Free and Efficient Continual Learning for Cross-Domain Face Anti-Spoofing
Cai, R., Cui, Y., Yu, Z., Lin, X., Chen, C., & Kot, A. C. (2025) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2025.3601053 · Cited by 13
Incremental Embedding Learning With Disentangled Representation Translation
Wei, K., Chen, D., Li, Y., Yang, X., Deng, C. D., & Tao, D. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3199816 · Cited by 13
Adversarially Robust Continual Learning
Khan, H., Bouaynaya, N. C., & Rasool, G. (2022) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn55064.2022.9892970 · Cited by 13
FedEWA: Federated Learning with Elastic Weighted Averaging
Bai, J., Sajjanhar, A., Xiang, Y., Tong, X., & Zeng, S. (2022) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn55064.2022.9892851 · Cited by 13
Meta-Learning with Less Forgetting on Large-Scale Non-Stationary Task Distributions
Wang, Z., Shen, L., Fang, L., Suo, Q., Zhan, D., Duan, T., & Gao, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20044-1_13 · Cited by 13
Gaussian Switch Sampling: A Second-Order Approach to Active Learning
Benkert, R., Prabhushankar, M., AlRegib, G., Pacharmi, A., & Corona, E. (2023) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2023.3246959 · Cited by 15
Clustered Task-Aware Meta-Learning by Learning From Learning Paths
Peng, D., & Pan, S. J. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3250323 · Cited by 13
Mixed-Up Experience Replay for Adaptive Online Condition Monitoring
Russell, M., Wang, P., Liu, S., & Jawahir, I. (2024) · IEEE transactions on industrial electronics (1982. Print) · doi:10.1109/tie.2023.3260351 · Cited by 14
Class-Incremental Learning on Multivariate Time Series Via Shape-Aligned Temporal Distillation
Qiao, Z., Hu, M., Jiang, X., Suganthan, P. N., & Ramasamy, S. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10094960 · Cited by 13
Ma, R., Chen, X., Zhang, L., Zhou, X., Wang, J., Gui, T., Zhang, Q., Gao, X. Y., & Chen, Y. W. (2023) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2023.acl-long.328 · Cited by 14
Representation Robustness and Feature Expansion for Exemplar-Free Class-Incremental Learning
Luo, Y. C., Ge, H., Liu, Y., & Wu, C. (2023) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2023.3344574 · Cited by 14
A semi-supervised load identification method with class incremental learning
Qiu, L., Yu, T., & Lan, C. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2023.107768 · Cited by 13
Abulaish, M., Wasi, N. A., & Sharma, S. (2024) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1526 · Cited by 13
Heterogeneous decentralised machine unlearning with seed model distillation
Ye, G., Chen, T., Nguyen, Q. V. H., & Yin, H. (2024) · CAAI Transactions on Intelligence Technology · doi:10.1049/cit2.12281 · Cited by 13
Banet, T., Smith, A. G., McGrail, R. K., McNear, D. H., & Poffenbarger, H. (2024) · The Plant Phenome Journal · doi:10.1002/ppj2.20094 · Cited by 13
Continual learning framework for a multicenter study with an application to electrocardiogram
Kim, J., Lim, M. H., Kim, K., & Yoon, H. (2024) · BMC Medical Informatics and Decision Making · doi:10.1186/s12911-024-02464-9 · Cited by 13
Huo, F., Xu, W., Guo, J., Wang, H., & Fan, Y. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i11.29165 · Cited by 13
Class Incremental Learning for Light-Weighted Networks
Tao, Z., Yu, L., Yao, H., Huang, S., & Xu, C. (2024) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2024.3424302 · Cited by 13
Continual Face Forgery Detection via Historical Distribution Preserving
Sun, K., Chen, S., Yao, T., Sun, X., Ding, S., & Ji, R. (2024) · International Journal of Computer Vision · doi:10.1007/s11263-024-02160-1 · Cited by 18
PUMA: Efficient Continual Graph Learning for Node Classification With Graph Condensation
Liu, Y., Qiu, R., Tang, Y., Yin, H., & Huang, Z. H. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3485691 · Cited by 22
Weighted Ensemble Models Are Strong Continual Learners
Marouf, I. E., Roy, S., Tartaglione, E., & Lathuilière, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-73209-6_18 · Cited by 13
Fast incremental learning by transfer learning and hierarchical sequencing
Llopis-Ibor, L., Beltran‐Royo, C., Cuesta‐Infante, A., & Pantrigo, J. J. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.118580 · Cited by 13
incDFM: Incremental Deep Feature Modeling for Continual Novelty Detection
Rios, A., Ahuja, N., Ndiour, I. J., Genc, U., Itti, L., & Tickoo, O. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-19806-9_34 · Cited by 13
Zhang, J., Gu, R., Xue, P., Liu, M., Zheng, H., Zheng, Y., Ma, L., Wang, G., & Gu, L. (2023) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2023.3260974 · Cited by 13
Knowledge Restore and Transfer for Multi-Label Class-Incremental Learning
Dong, S., Luo, H., He, Y., Wei, X., Cheng, J., & Gong, Y. (2023) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.01715 · Cited by 13
Zacarias, A., & Alexandre, L. A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99978-4_8 · Cited by 13
Umer, M., Dawson, G., & Robi Polikar, A. (2020) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn48605.2020.9206809 · Cited by 13
Single-Net Continual Learning with Progressive Segmented Training
Du, X., Charan, G., Liu, F., & Cao, Y. K. (2019) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2019.00267 · Cited by 15
Two-Level Residual Distillation based Triple Network for Incremental Object DetectionPreprint
Yang, D., Zhou, Y., Wu, D., Ma, C., Yang, F., & Wang, W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.13428 · Cited by 13
Yin, D., Farajtabar, M., Li, A., Levine, N., & Mott, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.10974 · Cited by 48
Continuous Coordination As a Realistic Scenario for Lifelong LearningPreprint
Nekoei, H., Badrinaaraayanan, A., Courville, A. C., & Chandar, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.03216 · Cited by 17
Tackling Catastrophic Forgetting and Background Shift in Continual Semantic SegmentationPreprint
Douillard, A., Chen, Y., Dapogny, A., & Cord, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.15287 · Cited by 18
Wang, X., Liang, Z., Koe, A. S. V., Wu, Q., Zhang, X., Li, H., & Yang, Q. (2022) · International Journal of Intelligent Systems · doi:10.1002/int.22727 · Cited by 11
Language Guided Concept Bottleneck Models for Interpretable Continual Learning
Yu, L., Han, H., Tao, Z., Yao, H., & Xu, C. (2025) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52734.2025.01395 · Cited by 17
IncreGNN: Incremental Graph Neural Network Learning by Considering Node and Parameter Importance
Wei, D., Gu, Y., Song, Y., Song, Z., Li, F., & Yu, G. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-00123-9_59 · Cited by 12
On self-adaptive 5G network slice QoS management system: a deep reinforcement learning approach
Cheng, S.-T., He, C. Y., Lyu, Y.-J., & Deng, D. (2022) · Wireless Networks · doi:10.1007/s11276-022-03181-9 · Cited by 12
Continual Learning with Dependency Preserving Hypernetworks
Chandra, D. S., Varshney, S., Srijith, P. K., & Gupta, S. (2023) · IEEE Winter Conference on Applications of Computer Vision · doi:10.1109/wacv56688.2023.00237 · Cited by 12
A Class-Incremental Learning Method for SAR Images Based on Self-Sustainment Guidance Representation
Pan, Q., Liao, K., He, X., Bu, Z., & Huang, J. (2023) · Remote Sensing · doi:10.3390/rs15102631 · Cited by 12
Cross-Regional Fraud Detection via Continual Learning With Knowledge Transfer
Li, Y., Yang, X., Gao, Q., Wang, H., Zhang, J., & Li, T. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3451161 · Cited by 12
A class-incremental learning approach for learning feature-compatible embeddings
An, H., Yang, J., Zhang, X., Ruan, X., Wu, Y., Li, S., & Hu, J. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106685 · Cited by 14
Balanced Destruction-Reconstruction Dynamics for Memory-Replay Class Incremental Learning
Zhou, Y., Yao, J., Hong, F., Zhang, Y., & Wang, Y. (2024) · IEEE Transactions on Image Processing · doi:10.1109/tip.2024.3451932 · Cited by 19
Overcoming Generic Knowledge Loss with Selective Parameter Update
Zhang, W., Janson, P., Aljundi, R., & Elhoseiny, M. (2024) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52733.2024.02270 · Cited by 15
Self-citationDYSON: Dynamic Feature Space Self-Organization for Online Task-Free Class Incremental Learning
He, Y., Chen, Y., Jin, Y., Dong, S., Wei, X., & Gong, Y. (2024) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52733.2024.02241 · Cited by 12
PromptFusion: Decoupling Stability and Plasticity for Continual Learning
Chen, H., Wu, Z., Han, X., Jia, M., & Jiang, Y. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-73021-4_12 · Cited by 13
Towards open-world recognition: Critical problems and challenges
Wang, K., Li, Z., Yang, C., Dong, W., & Chen, J. (2025) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2025.110042 · Cited by 12
MuseumMaker: Continual Style Customization Without Catastrophic Forgetting
Liu, C., Sun, G., Liang, W., Dong, J., Qin, C., & Cong, Y. (2025) · IEEE Transactions on Image Processing · doi:10.1109/tip.2025.3553024 · Cited by 16
Unsupervised Continual Learning via Self-adaptive Deep Clustering Approach
Pratama, M., Ashfahani, A., & Lughofer, E. D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17587-9_4 · Cited by 12
Continual Learning with Dual Regularizations
Han, X., & Guo, Y. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-86486-6_38 · Cited by 12
Deep learning via message passing algorithms based on belief propagation
Lucibello, C., Pittorino, F., Perugini, G., & Zecchina, R. (2022) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ac7d3b · Cited by 12
Continual Few-Shot Learning for Text Classification
Pasunuru, R., Stoyanov, V., & Bansal, M. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.460 · Cited by 14
Entropy-based Stability-Plasticity for Lifelong Learning
Araujo, V., Hurtado, J., Soto, Á., & Moens, M. (2022) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw56347.2022.00416 · Cited by 13
Improving Replay-Based Continual Semantic Segmentation with Smart Data Selection
Kalb, T., Mauthe, B., & Beyerer, J. (2022) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc55140.2022.9922284 · Cited by 13
TKIL: Tangent Kernel Optimization for Class Balanced Incremental Learning
Xiang, J., & Shlizerman, E. (2023) · IEEE International Conference on Computer Vision Workshops · doi:10.1109/iccvw60793.2023.00379 · Cited by 12
Adapt Your Teacher: Improving Knowledge Distillation for Exemplar-free Continual Learning
Szatkowski, F., Pyla, M., Przewięźlikowski, M., Cygert, S., Twardowski, B., & Trzcinski, T. P. (2024) · IEEE Winter Conference on Applications of Computer Vision · doi:10.1109/wacv57701.2024.00198 · Cited by 16
Continual Learning of Micro-Doppler Signature-Based Human Activity Classification
Lee, D., Park, H., Moon, T., & Kim, Y. (2021) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2020.3046015 · Cited by 12
Incremental Learning with Maximum Entropy Regularization: Rethinking Forgetting and IntransigencePreprint
Kim, D., Bae, J.-H., Jo, Y., & Choi, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.00829 · Cited by 23
Leimer, P., Herzog, M. H., & Senn, W. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/613265 · Cited by 12
RILOD: Near Real-Time Incremental Learning for Object Detection at the EdgePreprint
Li, D., Taşcı, Ş., Ghosh, S., Zhu, J., Zhang, J., & Heck, L. P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.00781 · Cited by 12
SOLA: Continual Learning with Second-Order Loss Approximation.Preprint
Yin, D., Farajtabar, M., & Li, A. (2020) · arXiv (Cornell University) · Cited by 13
Learning With Sharing: An Edge-Optimized Incremental Learning Method for Deep Neural Networks
Hussain, M. A., Huang, S.-A., & Tsai, T.-H. (2023) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2022.3210905 · Cited by 11
Zhou, H., Xia, W., Zheng, G., & Zhu, H. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3585146 · Cited by 11
Trust-Region Adaptive Frequency for Online Continual Learning
Kong, Y., Liu, L., Qiao, M., Wang, Z., & Tao, D. (2023) · International Journal of Computer Vision · doi:10.1007/s11263-023-01775-0 · Cited by 11
Continual text classification based on knowledge distillation and class-aware experience replay
Yang, F., Che, Y., Kang, M., Liu, S., & Fu, Z. (2023) · Knowledge and Information Systems · doi:10.1007/s10115-023-01889-4 · Cited by 11
Leveraging Old Knowledge to Continually Learn New Classes in Medical Images
Chee, E. Y. L., Lee, M. L., & Hsu, W. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i12.26659 · Cited by 12
Song, Y., Wang, P., Xiong, W., Zhu, D., Liu, T., Sui, Z., & Li, S. (2023) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2023.findings-emnlp.969 · Cited by 11
Measuring Asymmetric Gradient Discrepancy in Parallel Continual Learning
Lyu, F., Sun, Q., Shang, F., Wan, L., & Feng, W. (2023) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.01048 · Cited by 11
SCREAM: Knowledge sharing and compact representation for class incremental learning
Feng, Z., Zhou, M., Gao, Z., Stefanidis, A., & Sui, Z. (2024) · Information Processing & Management · doi:10.1016/j.ipm.2023.103629 · Cited by 11
Continual Egocentric Activity Recognition With Foreseeable-Generalized Visual–IMU Representations
He, C., Cheng, S., Qiu, Z., Xu, L., Meng, F., Wu, Q., & Li, H. (2024) · IEEE Sensors Journal · doi:10.1109/jsen.2024.3371975 · Cited by 11
Expanding Hyperspherical Space for Few-Shot Class-Incremental Learning
Deng, Y., & Xiang, X. (2024) · IEEE Winter Conference on Applications of Computer Vision · doi:10.1109/wacv57701.2024.00197 · Cited by 12
General Federated Class-Incremental Learning With Lightweight Generative Replay
Chen, Y., Tan, A. Z., Feng, S., Yu, H., Deng, T., Zhao, L., & Wu, F. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3434600 · Cited by 14
Improving Plasticity in Online Continual Learning via Collaborative Learning
Wang, M., Michel, N., Xiao, L., & Yamasaki, T. (2024) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52733.2024.02214 · Cited by 16
Wang, H., Wu, H., & Qin, J. (2024) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52733.2024.01084 · Cited by 11
Exemplar-Free Continual Representation Learning via Learnable Drift Compensation
Gomez-Villa, A., Goswami, D., Wang, K., Bagdanov, A. D., Twardowski, B., & van de Weijer, J. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-72667-5_27 · Cited by 11
Non-exemplar Domain Incremental Learning via Cross-Domain Concept Integration
Wang, Q., He, Y., Dong, S., Gao, X., Wang, S., & Gong, Y. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-72967-6_9 · Cited by 11
Continual Learning for Autonomous Robots: A Prototype-based Approach
Hajizada, E., Swaminathan, B., & Sandamirskaya, Y. (2024) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros58592.2024.10802683 · Cited by 11
CMoA: Contrastive Mixture of Adapters for Generalized Few-Shot Continual Learning
Cui, Y., Zhao, J. C., Yu, Z., Cai, R., Wang, X., Jin, L., Kot, A. C., Liu, L., & Li, X. (2025) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2025.3543038 · Cited by 11
Class-wise federated unlearning: Harnessing active forgetting with teacher–student memory generation
Li, Y., Zhang, J., Liu, Y., & Chen, C. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.113353 · Cited by 12
Han, P., Huang, X., Fang, Y., & Han, G. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3572362 · Cited by 11
Continual Learning With Neuromorphic Computing: Foundations, Methods, and Emerging Applications
Minhas, M. F., Putra, R. V. W., Awwad, F. R., Hasan, O., & Shafique, M. (2025) · IEEE Access · doi:10.1109/access.2025.3588665 · Cited by 24
Stacking Brick by Brick: Aligned Feature Isolation for Incremental Face Forgery Detection
Cheng, J., Yan, Z., Zhang, Y., Hao, L., Ai, J., Zou, Q., Chen, L., & Wang, Z. (2025) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52734.2025.01300 · Cited by 17
Prevention of catastrophic interference and imposing active forgetting with generative methods
Sukhov, S. V., Leontev, M., Miheev, A., & Sviatov, K. V. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.03.024 · Cited by 10
Cross Domain Lifelong Learning Based on Task Similarity
Yang, S., & Cai, Z. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3276991 · Cited by 11
Mixture Uniform Distribution Modeling and Asymmetric Mix Distillation for Class Incremental Learning
Qiang, S., Hou, J., Wan, J., Liang, Y., Lei, Z., & Zhang, D. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i8.26137 · Cited by 11
Dual memory model for experience-once task-incremental lifelong learning
Ma, G., Jiang, R., Wang, L., & Tang, H. (2023) · Neural Networks · doi:10.1016/j.neunet.2023.07.009 · Cited by 13
Self-Supervised Unseen Object Instance Segmentation via Long-Term Robot Interaction
Lu, Y., Khargonkar, N., Xu, Z., Averill, C., Palanisamy, K., Hang, K., Guo, Y., Ruozzi, N., & Yu, X. (2023) · Robotics: Science and Systems · doi:10.15607/rss.2023.xix.017 · Cited by 11
Metadata
- Authors
- Aljundi, R., Babiloni, F., Elhoseiny, M., Rohrbach, M., & Tuytelaars, T.
- Affiliations
- IMEC (BE)
- Meta (United States) (US)
- Corresponding author
- Aljundi, Rahaf
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2018
- Pages
- 144-161
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2768412495
- Semantic Scholar
- 713b0d9005944f80af00addc81b162ca74ea4b14
- Cited by
- 1,590
- References
- 37
- Citations by year
- 2026: 166 · 2025: 281 · 2024: 288 · 2023: 295 · 2022: 184 · 2021: 203 · 2020: 105 · 2019: 52 · 2018: 15
- FWCI
- 38.29
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Lecture notes in computer science (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Lirias (submittedVersion, other-oa)
- arXiv (Cornell University)
- Funders
- Fonds Wetenschappelijk Onderzoek
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
- Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
- Keywords
- catastrophic forgetting, lifelong learning, parameter importance, neuroplasticity, Hebbian learning, online learning, object recognition, knowledge preservation
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.
A language model drew the claims from the paper on 2026-10-08, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-08 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
