Skip to content
TIme series DiscoverY BENCHmark (tidybench)
Fortran Python
Branch: master
Clone or download

Latest commit

Fetching latest commit…
Cannot retrieve the latest commit at this time.

Files

Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
examples Add selvar to toy Feb 21, 2020
tidybench Update selvarF fixing coefs normalization Feb 24, 2020
.gitignore Initial commit. Feb 19, 2020
LICENSE
MAINTAINERS
README.md
requirements.txt List requirements. Feb 19, 2020

README.md

TIme series DiscoverY BENCHmark (tidybench)

This repository holds implementations of the following four algorithms for causal structure learning for time series,

  • SLARAC (Subsampled Linear Auto-Regression Absolute Coefficients),
  • QRBS (Quantiles of Ridge regressed Bootstrap Samples),
  • LASAR (LASso Auto-Regression),
  • SELVAR (Selective auto-regressive model),

which came in first in 18 and close second in 13 out of the 34 competition categories in the Causality 4 Climate competition at the Conference on Neural Information Processing Systems 2019 (NeurIPS). For details on the competition tasks and the outcomes you may watch the recording of the NeurIPS session or consult the result slides. (Algorithm names map as follows between tidybench and our competition implementations: tidybench.slarac was varvar, tidybench.qrbs was ridge, tidybench.lasar was varvar(lasso=True), and tidybench.selvar was selvar.)

More details can be found in this preprint and the respective well-documented code files.

Feel free to use our algorithms (AGPL-3.0 license). In fact, we encourage their use as baseline benchmarks and guidance of future algorithmic and methodological developments for structure learning from time series. We kindly ask you to cite above mentioned preprint in case you find our code useful.

Note: We are currently still in the progress of migrating and polishing the algorithms QRBS and SELVAR from their original versions that we used in the competition to a standalone version in this repository.

What you get

Input: time series data (and some method-specific parameters)

Output: score matrix indicating which structural links are inferred likely to exist

All four algorithms take as input multivariate time series data in form of a T x d matrix of T time samples of d variables and output a d x d score/adjacency matrix A. The (i,j)th entry corresponds to an edge from the i-th to the j-th time series component, where higher values correspond to edges that are inferred to be more likely to exist, given the observed data.

Example

At the moment, only a toy example is provided.

Requirements

SLARAC, QRBS, and LASAR require numpy and sklearn. These requirements are listed in the requirements.txt and can be installed via pip install -r requirements.txt.

SELVAR requires lapack/blas installed and the compilation of selvarF.f with f2py (e.g. f2py -llapack -c -m selvarF selvarF.f).

Who we are

We are a team of PhD students and Postdocs that formed at the Copenhagen Causality Lab (CoCaLa) of the University of Copenhagen (Martin E Jakobsen, Phillip B Mogensen, Lasse Petersen, Nikolaj Thams, Gherardo Varando, Sebastian Weichwald) to participate in the C4C competition.

You can’t perform that action at this time.