Skip to content
Preprint

A Privacy Study of Sparse Collaborative Inference

Aug 2026 · 0 citations · 26 references
Computer Science

TL;DR

It is concluded that the positions of sparse activations should be treated as sensitive transmitted data and audited carefully in the context of collaborative inference, and that sparsification reduces the leakage far less than it reduces the transmission cost.

Abstract

Collaborative inference (CI) splits a model between an edge device and a server, whereby the client computes an intermediate activation, transmits it, and the server completes the computation. This raises two concerns, the communication cost of the transmission and the risk that it reveals private information about the input. Recent work reduces this cost by sparsifying activations and entropy-coding the result. Sparsity has also been argued to improve privacy, on the intuition that transmitting fewer values reveals less about the input. We test this claim by decomposing the sparse activation into the retained values and the set of positions they occupy, and by reconstructing inputs from each component in isolation. We find that sparsification reduces the leakage far less than it reduces the transmission cost, and that the remaining risk shifts to the positions, which prior analyses treat as side information for decoding. Across natural-image and face datasets, the positions alone constitute a serious privacy risk, enabling high-fidelity reconstructions and re-identification of individuals. The leakage from the positions persists even when both the transmission cost and the task utility are low. We conclude that the positions of sparse activations should be treated as sensitive transmitted data and audited carefully in the context of collaborative inference. Code is available at https://github.com/an7123/Privacy-Study-Sparse-CI.

View source

Similar papers

Preprint Aug 2026

Privacy Without Regret: Differentially Private Inference-Time Alignment

Private Inference-Time Pessimism (PrivITP) is introduced, which combines $\chi^2$-regularized rejection sampling with a two-phase Gaussian mechanism, and achieves ex-post $(\epsilon,\delta)$-DP with a privacy cost independent of the number of responses, cleanly decouples the regularization parameter from the privacy pa...

I. Jain, Nandini Bhattad, Sayak Ray Chowdhury · 0 citations
Preprint Aug 2026

Spectrum-Aware Bounds on Invertibility for Privacy-Enhancing Instance Encoding

A family of new bounds that are tighter, applicable even to fully deterministic encoders, and applicable even to fully deterministic encoders can extend beyond MSE to other norm-based similarity metrics, by properly accounting for the encoder's spectral structure.

Seokjin Hwang, Yu-Ting Li, Kiwan Maeng · 0 citations
Preprint Aug 2026

Information Bottleneck under Perfect Privacy

In this work, we study the information bottleneck under perfect privacy, with particular emphasis on the active-rate regime, where the representation-rate constraint is binding and directly limits the achievable utility. The goal is to construct a representation that preserves utility-relevant information while remaini...

Junle Zhong, Mohamad Assaad, S. Sreekumar · 0 citations

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