# Efficient structure learning with automatic sparsity selection for causal graph processes

@article{GriveauBillion2019EfficientSL, title={Efficient structure learning with automatic sparsity selection for causal graph processes}, author={Th{\'e}ophile Griveau-Billion and Ben Calderhead}, journal={ArXiv}, year={2019}, volume={abs/1906.04479} }

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 both dense and sparse graphs and automatically selects the LASSO coefficient to obtain an appropriate number of edges in the adjacency matrix. Current state-of-the-art approaches rely on sparse-matrix-computation libraries to scale, and either avoid automatic selection of the LASSO penalty coefficient or rely on the… CONTINUE READING

One Citation

Variable-lag Granger Causality and Transfer Entropy for Time Series Analysis

- Mathematics, Computer Science
- 2020

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 10 REFERENCES

Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs.

- Mathematics, Medicine
- 2010

127

Discovering graphical Granger causality using the truncating lasso penalty

- Computer Science, Mathematics
- 2010

140