Zizhao Hu
GLAMOUR · University of Southern California · 2026
Continual Learning — my background
Unlearning — our progress
Discussion — questions and future directions
Models must learn new tasks without forgetting old ones
Learning of Task 1 preserved
Catastrophic Forgetting
Use the model itself to generate old task data — train alongside new tasks to prevent forgetting
Standard Generative Replay
Equal weight to all replay samples — treats old tasks uniformly
Our Work: Time-Aware Synthetic Replay
Key difference: Extra regularization on the synthetic data loss — more recent and more probable (self-verification confidence) synthetic samples receive higher weight, placing more trust on high-quality replay
No need to store original data — the model is its own memory
When AI continuously trains on synthetic AI-generated data only, model utility degrades
The takeaway from continual learning
This same principle applies to machine unlearning — where the "new task" is removing knowledge
Learning new things while not forgetting old ones
⚠️ Catastrophic Forgetting
Training on new data destroys old knowledge — the weights shift and old task performance drops to near-zero.
🎯 The "New Task" = Forgetting
The forget set defines a target distribution to unlearn, while the retain set is the "old task" that must be preserved — just like CL.
Key insight: Unlearning is a special case of continual learning — the new task is removing knowledge, the old task is preserving everything else.
High probability on memorized sequence → green tokens
Low probability on same sequence → red/orange tokens
Each token colored by P(token|context). Green = high confidence, Red = low confidence
Important information has low autoregressive probability
Generic tokens (articles, prepositions) → high P. Common names can also have high P, but rare relations and specific facts have low P, flatter distribution
Low-P memorized tokens → what we edit out. Bottom P% by probability = easiest to demote
Target the important signal precisely while maintaining other parts will minimize peripheral damage
Only the bottom P% tokens are edited — all other tokens serve as retain targets
Non-threshold tokens remain unchanged in the target — the forget document itself acts as an implicit retain set
We change the target of bottom P% tokens — if the model doesn't have memorization, those tokens already have naturally low probability, so our change is minimal — effectively a no-op
Llama-3.2-1B-Instruct · 20 authors (400 QA pairs) to forget
| Method | F-ROUGE ↓ | F-Prob ↓ | Retain ↑ | RA ↑ | WF ↑ |
|---|---|---|---|---|---|
| Full Model MEM | 0.820 | 0.881 | 0.691 | 0.539 | 0.587 |
| Retain90 GOLD | 0.379 | 0.116 | 0.700 | 0.523 | 0.577 |
| NPO | 0.247 | 0.123 | 0.440 | 0.562 | 0.572 |
| GradDiff +RT | 0.003 | ≈ 0 | 0.366 | 0.343 | 0.569 |
| DPO +RT | 0.078 | 0.281 | 0.682 | 0.500 | 0.586 |
| RMU +RT | 0.111 | 0.010 | 0.660 | 0.515 | 0.577 |
| Ours P=5% | 0.714 | 0.856 | 0.687 | 0.540 | 0.586 |
| Ours P=20% | 0.564 | 0.767 | 0.681 | 0.538 | 0.589 |
| Ours P=50% | 0.529 | 0.613 | 0.639 | 0.564 | 0.617 |
Key: Retain/RA/WF = per-split harmonic mean of (ROUGE, Prob, TruthRatio). Our method achieves best utility preservation among all methods — even those using retain sets.
Loading...
Llama-3.2-1B-Instruct · forget10 · 10 epochs · Self-Distillation
| Config | F-ROUGE ↓ | F-Prob ↓ | MU ↑ |
|---|---|---|---|
| Full Model MEM | 0.820 | 0.881 | 0.599 |
| Retain90 GOLD | 0.379 | 0.116 | 0.700 |
| P=80% bs=16 | 0.483 | 0.494 | 0.577 |
| P=50% BS=4 ★ | 0.367 | 0.395 | 0.610 |
| P=50% BS=8 | 0.420 | 0.514 | 0.607 |
| P=50% BS=16 BASE | 0.529 | 0.613 | 0.605 |
| P=50% BS=32 | 0.654 | 0.682 | 0.599 |
| P=50% +RT α=1 | 0.659 | 0.758 | 0.607 |
Higher demote percentage → more aggressive forgetting as expected, but at a slight MU cost
Smaller BS → much better forgetting. BS=4 achieves best forget ROUGE (0.367) while maintaining highest MU (0.610) — beats Gold on ROUGE!
Adding retain set with α=1.0 didn't improve forgetting — the implicit self-retain is already sufficient
Key finding: Batch size is the most impactful knob — BS=4 with P=50% achieves Pareto-optimal forgetting vs. utility. The retain set adds no value, confirming our method's self-regularizing nature.
Monotonic forgetting across all P values. Model utility remains stable at ~0.60 throughout training — near-zero degradation.
Zizhao Hu · University of Southern California · 2026