Research map / Federated learning and privacy / Differential privacy
Differentially Private Submodular Maximization with a Knapsack Constraint
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Fast and Private Submodular and $k$-Submodular Functions Maximization with Matroid Constraints (ICML 2020 · similarity 0.93)
- Differentially Private Submodular Maximization: Data Summarization in Disguise (ICML 2017 · similarity 0.92)
- Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates (NeurIPS 2025 · similarity 0.87)
- Faster Algorithms for User-Level Private Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.87)
- Sampling-Free Privacy Accounting for Matrix Mechanisms under Random Allocation (NeurIPS 2026 · similarity 0.87)
- Instance-Specific Asymmetric Sensitivity in Differential Privacy (NeurIPS 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.