activity
20182022
most citedLearning DAGs without imposing acyclicity

5 citations · 15 across the 4 of their papers we have counts for

collaborators
Showing stat.MLShow all

5 papers · 1 filter

stat.ML20222 cited

Structural Learning of Simple Staged Trees

Manuele Leonelli, Gherardo Varando

Bayesian networks faithfully represent the symmetric conditional independences existing between the components of a random vector. Staged trees are an extension of Bayesian network…

stat.ML20205 cited

Learning DAGs without imposing acyclicity

Gherardo Varando

We explore if it is possible to learn a directed acyclic graph (DAG) from data without imposing explicitly the acyclicity constraint. In particular, for Gaussian distributions, we…

stat.ML20203 cited

Sparse Cholesky covariance parametrization for recovering latent structure in ordered data

Irene Córdoba, Concha Bielza, Pedro Larrañaga +1

The sparse Cholesky parametrization of the inverse covariance matrix can be interpreted as a Gaussian Bayesian network; however its counterpart, the covariance Cholesky factor, has…

stat.ML20205 cited

Graphical continuous Lyapunov models

Gherardo Varando, Niels Richard Hansen

The linear Lyapunov equation of a covariance matrix parametrizes the equilibrium covariance matrix of a stochastic process. This parametrization can be interpreted as a new graphic…

stat.ML2020

Causal structure learning from time series: Large regression coefficients may predict causal links better in practice than small p-values

Sebastian Weichwald, Martin E Jakobsen, Phillip B Mogensen +3

In this article, we describe the algorithms for causal structure learning from time series data that won the Causality 4 Climate competition at the Conference on Neural Information…