REVIEW 3 cited by
PAPILLON: Privacy Preservation from Internet-based and Local Language Model Ensembles
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Users can divulge sensitive information to proprietary LLM providers, raising significant privacy concerns. While open-source models, hosted locally on the user's machine, alleviate some concerns, models that users can host locally are often less capable than proprietary frontier models. Toward preserving user privacy while retaining the best quality, we propose Privacy-Conscious Delegation, a novel task for chaining API-based and local models. We utilize recent public collections of user-LLM interactions to construct a natural benchmark called PUPA, which contains personally identifiable information (PII). To study potential approaches, we devise PAPILLON, a multi-stage LLM pipeline that uses prompt optimization to address a simpler version of our task. Our best pipeline maintains high response quality for 85.5% of user queries while restricting privacy leakage to only 7.5%. We still leave a large margin to the generation quality of proprietary LLMs for future work. Our data and code is available at https://github.com/siyan-sylvia-li/PAPILLON.
Forward citations
Cited by 3 Pith papers
-
Adaptive Backtracking for Privacy Protection in Large Language Models
A training-free backtracking defense that rewrites RAG output at the first sign of privacy leakage improves privacy utility scores by up to 15% over sanitization and prompting baselines on a new healthcare and finance...
-
Learning Obfuscations Of LLM Embedding Sequences: Stained Glass Transform
A learned stochastic embedding obfuscator, the Stained Glass Transform, is claimed to reduce mutual information between prompts and their server-side representations while preserving LLM utility.
-
Reward-Free Evolving Agents via Pairwise Validator
A frozen LLM making binary parent-vs-child comparisons can replace the scalar reward in self-evolving agent loops, matching or beating reward-gated evolution on most settings.
Discussion (0). Sign in to comment.