Pith. sign in

REVIEW 5 cited by

Intrinsic Test of Unlearning Using Parametric Knowledge Traces

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.11614 v3 pith:5I4FOT4F submitted 2024-06-17 cs.CL cs.AI

classification cs.CLcs.AI
keywords knowledgeunlearningconceptsmodelvectorsconceptvectorsparametrictraces
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The task of "unlearning" certain concepts in large language models (LLMs) has attracted immense attention recently, due to its importance in mitigating undesirable model behaviours, such as the generation of harmful, private, or incorrect information. Current protocols to evaluate unlearning methods largely rely on behavioral tests, without monitoring the presence of unlearned knowledge within the model's parameters. This residual knowledge can be adversarially exploited to recover the erased information post-unlearning. We argue that unlearning should also be evaluated internally, by considering changes in the parametric knowledge traces of the unlearned concepts. To this end, we propose a general evaluation methodology that leverages vocabulary projections to inspect concepts encoded in model parameters. We use this approach to localize "concept vectors" - parameter vectors that encode concrete concepts - and construct ConceptVectors, a benchmark dataset containing hundreds of common concepts and their parametric knowledge traces within two open-source LLMs. Evaluation on ConceptVectors shows that existing unlearning methods minimally impact concept vectors and mostly suppress them during inference, while directly ablating these vectors demonstrably removes the associated knowledge and significantly reduces the model's susceptibility to adversarial manipulation. Our results highlight limitations in behavioral-based unlearning evaluations and call for future work to include parameter-based evaluations. To support this, we release our code and benchmark at https://github.com/yihuaihong/ConceptVectors.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Understanding Machine Unlearning Through the Lens of Mode Connectivity

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Unlearned models often lie in connected low-loss basins, and that geometry can predict unlearning difficulty and improve robustness to relearning attacks.

  2. Understanding Machine Unlearning Through the Lens of Mode Connectivity

    cs.LG 2026-07 unverdicted novelty 6.0 of 10

    Unlearned models usually connect to their originals by smooth low-loss paths, and the smoothness of that path can predict how hard the unlearning task was.

  3. A Mechanistic Perspective and Circuit-Guided Difficulty Metric for Unlearning

    cs.LG 2026-01 conditional novelty 6.0 of 10

    A circuit-similarity score predicts which samples an LLM unlearning method will fail to erase, with hard samples relying on deeper, output-facing pathways.

  4. Towards a Principled Evaluation of Knowledge Editors

    cs.CL 2025-07 conditional novelty 6.0 of 10

    The choice of evaluation metric, generation length, and edit batch size changes the ranking of knowledge editors, and exact string matching produces false positives.

  5. Revisiting the Past: Data Unlearning with Model State History

    cs.LG 2025-06 unverdicted novelty 5.0 of 10

    MSA performs data unlearning in LLMs by arithmetic operations on prior model checkpoints to remove targeted datapoint influence, with experiments showing competitive or better results than existing unlearning methods.

Pith tools