Constructing Algorithmic Stability from Support Unlearning
Support unlearning is introduced, a deletion axiom that aligns only the support of a post-deletion map with that of retraining and is strictly weaker than certified unlearning, and it is proved that unlearning stability coincides with classical uniform stability and controls the generalization gap.