Pith. sign in

Towards understanding the feasibility of machine unlearning

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.LG 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

How Hard Can It Be? Hardness-Aware Multi-Objective Unlearning

cs.LG · 2026-06-01 · unverdicted · novelty 6.0

HAMU is a constrained-optimization unlearning method that uses forget-retain data similarity as a hardness measure to guarantee specified forget-quality gains while minimizing retain degradation.

citing papers explorer

Showing 1 of 1 citing paper.

  • How Hard Can It Be? Hardness-Aware Multi-Objective Unlearning cs.LG · 2026-06-01 · unverdicted · none · ref 4

    HAMU is a constrained-optimization unlearning method that uses forget-retain data similarity as a hardness measure to guarantee specified forget-quality gains while minimizing retain degradation.