Organizations: School of Information Engineering, Gannan University of Science and Technology, Ganzhou 341000, China · Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China · Department of Electrical and Computer Engineering, Queen University, Kingston, ON K7L 3N6, Canada · School of Data Science, Lingnan University, Tuen Mun, Hong Kong, China · School of Computer Science and Engineering, Central South University, Changsha 410083, China
Low-Earth-orbit (LEO) satellite constellations are increasingly performing on-board computing. However, the continuous emergence of new classes under strict memory and communication constraints poses major challenges for collaborative training. Federated class-incremental learning (FCIL) enables distributed incremental learning without sharing raw data, but faces three LEO-specific challenges: non-independent and identically distributed data heterogeneity caused by orbital dynamics, amplified catastrophic forgetting during aggregation, and the need to balance stability and plasticity under limited resources. To tackle these challenges, we propose MLFCIL, a multi-level forgetting mitigation framework that decomposes catastrophic forgetting into three sources and addresses them at different levels: class-reweighted loss to reduce local bias, knowledge distillation with feature replay and prototype-guided drift compensation to preserve cross-task knowledge, and class-aware aggregation to mitigate forgetting during federation. In addition, we design a dual-granularity coordination strategy that combines round-level adaptive loss balancing with step-level gradient projection to further enhance the stability-plasticity trade-off. Experiments on the NWPU-RESISC45 dataset show that MLFCIL significantly outperforms baselines in both accuracy and forgetting mitigation, while introducing minimal resource overhead.
Figures & tables
Fig. 1: FCIL scenario in LEO: edge satellites perform on-board class-incremental training and synchronize with a regional aggregation satellite via inter-satellite links (ISL), without reliance on ground stations.
Fig. 2: System scenario of MLFCIL.
Notation
Description
N , T , C
Number of clients, tasks, and classes.
N , Yt , Y1:t
Client index set; class set of task t ; cumulative class set.
Di(t)
Local dataset at client i for task t .
ni(c) , Nc
Class- c samples at client i ; total Nc=∑ini(c) .
θ={θf,θc}
Model: feature extractor θf and classifier θc .
θi , θG , θold
Local model at client i ; global model; teacher model from previous task.
Fig. 5: Stability-plasticity gradient projection. (a) Before projection (conflict). (b) After projection (resolved).
Mechanism
θf ( Extractor )
θc ( Classifier )
Lcls (plasticity)
✓ (projected)
✓
Ldistill (stability)
✓
✓
Lreplay (stability)
—
✓
Adaptive balancing
adjusts λ globally
Gradient projection
✓
—
Class-aware aggr.
—
✓
TABLE II: Which mechanisms update which parameter group ( θf vs. θc ), and where gradient conflicts are resolved (projection on θf ).
Method
A1
A2
A3
Aˉ
PD ↓
FedAvg
78.2
52.4
41.3
57.3
36.9
FedAvg+KD
78.2
60.1
53.6
64.0
24.6
FedAvg+Replay
78.2
61.8
55.2
65.1
23.0
MLFCIL (Ours)
78.2
70.5
67.8
72.2
10.4
Joint Training (Oracle)
78.2
76.8
75.1
76.7
3.1
TABLE III: Cumulative accuracy (%) across incremental tasks on NWPU-RESISC45. Aˉ : average incremental accuracy; PD: performance degradation ( A1−AT ). Best results (excluding oracle) are in bold .
Fig. 6: Cumulative accuracy across three incremental tasks for all compared methods.
Configuration
A2
A3
Aˉ
PD ↓
FedAvg (none)
52.4
41.3
57.3
36.9
+CW
55.1
44.6
59.3
33.6
+CW+KD
61.8
54.3
64.8
23.9
+CW+KD+MR
64.5
58.7
67.1
19.5
+CW+KD+MR+CA
66.2
61.4
68.6
16.8
+CW+KD+MR+CA+AB
67.8
63.5
69.8
14.7
TABLE IV: Ablation study on the NWPU-RESISC45 dataset. CW: class-reweighted loss; KD: knowledge distillation; MR: memory replay; CA: class-aware aggregation; AB: adaptive balancing; DC: drift compensation; GP: gradient projection. “Full” denotes MLFCIL with all components.
Fig. 7: Ablation study: final accuracy A3 for each incremental configuration in Table IV .
Fig. 8: Forgetting-aware adaptive balancing dynamics. (a) Forgetting score Fi(r) across rounds. (b) Adapted loss weights λdistill(r) and λreplay(r) .
Fig. 9: Gradient conflict analysis. (a) Frequency of gradient conflicts ( cos(gplas,gstab)<0 ) across training steps. (b) Cosine similarity distribution between plasticity and stability gradients with and without projection.
Fig. 10: Old-class vs. new-class accuracy across tasks for MLFCIL and FedAvg.
Fig. 11: Accuracy comparison between old and new classes across tasks.
Method
Dirichlet αDir
0.1
0.3
0.5
1.0
5.0
Δ↓
FedAvg
31.7
37.2
41.3
48.6
54.1
22.4
FedAvg+KD
43.8
49.1
53.6
58.3
62.5
18.7
FedAvg+Replay
45.2
50.8
55.2
59.7
63.4
18.2
Ours
58.4
63.7
67.8
71.2
73.5
15.1
TABLE V: Final accuracy A3 (%) under different Non-IID levels (Dirichlet αDir ). Δ : accuracy drop from αDir=5.0 to αDir=0.1 .
Fig. 12: Per-class accuracy for six representative classes (two from each of the three tasks), evaluated after all tasks, under Non-IID distributions ( αDir=0.5 ).
Fig. 13: Impact of memory buffer size on final accuracy A3 .
Component
Type
Cost
Communication per round
Model params
bidir.
∼ 83 MB
Prototypes (45 × 256)
up+down
+45 KB (+0.1%)
Class counts (45 int.)
upload
+0.2 KB
Computation per step
Teacher forward (KD)
1 × fwd
+2.5%
TABLE VI: Resource overhead analysis. All overhead percentages are relative to FedAvg.
School of Engineering and Applied Science, Washington State University, Richland, WA 99354, USA · Institute for Software Technology, German Aerospace Center (DLR), Porz, 51147 Cologne, Germany