AI Paper Atlas

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

Optimization of Chance-Constrained Submodular Functions

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 41 citations (OpenAlex)

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
Use Chernoff bounds instead of Chebyshev's inequality for the GA surrogateGA with uniform expected weights · Digg influence maximization, most tested δ valuesinfluence spreadHelped
Use Chernoff bounds instead of Chebyshev's inequality for the GA surrogateGA with uniform expected weights · Digg, high budgets and α=0.001 or 0.0001number of selected elementsHelped
Use Chebyshev's inequality instead of Chernoff bounds for the GA surrogateGA with uniform expected weights · Digg, α=0.1 or 0.01influence spreadHelped
Switch between Chebyshev's inequality and Chernoff boundsGGA with degree-dependent expected weights · Digg, B=100 and B=500influence spreadNo clear effect
Increase uncertainty δGA and GGA · Digg influence maximizationinfluence spreadHurt

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