Cited by 19Domain Adaptation and Few-Shot LearningAdvanced Neural Network ApplicationsReinforcement Learning in Robotics

Data Augmented Flatness-aware Gradient Projection for Continual Learning

Yang, Enneng, Shen, Li, Wang, Zhenyi, Liu, Shiwei, Guo, Guibing, Wang, Xingwei·2023·2023 IEEE/CVF International Conference on Computer Vision (ICCV)

Abstract

The goal of continual learning (CL) is to continuously learn new tasks without forgetting previously learned old tasks. To alleviate catastrophic forgetting, gradient projection based CL methods require that the gradient updates of new tasks are orthogonal to the subspace spanned by old tasks. This limits the learning process and leads to poor performance on the new task due to the projection constraint being too strong. In this paper, we first revisit the gradient projection method from the perspective of flatness of loss surface, and find that unflatness of the loss surface leads to catastrophic forgetting of the old tasks when the projection constraint is reduced to improve the performance of new tasks. Based on our findings, we propose a Data Augmented Flatness-aware Gradient Projection (DFGP) method to solve the problem, which consists of three modules: data and weight perturbation, flatness-aware optimization, and gradient projection. Specifically, we first perform a flatness-aware perturbation on the task data and current weights to find the case that makes the task loss worst. Next, flatness-aware optimization optimizes both the loss and the flatness of the loss surface on raw and worst-case perturbed data to obtain a flatness-aware gradient. Finally, gradient projection updates the network with the flatness-aware gradient along directions orthogonal to the subspace of the old tasks. Extensive experiments on four datasets show that our method improves the flatness of loss surface and the performance of new tasks, and achieves state-of-the-art (SOTA) performance in the average accuracy of all tasks.

Integrity signals

Registry

Crossref · 10.1109/iccv51070.2023.00518

Cites

58 of 58 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

We couldn’t retrieve this paper’s full text, 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?

  • DFGP reinterprets the problem of catastrophic forgetting in orthogonal projection from the perspective of loss landscape flatness, and accordingly improves network flatness to balance plasticity and stability.

    “DFGP (Yang et al., 2023, 2025) reinterprets the problem of catastrophic forgetting in orthogonal projection from the perspective of loss landscape flatness, and accordingly improves network flatness to balance plasticity and stability.”

Cites

Flagged first, then by citations

1 of the 59 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Yang, E., Shen, L., Wang, Z., Liu, S., Guo, G., & Wang, X.
Affiliations
  • Northeastern University (CN)
  • Jingdong (China) (CN)
  • University of Maryland, College Park (US)
  • The University of Texas at Austin (US)
Venue
2023 IEEE/CVF International Conference on Computer Vision (ICCV)
Publisher
IEEE
Published
2023-10-01
Pages
5607-5616
OpenAlex
W4390874035
Cited by
18
References
59
Citations by year
2026: 5 · 2025: 5 · 2024: 8
FWCI
3.19
Type
conference paper
Language
en
Open access
closed
Locations
IEEE/CVF International Conference on Computer Vision (ICCV) (publishedVersion)
Funders
  • National Natural Science Foundation of China
  • Fundamental Research Funds for the Central Universities
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 › Reinforcement Learning in Robotics
Keywords
continual learning, catastrophic forgetting, gradient projection, data augmentation, weight perturbation, worst-case perturbations

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