Cited by 6Domain Adaptation and Few-Shot LearningAdvanced Neural Network ApplicationsData Stream Mining Techniques

Revisiting Flatness-Aware Optimization in Continual Learning With Orthogonal Gradient Projection

Yang, Enneng, Shen, Li, Wang, Zhenyi, Liu, Shiwei, Guo, Guibing, Wang, Xingwei, Tao, Dacheng·2025·IEEE Transactions on Pattern Analysis and Machine Intelligence

Abstract

The goal of continual learning (CL) is to learn from a series of continuously arriving new tasks without forgetting previously learned old tasks. To avoid catastrophic forgetting of old tasks, orthogonal gradient projection (OGP) based CL methods constrain the gradients of new tasks to be orthogonal to the space spanned by old tasks. This strict gradient constraint will limit the learning ability of new tasks, resulting in lower performance on new tasks. In this paper, we first establish a unified framework for OGP-based CL methods. We then revisit OGP-based CL methods from a new perspective on the loss landscape, where we find that when relaxing projection constraints to improve performance on new tasks, the unflatness of the loss landscape can lead to catastrophic forgetting of old tasks. Based on our findings, we propose a new Dual Flatness-aware OGD framework that optimizes the flatness of the loss landscape from both data and weight levels. Our framework consists of three modules: data and weight perturbation, flatness-aware optimization, and gradient projection. Specifically, we first perform perturbations on the task's data and current model weights to make the task's loss reach the worst-case. Next, we optimize the loss and loss landscape on the original data and the worst-case perturbed data to obtain a flatness-aware gradient. Finally, the flatness-aware gradient will update the network in directions orthogonal to the space spanned by the old tasks. Extensive experiments on four benchmark datasets show that the framework improves the flatness of the loss landscape and performance on new tasks, and achieves state-of-the-art (SOTA) performance on average accuracy across all tasks.

Integrity signals

Registry

Crossref · 10.1109/tpami.2025.3539019

Cites

75 of 75 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 76 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., & Tao, D.
Affiliations
  • Northeastern University (CN)
  • Sun Yat-sen University (CN)
  • University of Maryland, College Park (US)
  • University of Oxford (GB)
  • Nanyang Technological University (SG)
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2025-05
Volume
47
Issue
5
Pages
3895-3907
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
  • 1939-3539
OpenAlex
W4407168958
Cited by
5
References
76
Citations by year
2026: 5
FWCI
2.02
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion)
  • PubMed (publishedVersion)
  • DR-NTU (Nanyang Technological University) (submittedVersion)
Funders
  • National Natural Science Foundation of China (62032013)
  • Science and technology projects in Liaoning Province (2023JH3/10200005)
  • Natural Science Foundation (JCYJ20241202124430041)
  • National Research Foundation Singapore (NRF-P2024-001)
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 › Data Stream Mining Techniques
Keywords
continual learning, catastrophic forgetting, loss landscape flatness, 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