• 校内登录
访问量:   最后更新时间:--

田锋

性别:男
职称:教授
职务:电子与信息学部副主任
主要任职:视觉信息与应用国家工程研究中心常务副主任
其他任职:陕西省大数据知识工程重点实验室
博士生导师:是
硕士生导师:是
学历:博士研究生毕业
学位:博士
所在单位:计算机科学与技术学院
电子邮箱:
办公地点:
联系方式:
学科:计算机科学与技术
我的新闻
当前位置: 中文主页 > 我的新闻
联合指导本科生论文被EMNLP2026主会录用
发布时间:2026-08-21    点击次数:

发布时间:2026-08-21

文章标题:联合指导本科生论文被EMNLP2026主会录用

摘要:论文题目:PGPO: Prototype-Guided Progressive Obfuscation for Privacy-Preserving LLM-Enhanced Recommendation 论文作者:Shengxiang Lin, Jiajie Su, Pengyang Zhou, Xiang Chen, Xiaolin Zheng, Feng Tian, Chaochao Chen

内容:

录用通知如下:


Dear Authors,

Congratulations! We are delighted to inform you that your submission to EMNLP 2026, PGPO: Prototype-Guided Progressive Obfuscation for Privacy-Preserving LLM-Enhanced Recommendation, has been accepted as a Main Conference paper. We look forward to welcoming you to EMNLP 2026 in Budapest. Please carefully review the camera-ready requirements and information below.

This year, we received an unprecedented 17669 submissions. We accepted 2719 as Main Conference papers and 2533 to Findings of the ACL. This represents an acceptance rate of 15.4% for Main Conference papers and 14.3% for Findings papers.



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://anonymous.4open.science/r/PGPO/.