atlas

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

Guarantees for Greedy Maximization of Non-submodular Functions with Applications

ICML 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 100 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 GREEDY instead of SDP for Bayesian A-optimality maximizationBayesian A-optimality experimental design · Medium-scale synthetic A-optimalityruntime: roughly two orders of magnitude fasterHelped
Use GREEDY instead of SDP for A-optimalityBayesian A-optimality experimental design · Medium-scale synthetic A-optimalityobjective valueNo clear effect
Use the greedy curvature alpha_G instead of total curvature alpha_total to characterize the problemBayesian A-optimality and LP experiments · Boston Housing and synthetic A-optimalitycurvature estimateHelped
Use greedy submodularity ratio gamma_G to predict performance on determinantal function maximizationDeterminantal function (supermodular) maximization · Synthetic and CIFAR-10 active set selectionapproximation guarantee vs performanceNo clear effect

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