TY - JOUR
T1 - Dynamic expansion orthogonal network for class-incremental learning
AU - Dong, Mingda
AU - Zhang, Zhizhong
AU - Tan, Xin
AU - Qiu, Jiling
AU - Xie, Yuan
N1 - Publisher Copyright:
© 2026 Elsevier B.V.
PY - 2026/5/23
Y1 - 2026/5/23
N2 - Dynamic expansion networks have emerged as a promising approach for incremental learning by introducing new feature extractors for each task while freezing previously learned ones to preserve acquired knowledge. However, existing methods often fail to effectively leverage information from earlier tasks when learning subsequent tasks, leading to blurred decision boundaries for earlier tasks and exacerbating catastrophic forgetting. To address this issue, we propose a novel orthogonal feature space constraint that encourages new-task features to lie in a subspace orthogonal to that of earlier tasks. This constraint helps preserves task boundaries and mitigate catastrophic forgetting. However, strictly enforcing orthogonality may undermine the plasticity needed to learn new tasks, potentially hindering performance. To strike a balance between stability and plasticity, we introduce a selective orthogonal constraint guided by a Task Relevance Matrix (TRM), which quantifies cross-class similarities between old and new classes, relaxes unnecessary restrictions, and enables more precise and adaptive orthogonal regularization. Additionally, we propose an intra-task orthogonality module that helps new tasks better differentiate their feature space from that of old tasks. Extensive experiments on CIFAR-100, ImageNet-100, and ImageNet demonstrate that our method effectively alleviates catastrophic forgetting while maintaining competitive performance on newly introduced tasks.
AB - Dynamic expansion networks have emerged as a promising approach for incremental learning by introducing new feature extractors for each task while freezing previously learned ones to preserve acquired knowledge. However, existing methods often fail to effectively leverage information from earlier tasks when learning subsequent tasks, leading to blurred decision boundaries for earlier tasks and exacerbating catastrophic forgetting. To address this issue, we propose a novel orthogonal feature space constraint that encourages new-task features to lie in a subspace orthogonal to that of earlier tasks. This constraint helps preserves task boundaries and mitigate catastrophic forgetting. However, strictly enforcing orthogonality may undermine the plasticity needed to learn new tasks, potentially hindering performance. To strike a balance between stability and plasticity, we introduce a selective orthogonal constraint guided by a Task Relevance Matrix (TRM), which quantifies cross-class similarities between old and new classes, relaxes unnecessary restrictions, and enables more precise and adaptive orthogonal regularization. Additionally, we propose an intra-task orthogonality module that helps new tasks better differentiate their feature space from that of old tasks. Extensive experiments on CIFAR-100, ImageNet-100, and ImageNet demonstrate that our method effectively alleviates catastrophic forgetting while maintaining competitive performance on newly introduced tasks.
KW - Catastrophic forgetting
KW - Continual learning
KW - Dynamically expandable networks
KW - Orthogonal loss
UR - https://www.scopus.com/pages/publications/105034621442
U2 - 10.1016/j.knosys.2026.115868
DO - 10.1016/j.knosys.2026.115868
M3 - 文章
AN - SCOPUS:105034621442
SN - 0950-7051
VL - 341
JO - Knowledge-Based Systems
JF - Knowledge-Based Systems
M1 - 115868
ER -