AI Paper Atlas

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

Causal meets Submodular: Subset Selection with Directed Information

NeurIPS 2016 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms · 45 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 random greedy instead of exhaustive searchsensor placement OPT1 · D1, k=2..8runtime: 10 hours for exhaustive searchHelped
use SmI-based bound instead of 1/e reference boundgreedy guarantee for OPT1 · D1tightness of performance guaranteeHelped
random greedy vs exhaustive optimumOPT1 · D1, k=2..8objective valueNo clear effect
random greedy on non-submodular objectiveOPT2 covariate selection · ST, target XOMobjective valueNo clear effect
positive SmI at greedy locations lifts guarantee above 1/eOPT1 greedy bound · D1guarantee vs 1/e: NSmI 0.382 at k=2 to 0.074 at k=8Helped
sign of SmI varies across kOPT2 greedy bound · STguarantee vs 1-1/e: NSmI -0.305 at k=2, 0.092 at k=8Mixed
greedy covariate selection for structure learning, small networkcausal structure learning · D1 (15 processes)edge recovery: only the edge 6 -> 4 is miss detectedHelped
greedy covariate selection for structure learning, larger networkcausal structure learning · D2 (35 processes)edge recovery (%): 82.69%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