REVIEW 8 cited by
Causal Discovery with Reinforcement 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
Causal Discovery with Reinforcement Learning
read the original abstract
Discovering causal structure among a set of variables is a fundamental problem in many empirical sciences. Traditional score-based casual discovery methods rely on various local heuristics to search for a Directed Acyclic Graph (DAG) according to a predefined score function. While these methods, e.g., greedy equivalence search, may have attractive results with infinite samples and certain model assumptions, they are usually less satisfactory in practice due to finite data and possible violation of assumptions. Motivated by recent advances in neural combinatorial optimization, we propose to use Reinforcement Learning (RL) to search for the DAG with the best scoring. Our encoder-decoder model takes observable data as input and generates graph adjacency matrices that are used to compute rewards. The reward incorporates both the predefined score function and two penalty terms for enforcing acyclicity. In contrast with typical RL applications where the goal is to learn a policy, we use RL as a search strategy and our final output would be the graph, among all graphs generated during training, that achieves the best reward. We conduct experiments on both synthetic and real datasets, and show that the proposed approach not only has an improved search ability but also allows a flexible score function under the acyclicity constraint.
Forward citations
Cited by 8 Pith papers
-
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 ...
-
A Unified Framework for Structure-Aware Clustering and Heterogeneous Causal Graph Learning
DAG-DC-ADMM jointly clusters subjects and learns their cluster-specific causal DAGs via structural equation modeling, groupwise truncated Lasso fusion penalties, and an ADMM solver for the resulting nonconvex problem.
-
Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety
Introduces a regularized estimator achieving optimal MSE rates under a new relative balancedness condition while providing safety guarantees that match independent learning when tasks are unrelated.
-
Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety
Matrix-weighted regularization for robust multi-task regression achieves optimal MSE under weaker spectral assumptions and performs no worse than independent learning when balancedness is poor.
-
Prognostic Value of Lung Ultrasound Biomarkers for Readmission Risk in Congestive Heart Failure: A Pilot Data-Driven Analysis
Pilot study uses pretrained video encoder features from lung ultrasound to predict 30-day CHF readmission, finding lower-lung views and temporal differences most informative with top MLP F1 of 0.80.
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.