Submodular maximization over data streams with differential privacy noise

DOI10.1016/J.TCS.2022.11.011MaRDI QIDQ2680174zbMATH OpenOpenAlexFDO

Authors Longkun Guo, Kewen Liao, Di Xiao, Pei Yao

Publication date 30 January 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.11.011

zbMATH Keywords

differential privacy noisestreaming algorithmsubmodular maximization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Streaming algorithms for robust submodular maximization
• A survey on streaming algorithms for maximizing submodular functions
• Measured continuous greedy with differential privacy
• Streaming submodular maximization under \(d\)-knapsack constraints
• Submodular Maximization Subject to a Knapsack Constraint Under Noise Models

Cites work

• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Differentially private combinatorial optimization
• scientific article; zbMATH DE number 1614382 (Why is no real title available?)
• scientific article; zbMATH DE number 5485439 (Why is no real title available?)
• Maximizing Non-monotone Submodular Functions
• Online submodular maximization with preemption
• Private coresets
• Random sampling with a reservoir
• What can we learn privately?

Cited in

(3)

• Streaming submodular maximization under differential privacy noise
• Measured continuous greedy with differential privacy
• Differentially private submodular maximization with a cardinality constraint over the integer lattice

Describes a project that uses

Uses Software

• IsolationForest

This page was built for publication: Submodular maximization over data streams with differential privacy noise

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680174)