🤖 AI Summary
Balancing privacy budget and data utility remains challenging in Local Differential Privacy (LDP). Method: This paper proposes the Adaptive Bipartite Randomized Response (BRR) mechanism, the first to formulate LDP perturbation as a globally optimal linear programming problem; it rigorously proves that utility maximization is equivalent to maximizing the number of high-value outputs released with the same probability as the true value. BRR achieves this via generalized randomized response modeling, constrained optimization, and downstream-task-aware utility functions—explicitly incorporating distance sensitivity for decision trees and deep learning. Contribution/Results: Theoretical analysis establishes optimality, while empirical evaluation demonstrates that BRR significantly outperforms state-of-the-art continuous- and distributed-LDP mechanisms across diverse benchmarks, improving utility by 20%–50% with near-linear time complexity.
📝 Abstract
With the increasing importance of data privacy, Local Differential Privacy (LDP) has recently become a strong measure of privacy for protecting each user's privacy from data analysts without relying on a trusted third party. In many cases, both data providers and data analysts hope to maximize the utility of released data. In this paper, we study the fundamental trade-off formulated as a constrained optimization problem: maximizing data utility subject to the constraint of LDP budgets. In particular, the Generalized Randomized Response (GRR) treats all discrete data equally except for the true data. For this, we introduce an adaptive LDP mechanism called Bipartite Randomized Response (BRR), which solves the above privacy-utility maximization problem from the global standpoint. We prove that for any utility function and any privacy level, solving the maximization problem is equivalent to confirming how many high-utility data to be treated equally as the true data on release probability, the outcome of which gives the optimal randomized response. Further, solving this linear program can be computationally cheap in theory. Several examples of utility functions defined by distance metrics and applications in decision trees and deep learning are presented. The results of various experiments show that our BRR significantly outperforms the state-of-the-art LDP mechanisms of both continuous and distributed types.