mlsanityData to 7 Oct 2026

U-CAN: Utility-Aware Contrastive Attenuation for Efficient Unlearning in Generative Recommendation

arXiv 2602.23400 ↗First posted 26 Feb 2026cs.LGcited by 1

On the map: LLM safety and security → Membership inference attacks

Abstract (arXiv)

Generative Recommendation (GenRec) typically leverages Large Language Models (LLMs) to redefine personalization as an instruction-driven sequence generation task. However, fine-tuning on user logs inadvertently encodes sensitive attributes into model parameters, raising critical privacy concerns. Existing Machine Unlearning (MU) techniques struggle to navigate this tension due to the Polysemy Dilemma, where neurons superimpose sensitive data with general reasoning patterns, leading to catastrophic utility loss under traditional gradient or pruning methods. To address this, we propose Utility-aware Contrastive AttenuatioN (U-CAN), a precision unlearning framework that operates on low-rank adapters. U-CAN quantifies risk by contrasting activations and focuses on neurons with asymmetric responses that are highly sensitive to the forgetting set but suppressed on the retention set. To safeguard performance, we introduce a utility-aware calibration mechanism that combines weight magnitudes with retention-set activation norms, assigning higher utility scores to dimensions that contribute strongly to retention performance. Unlike binary pruning, which often fragments network structure, U-CAN develop adaptive soft attenuation with a differentiable decay function to selectively down-scale high-risk parameters on LoRA adapters, suppressing sensitive retrieval pathways and preserving the topological connectivity of reasoning circuits. Experiments on two public datasets across seven metrics demonstrate that U-CAN achieves strong privacy forgetting, utility retention, and computational efficiency.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Membership inference attacks, one of 12 directions in LLM safety and security. Builds on 28 of its 55 references that are in the map. First posted on arXiv 26 Feb 2026.

Builds on

28 of 55 references.

Closest ancestors · 1

Same direction, newest first

  1. 2022Making Recommender Systems Forget: Learning and Unlearning for Erasable Recommendation22 Mar

Other references · 27

  1. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  3. 2020Extracting Training Data from Large Language Modelscited by 2,144
  4. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
  5. 2019Machine Unlearningcited by 1,020
  6. 2023Unifying Large Language Models and Knowledge Graphs: A Roadmapcited by 663
  7. 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearningcited by 484
  8. 2019Making AI Forget You: Data Deletion in Machine Learningcited by 447
  9. 2022Knowledge Unlearning for Mitigating Privacy Risks in Language Modelscited by 424
  10. 2022Recommendation as Language Processing (RLP): A Unified Pretrain, Personalized Prompt & Predict Paradigm (P5)cited by 396
  11. 2023SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generationcited by 376
  12. 2023TALLRec: An Effective and Efficient Tuning Framework to Align Large Language Model with Recommendationcited by 336
15 more
  1. 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 303
  2. 2023MQuAKE: Assessing Knowledge Editing in Language Models via Multi-Hop Questionscited by 292
  3. 2022Quark: Controllable Text Generation with Reinforced Unlearningcited by 236
  4. 2025Unveiling Privacy Risks in LLM Agent Memorycited by 99
  5. 2022Trustworthy Graph Neural Networks: Aspects, Methods and Trendscited by 88
  6. 2024Large Language Models-guided Dynamic Adaptation for Temporal Knowledge Graph Reasoningcited by 41
  7. 2024Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMscited by 36
  8. 2024Retrieval-Augmented Conversational Recommendation with Prompt-based Semi-Structured Natural Language State Trackingcited by 18
  9. 2024Exact and Efficient Unlearning for Large Language Model-based Recommendationcited by 17
  10. 2024Dynamic Graph Unlearning: A General and Efficient Post-Processing Method via Gradient Transformationcited by 15
  11. 2025EARN: Efficient Inference Acceleration for LLM-based Generative Recommendation by Register Tokenscited by 6
  12. 2025NR4DER: Neural Re-ranking for Diversified Exercise Recommendationcited by 5
  13. 2025Beyond Whole Dialogue Modeling: Contextual Disentanglement for Conversational Recommendationcited by 4
  14. 2025Towards Distribution Matching between Collaborative and Language Spaces for Generative Recommendationcited by 3
  15. 2025Unlearning for Federated Online Learning to Rank: A Reproducibility Studycited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.