Efficient structure learning with automatic sparsity selection for causal graph processes

Théophile Griveau-Billion, Ben Calderhead

We propose a novel algorithm for efficiently computing a sparse directed adjacency matrix from a group of time series following a causal graph process. Our solution is scalable for…