Deletion-Robust Submodular Maximization at Scale

11/20/2017
by   Ehsan Kazemi, et al.
0

Can we efficiently extract useful information from a large user-generated dataset while protecting the privacy of the users and/or ensuring fairness in representation. We cast this problem as an instance of a deletion-robust submodular maximization where part of the data may be deleted due to privacy concerns or fairness criteria. We propose the first memory-efficient centralized, streaming, and distributed methods with constant-factor approximation guarantees against any number of adversarial deletions. We extensively evaluate the performance of our algorithms against prior state-of-the-art on real-world applications, including (i) Uber-pick up locations with location privacy constraints; (ii) feature selection with fairness constraints for income prediction and crime rate prediction; and (iii) robust to deletion summarization of census data, consisting of 2,458,285 feature vectors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2022

Optimal deletion-robust coreset for submodular maximization

In recent years we have witnessed an increase on the development of meth...
research
11/02/2022

Balancing Utility and Fairness in Submodular Maximization (Technical Report)

Submodular function maximization is central in numerous data science app...
research
02/28/2022

Fast Feature Selection with Fairness Constraints

We study the fundamental problem of selecting optimal features for model...
research
01/31/2022

Deletion Robust Submodular Maximization over Matroids

Maximizing a monotone submodular function is a fundamental task in machi...
research
08/16/2022

Deletion Robust Non-Monotone Submodular Maximization over Matroids

Maximizing a submodular function is a fundamental task in machine learni...
research
05/31/2016

Horizontally Scalable Submodular Maximization

A variety of large-scale machine learning problems can be cast as instan...
research
11/17/2017

Information Gathering with Peers: Submodular Optimization with Peer-Prediction Constraints

We study a problem of optimal information gathering from multiple data p...

Please sign up or login with your details

Forgot password? Click here to reset