pith. sign in

Are we making progress in unlearning?

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

fields

cs.LG 3 cs.CL 1

years

2026 4

representative citing papers

Is your algorithm unlearning or untraining?

cs.LG · 2026-04-09 · conditional · novelty 7.0

Machine unlearning conflates reversing the influence of specific training examples (untraining) with removing the full underlying distribution or behavior (unlearning).

How to sketch a learning algorithm

cs.LG · 2026-04-08 · unverdicted · novelty 5.0

A sketching method based on higher-order derivatives enables efficient data deletion predictions for deep learning models under a stability assumption with near-linear overhead in error and failure parameters.

citing papers explorer

Showing 4 of 4 citing papers.

  • Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data cs.LG · 2026-05-11 · unverdicted · none · ref 59

    Asymmetric Langevin Unlearning uses public data to suppress unlearning noise costs by O(1/n_pub²), enabling practical mass unlearning with preserved utility under distribution mismatch.

  • Is your algorithm unlearning or untraining? cs.LG · 2026-04-09 · conditional · none · ref 33

    Machine unlearning conflates reversing the influence of specific training examples (untraining) with removing the full underlying distribution or behavior (unlearning).

  • Representation-Guided Parameter-Efficient LLM Unlearning cs.CL · 2026-04-19 · unverdicted · none · ref 18

    REGLU guides LoRA-based unlearning via representation subspaces and orthogonal regularization to outperform prior methods on forget-retain trade-off in LLM benchmarks.

  • How to sketch a learning algorithm cs.LG · 2026-04-08 · unverdicted · none · ref 19

    A sketching method based on higher-order derivatives enables efficient data deletion predictions for deep learning models under a stability assumption with near-linear overhead in error and failure parameters.