AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Experimentation on Endogenous Graphs

Wenshuo Wang, Edvard Bakhitov, Dominic Coey

AAAI 2026 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 1 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 anchor-subgraph instrumental estimator instead of ERL estimator on post-treatment graphTTE estimation on endogenous bipartite graphs · Simulation (na=2000, nr=400, beta=2)bias of total treatment effect estimateImproved
use anchor estimator instead of ERL estimator on pre-treatment graphTTE estimation on endogenous bipartite graphs · Simulation (na=2000, nr=400, beta=2)biasMixed
increase fraction of anchor edges that disappear (p_anchor) (ablation)Anchor estimator · Simulation (beta=2)biasHurt
increase edge formation intensity (p_non-anchor) (ablation)Anchor estimator · Simulationvariance and CI coverageHurt
use variance under the sharp null as proxy for CIAnchor estimator · Simulation, varying beta and p_anchor95% CI coverageImproved

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