Tensor variable elimination for plated factor graphs enables exact inference in models with repeated structure.
problem Efficient inference in models with repeated structure.
method Generalized variable elimination to tensor variable elimination on plated factor graphs.
result Tractable inference for a class of plated factor graphs.
GraphVRNN generates graphs with latent variables and node attributes.
problem Generating diverse and complex graph structures.
method Probabilistic autoregressive model for graph generation.
result GraphVRNN can model complicated distributions and generate plausible structures and node attributes.
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.
Paper develops a new model for dynamic graph representation learning.
problem Learning over dynamic graphs with changing topology and node attributes.
method Hierarchical variational model with latent random variables and semi-implicit variational inference.
result SI-VGRNN and VGRNN outperform existing methods in dynamic link prediction.
Paper models graph edge dependencies using latent variables for community detection.
problem Graphs' edge dependencies not fully explained by community membership.
method Introduces auxiliary latent variables to model edge dependencies and analyzes conditions for exact recovery.
result Exact recovery possible by semidefinite programming down to maximum likelihood threshold.
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.
The edge structure of the graph defining an undirected graphical model describes precisely the structure of dependence between the variables in the graph. In many applications, the dependence structure is unknown and it is desirable to learn it from data, often because it is a preliminary step to be able to ascertain c…
Study compares RL and SL for TSP, finds RL better for variable graph sizes.
problem Training deep neural networks for the Travelling Salesman Problem.
method Controlled experiments with supervised and reinforcement learning models on fixed and variable sized graphs.
result Reinforcement learning leads to better generalization to variable graph sizes.
The paper analyzes graph Laplacian regularized estimators for learning latent variables from observations.
problem Learning latent variables from observations with a known topological structure.
method Graph Laplacian regularized estimator, penalized least squares with Laplacian penalty.
result Developed a non-asymptotic bound for estimation error, showing the advantage of graph Laplacian regularized estimators.
A concentration graph associated with a random vector is an undirected graph where each vertex corresponds to one random variable in the vector. The absence of an edge between any pair of vertices (or variables) is equivalent to full conditional independence between these two variables given all the other variables. In…
The paper presents efficient methods for identifying causal graphs with latent variables.
problem Recovering causal graphs with latent variables while minimizing intervention costs.
method Two intervention cost models (linear and identity) are considered. Algorithms are provided for both models.
result Upper bounds on the number of interventions needed for recovery, and approximation factors for the linear cost model.
COMBO optimizes Bayesian Optimization for combinatorial search spaces.
problem Optimizing objectives on combinatorial search spaces with high-order interactions.
method COMBO uses a combinatorial graph and ARD diffusion kernel with Horseshoe prior for efficient modeling and variable selection.
result COMBO outperforms state-of-the-art methods consistently across various benchmarks.
Graph-Structured Cache improves code completion and variable naming tasks.
problem Learning open vocabulary in source code.
method Graph-Structured Cache for handling new words in code.
result Improves code completion and variable naming tasks by over 100%.
Paper proposes AR model for graph sequences.
problem Predicting sequences of graphs with variable topology.
method Formalizes AR model for graphs using GNN to learn and predict next graph.
result Significantly better performance on synthetic graph generation problems.
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.
This work presents entropic constraints from DAGs with hidden variables.
problem Characterizing causal relations in systems with hidden variables.
method Entropic inequality constraints derived from e-separation relations. result These constraints can learn about true causal models from observed data.
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.
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 algorithm groups variables by ancestral relationships to improve causal graph estimation accuracy.
problem Difficulty in estimating causal graphs with small sample sizes relative to variables.
method CAG algorithm groups variables based on ancestral relationships, reducing complexity and improving accuracy.
result CAG outperforms existing methods in estimation accuracy and computation time.
The Kauffman-Vogel polynomials are three variable polynomial invariants of 4-valent rigid vertex graphs. A one-variable specialization of the Kauffman-Vogel polynomials for unoriented 4-valent rigid vertex graphs was given by using the Kauffman bracket and the Jones-Wenzl idempotent colored with 2. Bataineh, Elha…
Researchers identify critical protein residues using advanced graph theory.
problem Identifying essential residues in proteins for function.
method Learning Random Geometric Graphs (RGG) with Cramer's V correlation and organic thresholding.
result Advanced RGG methods accurately identify critical residues compared to existing techniques.
Unified framework for modeling hierarchical spaces in design problems.
problem Challenges in modeling hierarchical, conditional, heterogeneous, or tree-structured domains.
method Unified framework combining feature modeling and graph theory, introducing meta and partially-decreed variables.
result Demonstrated effectiveness on complex system design problems, including neural networks and green-aircraft.
New Alexander polynomial defined for transverse graphs.
problem Defining a polynomial invariant for transverse graphs.
method Rotation number extension and multi-variable Alexander polynomial.
result Invariant coincides with Uq(gl(1∣1))-Alexander polynomial. We consider unsupervised estimation of mixtures of discrete graphical models, where the class variable corresponding to the mixture components is hidden and each mixture component over the observed variables can have a potentially different Markov graph structure and parameters. We propose a novel approach for estimati…
This paper tackles causal representation learning from multiple distributions without hard interventions.
problem Recovering latent causal variables and their relations from multiple distributions.
method Develops general solutions for causal representation learning without hard interventions, under sparsity constraints and suitable change conditions.
result Recovering the moralized graph of the underlying directed acyclic graph and latent variables related to the underlying causal model.
In this work, we consider an extension of graphical models to random graphs, trees, and other objects. To do this, many fundamental concepts for multivariate random variables (e.g., marginal variables, Gibbs distribution, Markov properties) must be extended to other mathematical objects; it turns out that this extensio…
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.
Bayesian networks with hidden variables help identify causal relationships obscured by confounding.
problem Identifying causal relationships obscured by unobserved confounders.
method Use finite k-mixtures of Bayesian networks with hidden variables to recover the joint probability distribution and identify causal relationships. result First algorithm to learn mixtures of non-empty DAGs, recovering identifiable causal relationships.
The reparameterization trick enables optimizing large scale stochastic computation graphs via gradient descent. The essence of the trick is to refactor each stochastic node into a differentiable function of its parameters and a random variable with fixed distribution. After refactoring, the gradients of the loss propag…
Framework for completing computational graphs using Gaussian Processes.
problem Completing computational graphs from incomplete data.
method Using Gaussian Processes to approximate unknown functions and recover unobserved variables.
result Efficiently completes computational graphs with fewer data points.
Probabilistic graphical models offer a powerful framework to account for the dependence structure between variables, which is represented as a graph. However, the dependence between variables may render inference tasks intractable. In this paper we review techniques exploiting the graph structure for exact inference, b…
Develops a new framework for causal models on cyclic graphs, solving unique solvability issues.
problem Challenges in specifying unique probability distributions for cyclic functional causal models.
method Introduces a new probability rule and graph-separation property (p-separation) for cyclic fCMs.
result Proves p-separation is sound and complete for all consistent cyclic fCMs, recovering d-separation for DAGs.
Graphical causal models are an important tool for knowledge discovery because they can represent both the causal relations between variables and the multivariate probability distributions over the data. Once learned, causal graphs can be used for classification, feature selection and hypothesis generation, while reveal…
This paper extends stable blanket theory to models with hidden variables and causal cycles.
problem Identifying stable predictors in models with hidden variables and causal cycles.
method Use acyclic directed mixed graphs (ADMGs) and directed graphs (DGs) with m-separation and σ-separation to characterize and construct intervention-stable predictor sets. result Graphical characterizations of Markov blankets, stable frontiers, and stable blankets in models with hidden variables and cycles.
Study optimal adjustment sets for causal policies with hidden variables.
problem Estimating dynamic treatment regimes with hidden variables.
method Developed criteria for graphs without hidden variables to compare estimators, extended to dynamic policies and hidden variables.
result Existence and computation of optimal minimal and globally optimal adjustment sets.
A novel graph spectral method for mixed categorical and numerical data.
problem Feature learning for mixed data types (numerical and categorical).
method Graph spectral decomposition of the graph Laplacian to model probabilistic dependence structure.
result Increased separability and clusterability of observations in the transformed feature space.
Probabilistic inference in graphical models is the task of computing marginal and conditional densities of interest from a factorized representation of a joint probability distribution. Inference algorithms such as variable elimination and belief propagation take advantage of constraints embedded in this factorization …
Efficient algorithms learn causal graphs with minimal interventions.
problem Learning causal relationships between observed variables in the presence of latents.
method Bi-criteria approximation goal combining intervention design and graph property testing.
result Achieve intervention cost within a small constant factor of the optimal.
Graph neural nets learn better branch-and-bound policies.
problem Combinatorial optimization problems, especially hard ones.
method Graph convolutional neural network model trained via imitation learning.
result Improves over state-of-the-art methods and expert-designed rules.
A fast algorithm for counting Markov equivalent DAGs and designing experiments.
problem Counting Markov equivalent DAGs and designing experiments efficiently.
method LazyIter algorithm for efficient iteration over MECs, utilizing intervention results.
result Significant reduction in time complexity for sparse graphs (O(n)).
Polynomial delay algorithm tests causal models with hidden variables.
problem Testing causal models with hidden variables in polynomial delay.
method c-component local Markov property (C-LMP) and polynomial delay algorithm.
result First algorithm for poly-delay testing of CIs in causal graphs with hidden variables.
Graph Structured Prediction Energy Networks model correlations for joint inference.
problem Joint inference over multiple variables with high-order correlations.
method Energy Networks for modeling explicit local and implicit higher-order correlations.
result Tractable inference with explicit modeling of correlations.
In this paper, we study classes of graphs with three types of edges that capture the modified independence structure of a directed acyclic graph (DAG) after marginalisation over unobserved variables and conditioning on selection variables using the m-separation criterion. These include MC, summary, and ancestral grap…
Novel multigraph network improves chemical classification tasks.
problem Learning from variable graphs with multiple relationships.
method Proposed a multigraph network using Chebyshev GCNs to handle variable graphs and learned edges.
result Achieved competitive results on chemical classification benchmarks.
New method infers causal factors from large-scale data without full graph reconstruction.
problem Inferring causal variables from large-scale systems without full causal graph reconstruction.
method Supervised learning on simulated data using a neural network and subsampled-ensemble inference.
result Efficiently identifies causal relationships in large-scale gene regulatory networks.
Proposes a GNN framework for multivariate time series forecasting.
problem Lack of exploiting latent spatial dependencies in multivariate time series forecasting.
method Automatically extracts graph structures from multivariate time series data, integrates external knowledge, and uses mix-hop and dilated inception layers for capturing dependencies.
result Outperforms state-of-the-art methods on 3 out of 4 benchmark datasets.
GraphTEE estimates treatment effects on graph-structured targets, mitigating bias.
problem Understanding treatment effects on graph-structured targets with observational bias.
method GraphTEE framework focusing on confounding variable sets and new regularization.
result GraphTEE mitigates bias better than previous methods.
New method controls false edge detections in Gaussian graphical models.
problem High false edge detections in well-established estimators.
method Nodewise variable selection approach to control false discovery rate.
result Significant gain in performance compared to competing methods.