atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints

ICML 2022 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms

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 changedWhereMeasuredEffect
Set C=0.5D (and D=B(2^{1/B}-1)) in the streaming primal-dual algorithm for k-submodular maximizationPrimalDual (Algorithm 1) · Influence maximization (Facebook) and sensor placement (Intel Lab), k=3objective value vs GreedyNo clear effect
Use stochastic Greedy instead of deterministic lazy Greedy as baselineOffline Greedy baseline · Influence maximization and sensor placementfunction value and number of evaluationsHurt
Use the streaming primal-dual algorithm with its approximation guarantee rather than offline Greedy (1/3)monotone k-submodular maximization · Theoryapproximation guarantee: guarantee 0.2953 as B→∞ vs 1/3 for offline GreedyHurt
Increase the minimum budget B (larger cardinality constraints)PrimalDual (Algorithm 1) · Theoryapproximation guarantee: from 1/4 at B=1 to approx 0.2953 as B→∞Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy