REVIEW 13 cited by
Gradient-Based Neural DAG Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Gradient-Based Neural DAG Learning
read the original abstract
We propose a novel score-based approach to learning a directed acyclic graph (DAG) from observational data. We adapt a recently proposed continuous constrained optimization formulation to allow for nonlinear relationships between variables using neural networks. This extension allows to model complex interactions while avoiding the combinatorial nature of the problem. In addition to comparing our method to existing continuous optimization methods, we provide missing empirical comparisons to nonlinear greedy search methods. On both synthetic and real-world data sets, this new method outperforms current continuous methods on most tasks, while being competitive with existing greedy search methods on important metrics for causal inference.
Forward citations
Cited by 13 Pith papers
-
EML-CD: Causal Mechanism Recovery via EML Symbolic Trees in Structure Learning
EML-CD recovers causal DAG structure and closed-form mechanisms via gated EML trees, matching PC/GES SHD on Sachs data while recovering 10 of 11 function families in bivariate tests and outperforming SINDy on mechanism f-MSE.
-
Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data
Asymmetric Langevin Unlearning uses public data to suppress unlearning noise costs by O(1/n_pub²), enabling practical mass unlearning with preserved utility under distribution mismatch.
-
Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data
ALU uses public data to suppress unlearning cost quadratically while characterizing distribution mismatch effects, enabling mass unlearning with maintained utility.
-
TCD-Arena: Assessing Robustness of Time Series Causal Discovery Methods Against Assumption Violations
TCD-Arena is a new customizable testing framework that runs millions of experiments to map how 33 different assumption violations affect time series causal discovery methods and shows ensembles can boost overall robustness.
-
polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs
polyDAG replaces the matrix-exponential acyclicity constraint with a finite polynomial trace constraint proven to be zero exactly on acyclic graphs, plus a geometric-series implementation, yielding faster runtime and ...
-
Stable Causal Discovery via Directed Acyclic Graph Aggregation
DAGgr aggregates weighted candidate DAGs using out-of-sample predictive likelihood and an acyclicity-preserving threshold, with claimed finite-sample bounds and consistency, outperforming baselines in simulations and ...
-
Score-matching-based Structure Learning for Temporal Data on Networks
PICK adds a parent-finding subroutine for leaf nodes to speed up pruning in score-matching causal discovery, extending it from i.i.d. data to static and temporal network data.
-
Do Real-World Datasets Contain Natural Experiments? An Empirical Study Using Causal Feature Selection
Empirical evaluation on synthetic and real-world datasets indicates that natural experiments are present and can be leveraged via causal feature selection to boost model performance.
-
To Use AI as Dice of Possibilities with Timing Computation
A timing-aware possibility-space framework is claimed to enable automatic trajectory discovery and counterfactual timing deduction on 3,276 breast-cancer EHR patients.
-
To Use AI as Dice of Possibilities with Timing Computation
Proposes verb-based paradigm with timing computation to enable data-driven discovery of patient trajectories and counterfactual timing from EHR data without domain knowledge.
-
DCD-PFN: A Decoupling-Aware Foundation Model for Causal Discovery
DCD-PFN pre-trains on synthetic SCMs to learn sample-wise decoupling weights enabling zero-shot Markov boundary identification and parallel global causal graph reconstruction.
-
To Use AI as Dice of Possibilities with Timing Computation
Proposes possibility space, timing computation, and causal factum as a new framework for data-driven trajectory discovery and counterfactual timing deduction on EHR data from 3,276 breast cancer patients.
-
A Review of Causal Decision Making
A review that organizes causal decision making into three stages and consolidates methods into an open Python collection.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.