Corpus ID: 219124473

Differentially Private Decomposable Submodular Maximization

  title={Differentially Private Decomposable Submodular Maximization},
  author={Anamay Chaturvedi and Huy L. Nguyen and Lydia Zakynthinou},
We study the problem of differentially private constrained maximization of decomposable submodular functions. A submodular function is decomposable if it takes the form of a sum of submodular functions. The special case of maximizing a monotone, decomposable submodular function under cardinality constraints is known as the Combinatorial Public Projects (CPP) problem [Papadimitriou et al., 2008]. Previous work by Gupta et al. [2010] gave a differentially private algorithm for the CPP problem. We… Expand
Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints
A differentially private (1− κe )-approximation algorithm is proposed, where κ ∈ [0, 1] is the total curvature of the submodular set function, which improves upon prior works in terms of approximation guarantee and query complexity under the same privacy budget. Expand


Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints
This paper gives the first $\frac{1}{2}$-approximation algorithm that preserves differential privacy for maximizing monotone $k$-submodular functions subject to matroid constraints and is obtained with an almost linear number of function evaluations. Expand
Differentially Private Submodular Maximization: Data Summarization in Disguise
This work presents privacypreserving algorithms for both monotone and non-monotone submodular maximization under cardinality, matroid, and p-extendible system constraints, with guarantees that are competitive with optimal solutions. Expand
Submodular Optimization under Noise
This work focuses on the question of maximizing a monotone submodular function under a cardinality constraint when given access to a noisy oracle of the function, and shows that no randomized algorithm can obtain an approximation ratio better than 1/2+o(1) and no non-trivial approximation guarantee can be obtained. Expand
Optimal approximation for the submodular welfare problem in the value oracle model
A randomized continuous greedy algorithm is developed which achieves a (1-1/e)-approximation for the Submodular Welfare Problem in the value oracle model and is shown to have a potential of wider applicability on the examples of the Generalized Assignment Problem and the AdWords Assignment Problem. Expand
Distributed Submodular Maximization
This paper develops a simple, two-stage protocol GreeDi, that is easily implemented using MapReduce style computations and demonstrates the effectiveness of the approach on several applications, including sparse Gaussian process inference and exemplar based clustering on tens of millions of examples using Hadoop. Expand
A Unified Continuous Greedy Algorithm for Submodular Maximization
This work presents a new unified continuous greedy algorithm which finds approximate fractional solutions for both the non-monotone and monotone cases, and improves on the approximation ratio for many applications. Expand
Constrained Submodular Maximization: Beyond 1/e
  • Alina Ene, Huy L. Nguyen
  • Mathematics, Computer Science
  • 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2016
This work finds an approximate fractional solution for maximizing the multilinear extension of the function over a down-closed polytope and it is the first improvement over the 1/e approximation achieved by the unified Continuous Greedy algorithm. Expand
Submodular Functions Maximization Problems
This chapter gives two definitions of submodular functions and proves that they are equivalent, and fundamental results on maximizing a special class of functions called sub modular functions under various combinatorial constraints. Expand
Max-Sum diversification, monotone submodular functions and dynamic updates
This paper considers the setting where the authors are given a set of elements in a metric space and a set valuation function f defined on every subset and shows that a natural single swap local search algorithm provides a 2-approximation in this more general setting. Expand
Submodularity Cuts and Applications
This work presents a novel algorithm for maximizing a submodular set function under a cardinality constraint based on a cutting-plane method and implemented as an iterative small-scale binary-integer linear programming procedure. Expand