An Efficient Difference-of-Convex Solver for Privacy Funnel

arXiv:2403.04778v1 Announce Type: cross
Abstract: We propose an efficient solver for the privacy funnel (PF) method, leveraging its difference-of-convex (DC) structure. The proposed DC separation results in a closed-form update equation, which allows straightforward application to both known and unknown distribution settings. For known distribution case, we prove the convergence (local stationary points) of the proposed non-greedy solver, and empirically show that it outperforms the state-of-the-art approaches in characterizing the privacy-utility trade-off. The insights of our DC approach apply to …

application arxiv case convergence cs.cr cs.it cs.lg distribution equation funnel local math.it points privacy prove results settings structure update