Repository navigation
Metrics
contilab computes metrics after training from raw data stored per run, so a metric can be added later with
contilab metrics <exp> --add <name>. A metric that is undefined for a run returns no value with a reason (for
example "needs at least 2 tasks") instead of a misleading number.
Notation:
| Tier | Raw records collected |
|---|---|
core |
accuracy matrix, initial accuracy, predictions/confidences per task end, cost |
extended |
+ continual-evaluation stream (every ρ steps), learning curves (first β batches), probe features, neuron activations, LM perplexity |
full |
+ parameter snapshots, loss-interpolation curves, gradient-cosine matrices, few-shot recovery |
| Metric | Definition | Reference |
|---|---|---|
acc |
Lopez-Paz & Ranzato 2017 | |
aia |
|
Rebuffi et al. 2017 |
bwt |
Lopez-Paz & Ranzato 2017 | |
fwt |
|
Lopez-Paz & Ranzato 2017 |
forgetting |
mean of |
Chaudhry et al. 2018 |
relative_forgetting |
mean of |
— |
learning_acc |
|
Riemer et al. 2019 |
intransigence |
$\frac{1}{T}\sum_j(a^j-R{j,j})$ with $a^$ from the Joint run of the same preset and seed | Chaudhry et al. 2018 |
val_acc |
final average accuracy on the validation splits (10 % of each task's training data): the score for selecting sweep variants, never a reported result | — |
| Metric | Definition | Reference |
|---|---|---|
min_acc |
mean over |
De Lange et al. 2023 |
wc_acc |
De Lange et al. 2023 | |
stability_gap |
accuracy of task |
De Lange et al. 2023 |
windowed_forgetting |
largest drop within a window Δ = 10 % of a task's length; undefined when Δ < ρ | De Lange et al. 2023 |
aaa |
average over evaluation points of the mean accuracy on seen tasks (anytime accuracy) | Caccia et al. 2022 |
lca |
|
Chaudhry et al. 2019 |
| Metric | Definition | Reference |
|---|---|---|
probe_acc |
matrix |
Davari et al. 2022 |
repr_forgetting / head_forgetting
|
probe drop |
Davari et al. 2022 |
cka_final, cka_matrix
|
linear CKA between features of the same samples at different times; cka_final averages |
Kornblith et al. 2019 |
feature_drift |
mean normalised L2 movement of a task's features from when it was learned to the end | Ramasesh et al. 2021 |
| Metric | Definition | Reference |
|---|---|---|
dormant_ratio (+ curve) |
share of neurons with normalised mean activation |
Sokar et al. 2023 |
effective_rank, srank (+ curve) |
exp-entropy of normalised singular values; smallest k covering 99 % of singular mass | Roy & Vetterli 2007; Kumar et al. 2021 |
weight_norms |
per-layer weight norm after each task | Dohare et al. 2024 |
Structural plasticity diagnostics are symptoms rather than guarantees; report them next to learning_acc and
lca.
| Metric | Definition | Reference |
|---|---|---|
recency_bias |
Class-IL: share of old-task samples predicted as the newest task's classes | Wu et al. 2019; Masana et al. 2022 |
task_confusion |
true-task × predicted-task matrix | Masana et al. 2022 |
ece, ece_per_task
|
expected calibration error, 15 bins | Guo et al. 2017 |
| Metric | Definition | Reference |
|---|---|---|
recovery |
|
Zheng et al., ICLR 2025 |
loss_barrier |
|
Mirzadeh et al. 2020 |
grad_interference |
mean off-diagonal cosine between task gradients | — |
general_ppl_delta (+ curve) |
WikiText perplexity of the original LM head after training minus before (general-ability retention) | Wang et al. 2023 (TRACE) |
wall_time, samples_per_s, peak_mem (per run group), trainable_params, buffer_bytes, state_bytes,
model_bytes, total_flops (measured with FlopCounterMode per member, including replay, reference gradients,
experts and distillation).
-
buffer_bytesis the memory a buffer of stored samples would take: items × (input + label + attention mask bytes, plus per-item extras such as DER++ logits). contilab stores only dataset indices internally, so index bytes are not counted. The transfer set ofbuffer/fulldistillation is counted too. -
state_bytesis the extra strategy state kept between tasks, e.g. the EWC Fisher diagonal and anchor parameters or the LwF teacher copy.
- mean ± std over seeds, bootstrap 95 % confidence intervals (10,000 resamples)
- paired test against a baseline method: Wilcoxon signed-rank for n ≥ 6 seeds, otherwise an exact sign-flip permutation test (with 3 seeds the smallest possible p is 0.25, so the report warns about statistical power)
- across benchmarks: average ranks, Friedman test, Nemenyi critical difference (Demšar 2006)
Accuracy-matrix heatmaps, continual-evaluation curves with task boundaries, task-confusion matrices, CKA heatmaps, per-layer weight drift, gradient-interference heatmaps, PCA and t-SNE of features, loss-interpolation curves, critical-difference diagrams and throughput bars.
contilab — continual learning benchmark, distillation & model-merging framework · Repository · MIT License