Private non-monotone submodular maximization

Xin Sun (), Gaidi Li (), Yapu Zhang () and Zhenning Zhang ()
Additional contact information
Xin Sun: Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology
Gaidi Li: Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology
Yapu Zhang: Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology
Zhenning Zhang: Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology

Journal of Combinatorial Optimization, 2022, vol. 44, issue 5, No 3, 3212-3232

Abstract: Abstract We propose a private algorithm for the problem of maximizing a submodular but not necessary monotone set function over a down-closed family of sets. The constraint is very general since it includes some important and typical constraints such as knapsack and matroid constraints. Our algorithm Differentially Private Measure Continuous Greedy is proved to be $${\mathcal {O}}(\epsilon )$$ O ( ϵ ) -differential private. For the multilinear relaxation of the above problem, it yields $$\left( Te^{-T}-o(1)\right) $$ T e - T - o ( 1 ) -approximation guarantee with additive error $${\mathcal {O}}\left( \frac{2\varDelta }{\epsilon n^4}\right) $$ O 2 Δ ϵ n 4 , where $$T\in [0,1]$$ T ∈ [ 0 , 1 ] is the stopping time of the algorithm, $$\varDelta $$ Δ is the defined sensitivity of the objective function, which is associated to a sensitive dataset, and n is the size of the given ground set. For a specific matroid constraint, we could obtain a discrete solution with near 1/e-approximation guarantee and same additive error by lossless rounding technique. Besides, our algorithm can be also applied in monotone case. The approximation guarantee is $$\left( 1-e^{-T}-o(1)\right) $$ 1 - e - T - o ( 1 ) when the submodular set function is monotone. Furthermore, we give a conclusion in terms of the density of the relaxation constraint, which is always at least as good as the tight bound $$(1-1/e)$$ ( 1 - 1 / e ) .

Keywords: Differential privacy; Submodular maximization; Down-closed family of sets; Measured continuous greedy; Approximation algorithm (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00875-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00875-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00875-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().