Lower Bounds on Information Requirements for Causal Network Inference

Author name not available (Why is that?)

Publication date: 29 January 2021

Abstract: Recovery of the causal structure of dynamic networks from noisy measurements has long been a problem of intense interest across many areas of science and engineering. Many algorithms have been proposed, but there is no work that compares the performance of the algorithms to converse bounds in a non-asymptotic setting. As a step to address this problem, this paper gives lower bounds on the error probability for causal network support recovery in a linear Gaussian setting. The bounds are based on the use of the Bhattacharyya coefficient for binary hypothesis testing problems with mixture probability distributions. Comparison of the bounds and the performance achieved by two representative recovery algorithms are given for sparse random networks based on the ErdH{o}s-R'enyi model.

Has companion code repository: https://github.com/Veggente/net-inf-eval

This page was built for publication: Lower Bounds on Information Requirements for Causal Network Inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6359405)