NoFA-BC proposes a non-forgetting allocator using recursive least-squares and bi-level competition for improved knowledge allocation in class-incremental learning.
Proceedings NoFA-BC 19 of the AAAI Conference on Artificial Intelligence38(15), 17237–17244 (Mar 2024)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Non-Forgetting Knowledge Allocation with Bi-level Competition for Class-Incremental Learning
NoFA-BC proposes a non-forgetting allocator using recursive least-squares and bi-level competition for improved knowledge allocation in class-incremental learning.