Pith. sign in

Rule: Reinforcement unlearning achieves forget-retain pareto optimality.arXiv preprint arXiv:2506.07171

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

3 Pith papers citing it

fields

cs.LG 2 cs.CL 1

years

2026 2 2025 1

representative citing papers

De-attribute to Forget for LLM Unlearning

cs.LG · 2026-05-29 · conditional · novelty 7.0

DareU unlearns LLMs by PPO-optimizing attribution rewards so outputs are no longer attributable to forget owners, outperforming loss-based methods on forget-utility trade-offs.

OFMU: Optimization-Driven Framework for Machine Unlearning

cs.LG · 2025-09-26 · reject · novelty 5.0

OFMU is a penalty-based bi-level optimizer for machine unlearning that alternates between a gradient-ascent forgetting step and a gradient-descent utility-restoration step, with a similarity penalty between forget and retain gradients.

citing papers explorer

Showing 3 of 3 citing papers.

  • De-attribute to Forget for LLM Unlearning cs.LG · 2026-05-29 · conditional · none · ref 12

    DareU unlearns LLMs by PPO-optimizing attribution rewards so outputs are no longer attributable to forget owners, outperforming loss-based methods on forget-utility trade-offs.

  • ASRU: Activation Steering Meets Reinforcement Unlearning for Multimodal Large Language Models cs.CL · 2026-05-15 · unverdicted · none · ref 25

    ASRU combines activation redirection and reward-optimized fine-tuning to unlearn cross-modal sensitive knowledge in MLLMs, reporting +24.6% better unlearning effectiveness and 5.8x higher generation quality on Qwen3-VL while preserving utility with limited retained data.

  • OFMU: Optimization-Driven Framework for Machine Unlearning cs.LG · 2025-09-26 · reject · none · ref 22

    OFMU is a penalty-based bi-level optimizer for machine unlearning that alternates between a gradient-ascent forgetting step and a gradient-descent utility-restoration step, with a similarity penalty between forget and retain gradients.