PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 16, 2026IEEE Transactions on Pattern Analysis and Machine Intelligence2 citations

Learning From Each Other: Generalized Federated Incremental Semantic Segmentation

View Full Paper
JDJiahua DongWLWenqi LiangYCYang Cong

Key Points

  • This research aims to enhance federated learning by addressing catastrophic forgetting in semantic segmentation through a novel model.
  • Proposed a Hierarchical Forgetting Alleviation model to tackle forgetting in federated settings.
  • Developed a confidence-regularized pseudo labeling strategy for class-balanced soft pseudo labels.
  • Designed a graph-induced relation matching loss to manage inter-class relations.
  • Implemented forgetting-balanced gradient propagation to improve training efficiency.
  • Created a task detection module with adaptive DBSCAN clustering for handling new tasks.
  • The proposed HFA model outperforms existing methods on multiple datasets.
  • The model effectively reduces catastrophic forgetting of old categories during training.
  • Utilized pseudo labeling led to more balanced class representation in training data.

Abstract

Federated learning (FL) has advanced semantic segmentation through decentralized training to reduce annotation costs. However, most FL-based semantic segmentation methods assume fixed foreground classes, resulting in catastrophic forgetting of old categories when local clients continually collect streaming data of new classes without storing old categories. Moreover, the irregular participation of new local clients with novel classes unseen by others may exacerbate heterogeneous forgetting across clients during global FL training. To resolve the above challenges, we propose a Hierarchical Forgetting Alleviation (HFA) model. By tackling forgetting within and across local clients, our model ensures that all local clients learn from each other as they continuously learn new categories. Specifically, to alleviate class-imbalanced forgetting within local clients induced by background shift, we develop a confidence-regularized pseudo labeling strategy to produce class-balanced soft pseudo labels for old categories that are labeled as background. Guided by soft pseudo labels, we design a graph-induced relation matching loss and a forgetting-balanced gradient propagation module to tackle ambiguous inter-class relations and class-imbalanced gradient propagation among old classes. Besides, a novel task detection module and an adaptive DBSCAN clustering are devised to address inter-client heterogeneous forgetting. They detect the arrival of new tasks to store the old global model for local pseudo labeling and distillation, while supplying global class prototypes for modeling inter-class relations and warm-starting global classifier. Experiments on multiple datasets verify our model's superiority over other methods.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Dong et al. (2026) studied this question.

synapsesocial.com/papers/6992b3319b75e639e9b08093https://doi.org/10.1109/tpami.2026.3664293
Ask AI
Helpful
Bookmark
Share
View Full Paper