Pith. sign in

REVIEW 1 cited by

Rethinking Privacy in Machine Learning Pipelines from an Information Flow Control Perspective

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

arxiv 2311.15792 v1 pith:2QN2ZTYW submitted 2023-11-27 cs.LG cs.CR

classification cs.LGcs.CR
keywords controlinformationprivacyaccessmodelmodelslearningmachine
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Modern machine learning systems use models trained on ever-growing corpora. Typically, metadata such as ownership, access control, or licensing information is ignored during training. Instead, to mitigate privacy risks, we rely on generic techniques such as dataset sanitization and differentially private model training, with inherent privacy/utility trade-offs that hurt model performance. Moreover, these techniques have limitations in scenarios where sensitive information is shared across multiple participants and fine-grained access control is required. By ignoring metadata, we therefore miss an opportunity to better address security, privacy, and confidentiality challenges. In this paper, we take an information flow control perspective to describe machine learning systems, which allows us to leverage metadata such as access control policies and define clear-cut privacy and confidentiality guarantees with interpretable information flows. Under this perspective, we contrast two different approaches to achieve user-level non-interference: 1) fine-tuning per-user models, and 2) retrieval augmented models that access user-specific datasets at inference time. We compare these two approaches to a trivially non-interfering zero-shot baseline using a public model and to a baseline that fine-tunes this model on the whole corpus. We evaluate trained models on two datasets of scientific articles and demonstrate that retrieval augmented architectures deliver the best utility, scalability, and flexibility while satisfying strict non-interference guarantees.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. WebANNS: Fast and Efficient Approximate Nearest Neighbor Search in Web Browsers

    cs.IR 2025-07 conditional novelty 5.0 of 10

    A new browser-native ANNS engine uses WebAssembly, lazy loading, and a memory optimizer to cut P99 query latency by up to 743.8x and memory use by up to 39% compared to Mememo.

Pith tools