| title | PGPO: Prototype-Guided Progressive Obfuscation for Privacy-Preserving LLM-Enhanced Recommendation |
|---|---|
| authors | Shengxiang Lin, Jiajie Su, Pengyang Zhou, Xiang Chen, Xiaolin Zheng, Feng Tian, Chaochao Chen |
| date | 2026-08-26 |
| venue | arXiv (preprint, not peer reviewed) |
| id | arXiv:2611.23236 |
| affiliation | Zhejiang University |
| upvotes | 2 (Hugging Face Daily Papers, 2026-11-21) |
| links | abs pdf hf code |
| cite | |
| related | nanoMuse: An Open-Source Personal Agent for Every Device You Own SplatAnything: Gaussian Spacing Normalization for Feed-forward 3DGS across Arbitrary Scenes Any Time, Any Space: A World-State-Centric Framework for Agentic Video Generation TriSplat: Simulation-Ready Feed-Forward 3D Scene Reconstruction More Methods, Better Agents? A Reality Check on Self-Distillation in Agentic Reinforcement Learning |
| abstract | LLM-enhanced recommender systems encode item side information into semantic embeddings, but these embeddings may leak sensitive textual attributes through inversion attacks. Existing input-side defenses rely on trusted collection or local token perturbation, often disrupting the inter-item semantic topology needed for recommendation. To address it, we introduce relational fidelity as the key objective, requiring semantic shift for privacy while preserving relative item relations for utility. Based on this principle, we propose prototype-guided progressive obfuscation (PGPO), which learns topology-aware obfuscation anchors for high-influence prototype words and propagates them through a static semantic graph. PGPO is optimized with GRPO using individual dissimilarity, structural consistency, and semantic constraint rewards. Experiments on two benchmarks show strong inversion defense with near-upper-bound recommendation performance. The code is available at https://github.com/Shengxiang-Lin/PGPO. |
bibtex
@misc{lin2026pgpo,
title={PGPO: Prototype-Guided Progressive Obfuscation for Privacy-Preserving LLM-Enhanced Recommendation},
author={Shengxiang Lin and Jiajie Su and Pengyang Zhou and Xiang Chen and Xiaolin Zheng and Feng Tian and Chaochao Chen},
year={2026},
eprint={2611.23236},
archivePrefix={arXiv},
url={https://arxiv.org/abs/2611.23236}
}