Skip to content

Profile-DP: Differential Privacy for User-Controlled Profile Release in Personalized LLM Inference

Oct 2026 · 0 citations · 44 references
Computer Science

TL;DR

Profile-DP is introduced, a policy-aware local differential privacy framework designed specifically for user-profile release in personalized LLM inference, which provably bounds the release of user-withheld facts while treating public instructions, profile schemas, and authorized facts as public side information.

Abstract

Personalized large language models (LLMs) increasingly rely on profile-conditioned inference, pairing public requests with rich, user-specific facts. This paradigm exposes the user profile itself, together with the user's explicit sharing preferences. We introduce Profile-DP, a policy-aware local differential privacy framework designed specifically for user-profile release in personalized LLM inference. Profile-DP provably bounds the release of user-withheld facts while treating public instructions, profile schemas, and authorized facts as public side information. By generating a privatized profile that composes with the public instruction prior to answer generation, our framework decouples formal privacy guarantees from downstream model behavior. We develop two finite-domain mechanisms satisfying Profile-DP: DP-SLOT independently perturbs protected attributes, while DP-BLOCK uses public semantic decisions to coordinate their release and jointly sample related attributes. A positive, public compatibility prior connects these attributes while preserving a profile-level privacy bound. On PEEP, DP-BLOCK leads the utility composite among DP methods at all 13 structured budgets and is closest to the ideal privacy--utility point in 18 of 26 format--budget settings under our composite weighting. Direct measurements reveal complementary strengths: DP-BLOCK discloses less, while DP-SLOT retains more authorized facts. These results make policy-aware profile release a practical basis for studying privacy and personalization.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

EP-Mem: Elastic Privacy Memory for Social Relationship-Aware LLM Agents

This paper proposes EP-Mem, an Elastic Privacy Memory architecture that reframes privacy as user-owned boundary control across social roles, and constructs EP-Bench, to the authors' knowledge the first long-term multi-party benchmark with cross-session correlated events for policy-conditioned relational disclosure.

Feng-Zhou Sun, Yuan Zhang, Xin-Tong Yu et al. · 1 citation
Preprint Oct 2026

InferPriv: Evaluating Inferential Privacy Leakage in LLM Assistants

A benchmark that measures whether an honest-but-curious recipient can infer a user's sensitive attributes from an LLM's reply on routine task is introduced, and it is found that inferential leakage substantially exceeds direct leakage across models and prompts.

Peng Huang, Yi-Wei Fu, Luo-Xi Meng et al. · 0 citations
#machine learning Review Oct 2026

Differential Privacy Protected Preference Alignment on Survey Derived Data

Preference alignment enables language models to better reflect human values, but the preference data contains sensitive information, especially when derived from surveys about political beliefs, social norms, religion, gender attitudes, and cultural values. This paper studies privacy-preserving alignment on questionnai...

Xiu-Yuan Qi, Yi Wang, Wen-Jie Wang · 0 citations
Review Oct 2026

From One Query to Many: A Critical Survey of Privacy Accounting in RAG

A framework that interprets a DP-RAG guarantee along three dimensions: privacy granularity, accounting scope, and release boundaries is proposed and concludes that an $\eps$ is a claim only together with the three slots: the protected unit, the accounting scope, and the release boundary.

Zhi-Yuan Zhang · 0 citations
Open access 2018

Supporting Privacy Protection in Personalized Web Search

A PWS framework called UPS is proposed that aims at maintaining equilibrium between two predictive metrics that gauges the utility of personalization and the privacy risk of uncovering the generalized profile, and GreedyDP and GreedyIL are the two greedy algorithms for runtime generalization.

Brahmaji Katragadda, Sk.Meera Shari · 0 citations
Conference Open access Apr 2026

CAT-LDP: Cloud-Edge Adaptive Taxonomy Under Local Differential Privacy

The results show that combining category-space modeling with cloud-local task decoupling can effectively reduce noise amplification in long-tail sparse settings and provide a better balance between privacy and utility for implicit-feedback recommendation.

Jun-Zhe Yang, Chang Xia, Xi-Yun Wang et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.