New algorithms learn polytree structures from data.
problem Learning causal graphs from non-Gaussian data.
method Combines Chow-Liu algorithm with edge orientation schemes.
result Established high-dimensional consistency results.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “Polytree Causal Graph”
Researchers study learning polytree graphs from linear SEMs with exact recovery conditions.
problem Learning polytree graphs from linear SEMs with exact recovery conditions.
method Study Gaussian polytree models, derive sufficient and necessary conditions for sample sizes, and establish estimation error bounds.
result Sharp characterization of difficulty with matching sufficient and necessary conditions.
Paper tackles anomaly detection with missing causal knowledge.
problem Detect anomalies with missing structural knowledge.
method Simple, efficient methods for polytree causal graphs.
result Heuristic identifies root causes based on anomaly scores.
Local approach learns causal structure of linear Gaussian polytree models from interventional data.
problem Learning causal structure of linear Gaussian polytree models from interventional data.
method First learns the skeleton and then orients edges of the polytree using second order statistics and low-dimensional marginal distributions.
result Consistent and scalable approach that handles problems with thousands of nodes.
Algorithm recovers large causal tree from small samples.
problem Determining causal structure in large gene networks.
method Algorithm that recovers tree with high accuracy under mild conditions.
result High accuracy in recovering causal tree from small samples.
Efficiently learns polytrees with known skeleton in polynomial time and sample complexity.
problem Learning polytrees with known skeleton structure.
method Proposes an efficient algorithm for learning -polytrees in polynomial time and sample complexity when the skeleton is known.
result Establishes finite-sample guarantees for efficient learning of -polytrees.
Optimal algorithms learn Gaussian trees and polytrees from data.
problem Learning undirected Gaussian trees and polytrees from data.
method Two approaches: Chow-Liu algorithm for tree structure and modified PC algorithm for polytree structure.
result Explicit finite-sample guarantees and matching lower bounds for both approaches.
We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictiv…
Study on learning sparse fixed-structure Gaussian Bayesian networks with near-optimal sample complexity.
problem Learning a fixed-structure Gaussian Bayesian network up to a bounded error in total variation distance.
method Analysis of node-wise least squares regression and introduction of BatchAvgLeastSquares and CauchyEst algorithms.
result BatchAvgLeastSquares and CauchyEstTree have near-optimal sample complexity.
Algorithm learns Bayesian network structure efficiently from data.
problem Learning directed acyclic graphical models from observational data.
method Local Markov boundary search procedure to recursively construct ancestral sets.
result Simple greedy search algorithm learns Markov boundary of each node efficiently.
Paper constructs unfaithful probability distributions in binary causal graphs.
problem Unfaithful probability distributions in binary causal graphs.
method Constructs unfaithful probability distributions in binary causal graphs.
result Examples of unfaithful probability distributions in binary causal graphs.
New algorithms for causal bandits without knowing the graph structure.
problem Causal bandit problems with unknown graph structure.
method Developed novel causal bandit algorithms for causal trees, forests, and general graphs without prior knowledge of the causal graph.
result Regret guarantees significantly improved over standard MAB algorithms under mild conditions.
New method falsifies causal graphs using outlier events.
problem Inferring causal relationships from data is hard.
method Falsify candidate causal graphs based on outlier propagation.
result Statistical tests control false positives and have power guarantees.
GACBO optimizes unknown causal graphs with interventions.
problem Optimizing a target variable on an unknown causal graph with interventions.
method Graph Agnostic Causal Bayesian Optimisation (GACBO) seeks to balance exploitation and exploration of causal structures and functions.
result GACBO outperforms baselines in simulated and real-world applications.
A new algorithm reduces CI tests for causal graph recovery.
problem Exponential CI tests limit causal discovery algorithms.
method CCPG (Causal Consistent Partition Graph) with polynomial CI tests.
result CCPG efficiently recovers causal graph with polynomial tests.
Graph neural network explainer identifies causal subgraphs ensuring predictions.
problem Spurious correlations in GNN explainers.
method Proposes {
ame}, a GNN causal explainer via causal inference.
result Significantly outperforms existing GNN explainers in exact groundtruth explanation identification.
New measures assess differences in causal graphs' separations.
problem Evaluating causal discovery algorithms' output.
method Proposes new distance measures capturing causal graphs' separations.
result Proposed distances assess differences in causal graphs' separations.
Algorithm recovers causal graphs in presence of latent confounders and selection bias.
problem Recovering causal graphs in the presence of latent confounders and selection bias.
method Iterative causal discovery (ICD) algorithm that relies on causal Markov and faithfulness assumptions.
result Sound and complete algorithm that recovers the equivalence class of the underlying causal graph.
Causal inference improves heterophilic graph learning.
problem Capturing asymmetric node dependencies in graph learning.
method Intervention-based causal inference for graph structure learning.
result CausalMP achieves superior link prediction performance.
New framework for dynamic causal graph modeling and effect estimation.
problem Dynamic changes in causal relationships over time.
method Score-based causal discovery with autoregressive model structure.
result Dynamic causal graph with time-varying causal relations.
Optimizes causal effects on unknown graphs using Causal Entropy Optimization.
problem Optimizing causal effects in unknown causal graphs.
method Causal Entropy Optimization (CEO) framework that generalizes Causal Bayesian Optimization (CBO). Incorporates causal structure uncertainty in surrogate models and intervention selection.
result CEO achieves faster convergence to global optimum compared to CBO and improves upon sequential structure learning.
Paper proposes learning causal graphs with only relevant variables.
problem Discovering causal relationships in large-scale graphs often includes irrelevant variables.
method Developed NSCSL algorithm to learn necessary and sufficient causal graphs (NSCG).
result NSCSL algorithm identifies relevant causal features for specific outcomes.
New distances for causal graphs improve evaluation of learned structures.
problem Difficulty in evaluating graphs learned by causal discovery algorithms.
method Developed a framework for causal distances, including new reachability algorithms.
result Improved distances are faster and more scalable than existing methods.
New framework for cyclic quantum causal models with graph separation property.
problem Understanding causal relationships in feedback processes and exotic scenarios.
method Introducing a robust probability rule and a novel graph-separation property, p-separation.
result Established graph-separation properties for all consistent cyclic causal models.
We consider the problem of learning a causal graph over a set of variables with interventions. We study the cost-optimal causal graph learning problem: For a given skeleton (undirected version of the causal graph), design the set of interventions with minimum total cost, that can uniquely identify any causal graph with…
The paper defines conditions for learning causal graphs from data with unobserved variables.
problem Learning causal graphs from data with unobserved variables.
method Formalizes constraint-based structure learning algorithms under conditions and assumptions.
result Natural family of algorithms output Markov equivalent graphs to the causal graph under faithfulness assumption.
Feature Matching Intervention: Leveraging Observational Data for Causal Representation Learningstat.ML
FMI uses matching to mimic interventions for causal feature learning.
problem Challenges in causal discovery from observational data.
method Feature Matching Intervention (FMI) using matching to emulate perfect interventions.
result FMI outperforms in identifying causal features from observational data.
SOLBP extends efficient inference to uncertain Bayesian networks.
problem Inference in uncertain Bayesian networks with second-order probabilities.
method Extends Loopy Belief Propagation to second-order Bayesian networks.
result Generates inferences consistent with sum-product networks, more efficient and scalable.
OrphicX generates causal explanations for GNNs by isolating latent causal factors.
problem Generating interpretable causal explanations for complex graph neural networks.
method Develops a generative model and objective function to isolate latent causal factors, maximizing information flow.
result OrphicX effectively identifies causal semantics, significantly outperforming alternatives.
New algorithm reduces regret in combinatorial causal bandits without graph structure.
problem Minimizing regret in combinatorial causal bandits without graph structure.
method Design of algorithms for binary general causal models and BGLMs without graph skeleton.
result Achieves expected regret for causal models and for BGLMs.
A new metric compares true and learned causal graphs considering data and graph structure.
problem Comparing true and learned causal graphs accurately.
method Continuous Structural Intervention Distance (CSID) using conditional mean embeddings and maximum mean discrepancy.
result Validated the CSID with synthetic data, showing its effectiveness in comparing causal graphs.
New bounds for causal effect identification in time series graphs with latent confounders.
problem Identifying causal effects in time series graphs with latent confounders over unbounded time intervals.
method Applying the Causal Identification algorithm to a constant-size segment of the time series graph.
result A bound on the number of past time steps needed for causal effect identification.
New method estimates causal effects without knowing graph structure.
problem Estimating causal effects when graph structure is unknown.
method Testable conditional independence statements for front-door adjustment.
result Effect estimation without Markov equivalence class knowledge.
New algorithm identifies causal relationships from graphs, even with selection bias.
problem Identifying causal relationships from graphs with selection bias.
method Developed a measure-theoretic version of Pearl's causal calculus and a sound, complete identification algorithm.
result General measure-theoretic version of causal calculus allows for identification of causal relationships under selection bias.
Proposes a new CBO method without known causal graphs.
problem Optimizing outcomes with unknown causal graphs.
method New CBO method focusing on direct causal parents, learning Bayesian posterior over them.
result Empirical validation and competitive performance with GP approximation.
Framework achieves fairness in predictions using partially known causal graph over clusters of variables.
problem Achieving fairness in algorithmic decisions when causal graph knowledge is limited.
method Leverages a causal graph over clusters of variables to train a prediction model, reducing interventional distribution discrepancies.
result Framework strikes a better balance between fairness and accuracy than existing approaches under limited causal graph knowledge.
Neural network learns causal graph structure from data.
problem Inferring causal graph structure from observational and interventional data.
method Supervised training of a neural network on synthetic graphs.
result Learned model generalizes to new graphs, robust to distribution shifts, and outperforms existing methods.
Graph neural networks help infer causal effects from partially observable data.
problem Inferring causal effects from partially observable data.
method Theoretical analysis of GNN and SCM connections.
result Established a new model class for GNN-based causal inference.
The paper shows that relaxing assumptions about causal graphs can lead to exponentially large equivalence classes.
problem The size of Markov equivalence classes under relaxed assumptions.
method Analytical proofs for three settings: sparse random directed acyclic graphs, uniformly random acyclic directed mixed graphs, and uniformly random directed cyclic graphs.
result Exponentially large lower bounds for the expected size of Markov equivalence classes.
Bayesian VAR model discovers Granger causality with uncertainty-aware binary graphs.
problem Discovering Granger causal relations from multivariate time-series data.
method Bayesian Vector AutoRegression with factorised Granger-Causal Graphs.
result Our method achieves better performance, especially in low-data regimes.
Amortized Causal Discovery learns to infer causal graphs from time-series data, improving performance.
problem Inference of causal graphs from time-series data is inefficient due to fitting new models for each sample.
method Proposes Amortized Causal Discovery, a variational model that leverages shared dynamics across samples with different causal graphs.
result Significant improvements in causal discovery performance demonstrated experimentally.
New framework uses background knowledge to speed up causal discovery.
problem Scalable causal discovery for large datasets.
method Utilizes background knowledge during causal discovery process.
result Background knowledge reduces computational requirements and improves structure quality.
A scalable method to learn causal graphs from large data.
problem Learning causal graphs from large scale data is challenging.
method Differentiable Adjacency Test (DAT) to evaluate adjacency in causal graphs.
result DAT-Graph can learn graphs of 1000 variables with state-of-the-art accuracy.
CLEAR learns causal graphs from attention in recommender systems to explain user behavior.
problem Understanding why specific recommendations are made in recommender systems.
method CLEAR learns session-specific causal graphs from attention in pre-trained neural recommenders, addressing latent confounders.
result CLEAR provides counterfactual explanations that are shorter and more effective than naive methods.
Novel graphical models for time series with latent confounders improve causal inference.
problem Causal relationships and independencies in multivariate time series with unobserved confounders.
method Introduced a novel class of graphical models and characterized their properties.
result Novel graphs provide stronger causal inferences without additional assumptions.
DCCD-CONF discovers causal graphs with unmeasured confounders.
problem Discovering causal relationships in systems with unmeasured confounders.
method Differentiable learning of nonlinear cyclic causal graphs using interventional data.
result DCCD-CONF outperforms state-of-the-art methods in causal graph recovery and confounder identification.
We introduce a model for causal structure learning from multivariate functional data, even when graphs have cycles.
problem Discovering causal relationships from multivariate functional data with cycles.
method Functional linear structural equation model with a low-dimensional causal embedded space.
result The proposed model is causally identifiable under standard assumptions.
New method discovers causal relationships in large-scale data.
problem Discovering causal relationships in large datasets with thousands of variables.
method Factor Directed Acyclic Graphs (f-DAGs) combined with continuous optimization.
result Achieved causal discovery on thousands of variables.