no code implementations • 4 Feb 2024 • Edwin V. Bonilla, Pantelis Elinas, He Zhao, Maurizio Filippone, Vassili Kitsios, Terry O'Kane
Estimating the structure of a Bayesian network, in the form of a directed acyclic graph (DAG), from observational data is a statistically and computationally hard problem with essential applications in areas such as causal discovery.
no code implementations • 25 Feb 2022 • Pantelis Elinas, Edwin V. Bonilla
Learning useful node and graph representations with graph neural networks (GNNs) is a challenging task.
1 code implementation • NeurIPS 2020 • Pantelis Elinas, Edwin V. Bonilla, Louis Tiao
We propose a framework that lifts the capabilities of graph convolutional networks (GCNs) to scenarios where no input graph is given and increases their robustness to adversarial attacks.