Efficient Computation of the Privacy Funnel: An Expectation-Maximization Relaxed Approach
A novel relaxation variant of the Privacy Funnel (PF) problem is proposed, which is proven to be equivalent to the original problem in terms of optimal solutions and values. An accurate Alternating Expectation Minimization (AEM) algorithm is developed, with theoretically guaranteed convergence.