REGLU guides LoRA-based unlearning via representation subspaces and orthogonal regularization to outperform prior methods on forget-retain trade-off in LLM benchmarks.
arXiv preprint arXiv:2212.09573 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A survey that organizes machine unlearning verification methods into behavioral and parametric categories and outlines open problems.
citing papers explorer
-
Representation-Guided Parameter-Efficient LLM Unlearning
REGLU guides LoRA-based unlearning via representation subspaces and orthogonal regularization to outperform prior methods on forget-retain trade-off in LLM benchmarks.
-
Towards Reliable Forgetting: A Survey on Machine Unlearning Verification
A survey that organizes machine unlearning verification methods into behavioral and parametric categories and outlines open problems.