ALU Framework: Scalable Unlearning with Better Compute than Retraining
gkdziugaite · x · 2026-07-07
The Asymmetric Langevin Unlearning (ALU) framework boasts two core capabilities: massive unlearning capacity, capable of forgetting a constant fraction of the private dataset (a scale where standard symmetric methods become infeasible); and rigorous computational advantages, as ALU's computational complexity is theoretically superior to retraining from scratch while maintaining unlearning certification.
Related event: ICML 2026 Paper Proposes ALU Framework for Large-Scale Machine Unlearning(5 posts)→
More from Research
- Cognition's SWE-2 uses a KKT duality argument in RL to shift the effort Pareto curve — YouJiacheng · 2026-09-11
- VidMap uses RoMa coarse matching on all frames, fine-scale only for keyframes — ducha_aiki · 2026-09-11
- Bug Hunt Bench author: leaderboard noise is about 2-3 points — PawelHuryn · 2026-09-11
- PNAS paper shows a tiny billiard-ball system is a universal computer — undecidability lives in two dimensions — eigensteve · 2026-09-11
- New paper: Absolute pose estimation from affine cues and gravity direction — ducha_aiki · 2026-09-11
- LoMa Paper Ships REALLY HardPairs Dataset, Accepted at ECCV 2026 — ducha_aiki · 2026-09-11