AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families

Goutham Rajendran, Bohdan Kivva, Ming Gao, Bryon Aragam

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Computational thresholds in graphs and structure · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 vertex-greedy GFBS instead of edge-greedy GESDAG structure learning · Counterexample with equal residual variances (Gaussian BIC)runs with correct DAG: GES fails all the time; GFBS succeeded in all 100Improved
use GFBS instead of GES on re-weighted counterexample (0.9 weights)DAG structure learning · Counterexample X3 = 0.9 X1 + 0.9 X2 + N3correct DAG output: GES always wrong in 100 runs; GFBS always correctImproved
use GFBS (Bregman score) versus Gobnilp global optimum with large samplesGFBS · synthetic d=5 graphs (MC, ER, SF; LIN, SIN, AGP, NGP)score of output DAGNo clear effect
use Itakura-Saito score phi=-log x in finite samplesGFBS · IS score, d=5score of output DAGMixed

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