Research map / Learning theory and algorithms / Submodular and game algorithms
Fairness in Streaming Submodular Maximization over a Matroid 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Two-pass algorithm (greedy fair reservoir first pass, matroid-intersection second pass) instead of matroid-intersection baseline | TWOPASS-FAIR-STREAMING · Maximum coverage, exemplar clustering, movie recommendation | objective value: at most 15% lower than MATROID-INTERSECTION | Mixed |
| Two-pass algorithm instead of matroid-intersection baseline | TWOPASS-FAIR-STREAMING · Maximum coverage, exemplar clustering, movie recommendation | fairness violations err(S): violation often 2-3 times lower than MATROID-INTERSECTION | Helped |
| One-pass greedy heuristic (GREEDY-FAIR-STREAMING) instead of matroid-intersection baseline | GREEDY-FAIR-STREAMING · Maximum coverage, exemplar clustering, movie recommendation | objective value: lower than MATROID-INTERSECTION by at most 26% | Hurt |
| One-pass greedy heuristic with fair reservoir instead of matroid-intersection baseline | GREEDY-FAIR-STREAMING · Maximum coverage, exemplar clustering, movie recommendation | fairness violations err(S): no violations in any experiment | Helped |
| Random base set selection (no fairness constraints) instead of fair algorithms | RANDOM · Exemplar-based clustering | objective value | Mixed |
| Random base set selection instead of fair algorithms | RANDOM · Maximum coverage and movie recommendation | objective value | Hurt |
Closest papers by meaning
- Improved Algorithms for Fair Matroid Submodular Maximization (NeurIPS 2025 · similarity 0.93)
- Online and Streaming Algorithms for Constrained k-Submodular Maximization (AAAI 2025 · similarity 0.89)
- Streaming Stochastic Submodular Maximization with On-Demand User Requests (NeurIPS 2025 · similarity 0.88)
- Deletion-Robust Submodular Maximization with Knapsack Constraints (AAAI 2024 · similarity 0.88)
- Fair Submodular Cover (ICLR 2025 · similarity 0.87)
- Consistent Submodular Maximization (ICML 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.